./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_117bd3c3-4192-474d-a81b-6f626d709b06/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_117bd3c3-4192-474d-a81b-6f626d709b06/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_117bd3c3-4192-474d-a81b-6f626d709b06/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_117bd3c3-4192-474d-a81b-6f626d709b06/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_117bd3c3-4192-474d-a81b-6f626d709b06/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_117bd3c3-4192-474d-a81b-6f626d709b06/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 c5a3d22d49117f02662b197492bc1b16616a2878 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 12:34:20,433 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 12:34:20,434 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 12:34:20,442 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 12:34:20,443 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 12:34:20,443 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 12:34:20,444 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 12:34:20,445 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 12:34:20,446 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 12:34:20,447 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 12:34:20,448 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 12:34:20,448 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 12:34:20,448 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 12:34:20,449 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 12:34:20,450 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 12:34:20,450 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 12:34:20,451 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 12:34:20,452 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 12:34:20,453 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 12:34:20,454 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 12:34:20,455 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 12:34:20,456 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 12:34:20,457 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 12:34:20,458 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 12:34:20,458 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 12:34:20,458 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 12:34:20,459 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 12:34:20,460 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 12:34:20,460 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 12:34:20,461 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 12:34:20,461 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 12:34:20,461 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 12:34:20,462 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 12:34:20,462 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 12:34:20,462 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 12:34:20,463 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 12:34:20,463 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_117bd3c3-4192-474d-a81b-6f626d709b06/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 12:34:20,472 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 12:34:20,472 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 12:34:20,473 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 12:34:20,473 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 12:34:20,473 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 12:34:20,473 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 12:34:20,474 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 12:34:20,474 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 12:34:20,474 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 12:34:20,474 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 12:34:20,474 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 12:34:20,474 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 12:34:20,475 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 12:34:20,475 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 12:34:20,475 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 12:34:20,475 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 12:34:20,475 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 12:34:20,475 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 12:34:20,475 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 12:34:20,475 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 12:34:20,476 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 12:34:20,476 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 12:34:20,476 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 12:34:20,476 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 12:34:20,476 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 12:34:20,476 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 12:34:20,476 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 12:34:20,477 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 12:34:20,477 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 12:34:20,477 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 12:34:20,477 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 12:34:20,477 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 12:34:20,477 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 12:34:20,477 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 12:34:20,477 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_117bd3c3-4192-474d-a81b-6f626d709b06/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 -> c5a3d22d49117f02662b197492bc1b16616a2878 [2018-11-10 12:34:20,500 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 12:34:20,510 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 12:34:20,512 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 12:34:20,513 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 12:34:20,513 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 12:34:20,513 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_117bd3c3-4192-474d-a81b-6f626d709b06/bin-2019/utaipan/../../sv-benchmarks/c/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 12:34:20,551 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_117bd3c3-4192-474d-a81b-6f626d709b06/bin-2019/utaipan/data/4040f48bb/9d800e5e433142c5b69fcc7b36ab7aa8/FLAGa2be2d5fc [2018-11-10 12:34:20,867 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 12:34:20,868 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_117bd3c3-4192-474d-a81b-6f626d709b06/sv-benchmarks/c/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 12:34:20,874 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_117bd3c3-4192-474d-a81b-6f626d709b06/bin-2019/utaipan/data/4040f48bb/9d800e5e433142c5b69fcc7b36ab7aa8/FLAGa2be2d5fc [2018-11-10 12:34:20,884 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_117bd3c3-4192-474d-a81b-6f626d709b06/bin-2019/utaipan/data/4040f48bb/9d800e5e433142c5b69fcc7b36ab7aa8 [2018-11-10 12:34:20,887 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 12:34:20,888 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 12:34:20,889 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 12:34:20,889 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 12:34:20,892 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 12:34:20,893 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:34:20" (1/1) ... [2018-11-10 12:34:20,895 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18da3d15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:34:20, skipping insertion in model container [2018-11-10 12:34:20,896 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:34:20" (1/1) ... [2018-11-10 12:34:20,904 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 12:34:20,923 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 12:34:21,038 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:34:21,041 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 12:34:21,067 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:34:21,077 INFO L193 MainTranslator]: Completed translation [2018-11-10 12:34:21,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:34:21 WrapperNode [2018-11-10 12:34:21,078 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 12:34:21,078 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 12:34:21,078 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 12:34:21,079 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 12:34:21,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:34:21" (1/1) ... [2018-11-10 12:34:21,089 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:34:21" (1/1) ... [2018-11-10 12:34:21,094 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 12:34:21,094 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 12:34:21,095 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 12:34:21,095 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 12:34:21,105 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:34:21" (1/1) ... [2018-11-10 12:34:21,105 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:34:21" (1/1) ... [2018-11-10 12:34:21,106 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:34:21" (1/1) ... [2018-11-10 12:34:21,106 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:34:21" (1/1) ... [2018-11-10 12:34:21,111 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:34:21" (1/1) ... [2018-11-10 12:34:21,118 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:34:21" (1/1) ... [2018-11-10 12:34:21,119 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:34:21" (1/1) ... [2018-11-10 12:34:21,121 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 12:34:21,122 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 12:34:21,122 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 12:34:21,122 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 12:34:21,123 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:34:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_117bd3c3-4192-474d-a81b-6f626d709b06/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-10 12:34:21,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 12:34:21,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 12:34:21,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 12:34:21,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 12:34:21,219 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 12:34:21,220 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 12:34:21,509 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 12:34:21,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:34:21 BoogieIcfgContainer [2018-11-10 12:34:21,509 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 12:34:21,510 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 12:34:21,510 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 12:34:21,512 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 12:34:21,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:34:20" (1/3) ... [2018-11-10 12:34:21,512 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@718b9a26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:34:21, skipping insertion in model container [2018-11-10 12:34:21,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:34:21" (2/3) ... [2018-11-10 12:34:21,513 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@718b9a26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:34:21, skipping insertion in model container [2018-11-10 12:34:21,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:34:21" (3/3) ... [2018-11-10 12:34:21,514 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 12:34:21,520 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 12:34:21,525 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 12:34:21,534 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 12:34:21,554 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 12:34:21,554 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 12:34:21,554 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 12:34:21,554 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 12:34:21,554 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 12:34:21,554 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 12:34:21,554 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 12:34:21,555 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 12:34:21,568 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2018-11-10 12:34:21,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 12:34:21,573 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:34:21,574 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-10 12:34:21,576 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:34:21,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:34:21,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1553015003, now seen corresponding path program 1 times [2018-11-10 12:34:21,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:34:21,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:21,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:34:21,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:21,615 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:34:21,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:34:21,720 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-10 12:34:21,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:34:21,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:34:21,722 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:34:21,726 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:34:21,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:34:21,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:34:21,736 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 3 states. [2018-11-10 12:34:21,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:34:21,788 INFO L93 Difference]: Finished difference Result 113 states and 200 transitions. [2018-11-10 12:34:21,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:34:21,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-10 12:34:21,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:34:21,796 INFO L225 Difference]: With dead ends: 113 [2018-11-10 12:34:21,797 INFO L226 Difference]: Without dead ends: 98 [2018-11-10 12:34:21,799 INFO L605 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-10 12:34:21,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-10 12:34:21,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 67. [2018-11-10 12:34:21,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-10 12:34:21,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 122 transitions. [2018-11-10 12:34:21,832 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 122 transitions. Word has length 25 [2018-11-10 12:34:21,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:34:21,832 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 122 transitions. [2018-11-10 12:34:21,832 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:34:21,833 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 122 transitions. [2018-11-10 12:34:21,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 12:34:21,833 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:34:21,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-10 12:34:21,834 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:34:21,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:34:21,834 INFO L82 PathProgramCache]: Analyzing trace with hash -35332899, now seen corresponding path program 1 times [2018-11-10 12:34:21,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:34:21,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:21,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:34:21,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:21,835 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:34:21,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:34:21,888 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-10 12:34:21,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:34:21,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:34:21,889 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:34:21,890 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:34:21,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:34:21,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:34:21,891 INFO L87 Difference]: Start difference. First operand 67 states and 122 transitions. Second operand 3 states. [2018-11-10 12:34:21,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:34:21,920 INFO L93 Difference]: Finished difference Result 160 states and 295 transitions. [2018-11-10 12:34:21,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:34:21,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-10 12:34:21,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:34:21,922 INFO L225 Difference]: With dead ends: 160 [2018-11-10 12:34:21,922 INFO L226 Difference]: Without dead ends: 98 [2018-11-10 12:34:21,923 INFO L605 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-10 12:34:21,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-10 12:34:21,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2018-11-10 12:34:21,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-10 12:34:21,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 175 transitions. [2018-11-10 12:34:21,932 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 175 transitions. Word has length 25 [2018-11-10 12:34:21,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:34:21,933 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 175 transitions. [2018-11-10 12:34:21,933 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:34:21,933 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 175 transitions. [2018-11-10 12:34:21,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 12:34:21,934 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:34:21,934 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-10 12:34:21,934 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:34:21,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:34:21,934 INFO L82 PathProgramCache]: Analyzing trace with hash 899036922, now seen corresponding path program 1 times [2018-11-10 12:34:21,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:34:21,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:21,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:34:21,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:21,936 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:34:21,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:34:21,976 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-10 12:34:21,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:34:21,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:34:21,976 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:34:21,977 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:34:21,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:34:21,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:34:21,977 INFO L87 Difference]: Start difference. First operand 96 states and 175 transitions. Second operand 3 states. [2018-11-10 12:34:22,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:34:22,003 INFO L93 Difference]: Finished difference Result 148 states and 265 transitions. [2018-11-10 12:34:22,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:34:22,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-10 12:34:22,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:34:22,004 INFO L225 Difference]: With dead ends: 148 [2018-11-10 12:34:22,004 INFO L226 Difference]: Without dead ends: 102 [2018-11-10 12:34:22,005 INFO L605 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-10 12:34:22,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-10 12:34:22,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2018-11-10 12:34:22,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-10 12:34:22,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 178 transitions. [2018-11-10 12:34:22,013 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 178 transitions. Word has length 26 [2018-11-10 12:34:22,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:34:22,013 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 178 transitions. [2018-11-10 12:34:22,013 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:34:22,013 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 178 transitions. [2018-11-10 12:34:22,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 12:34:22,013 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:34:22,014 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-10 12:34:22,014 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:34:22,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:34:22,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1095107784, now seen corresponding path program 1 times [2018-11-10 12:34:22,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:34:22,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:22,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:34:22,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:22,015 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:34:22,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:34:22,047 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-10 12:34:22,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:34:22,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:34:22,048 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:34:22,048 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:34:22,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:34:22,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:34:22,048 INFO L87 Difference]: Start difference. First operand 100 states and 178 transitions. Second operand 3 states. [2018-11-10 12:34:22,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:34:22,076 INFO L93 Difference]: Finished difference Result 189 states and 341 transitions. [2018-11-10 12:34:22,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:34:22,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-10 12:34:22,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:34:22,077 INFO L225 Difference]: With dead ends: 189 [2018-11-10 12:34:22,077 INFO L226 Difference]: Without dead ends: 187 [2018-11-10 12:34:22,078 INFO L605 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-10 12:34:22,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-11-10 12:34:22,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 131. [2018-11-10 12:34:22,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-10 12:34:22,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 235 transitions. [2018-11-10 12:34:22,087 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 235 transitions. Word has length 26 [2018-11-10 12:34:22,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:34:22,087 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 235 transitions. [2018-11-10 12:34:22,087 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:34:22,087 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 235 transitions. [2018-11-10 12:34:22,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 12:34:22,088 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:34:22,088 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-10 12:34:22,088 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:34:22,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:34:22,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1611511610, now seen corresponding path program 1 times [2018-11-10 12:34:22,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:34:22,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:22,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:34:22,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:22,090 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:34:22,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:34:22,114 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-10 12:34:22,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:34:22,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:34:22,114 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:34:22,115 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:34:22,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:34:22,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:34:22,115 INFO L87 Difference]: Start difference. First operand 131 states and 235 transitions. Second operand 3 states. [2018-11-10 12:34:22,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:34:22,136 INFO L93 Difference]: Finished difference Result 311 states and 565 transitions. [2018-11-10 12:34:22,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:34:22,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-10 12:34:22,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:34:22,137 INFO L225 Difference]: With dead ends: 311 [2018-11-10 12:34:22,138 INFO L226 Difference]: Without dead ends: 189 [2018-11-10 12:34:22,138 INFO L605 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-10 12:34:22,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-11-10 12:34:22,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 187. [2018-11-10 12:34:22,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-11-10 12:34:22,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 335 transitions. [2018-11-10 12:34:22,147 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 335 transitions. Word has length 26 [2018-11-10 12:34:22,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:34:22,147 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 335 transitions. [2018-11-10 12:34:22,147 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:34:22,147 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 335 transitions. [2018-11-10 12:34:22,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 12:34:22,148 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:34:22,148 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-10 12:34:22,149 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:34:22,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:34:22,149 INFO L82 PathProgramCache]: Analyzing trace with hash 411609490, now seen corresponding path program 1 times [2018-11-10 12:34:22,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:34:22,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:22,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:34:22,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:22,150 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:34:22,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:34:22,180 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-10 12:34:22,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:34:22,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:34:22,181 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:34:22,181 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:34:22,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:34:22,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:34:22,181 INFO L87 Difference]: Start difference. First operand 187 states and 335 transitions. Second operand 3 states. [2018-11-10 12:34:22,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:34:22,200 INFO L93 Difference]: Finished difference Result 280 states and 500 transitions. [2018-11-10 12:34:22,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:34:22,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-10 12:34:22,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:34:22,202 INFO L225 Difference]: With dead ends: 280 [2018-11-10 12:34:22,202 INFO L226 Difference]: Without dead ends: 191 [2018-11-10 12:34:22,202 INFO L605 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-10 12:34:22,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-11-10 12:34:22,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 189. [2018-11-10 12:34:22,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-11-10 12:34:22,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 335 transitions. [2018-11-10 12:34:22,211 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 335 transitions. Word has length 27 [2018-11-10 12:34:22,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:34:22,211 INFO L481 AbstractCegarLoop]: Abstraction has 189 states and 335 transitions. [2018-11-10 12:34:22,211 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:34:22,211 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 335 transitions. [2018-11-10 12:34:22,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 12:34:22,212 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:34:22,212 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-10 12:34:22,212 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:34:22,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:34:22,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1582535216, now seen corresponding path program 1 times [2018-11-10 12:34:22,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:34:22,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:22,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:34:22,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:22,214 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:34:22,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:34:22,245 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-10 12:34:22,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:34:22,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:34:22,246 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:34:22,246 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:34:22,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:34:22,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:34:22,247 INFO L87 Difference]: Start difference. First operand 189 states and 335 transitions. Second operand 3 states. [2018-11-10 12:34:22,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:34:22,266 INFO L93 Difference]: Finished difference Result 357 states and 641 transitions. [2018-11-10 12:34:22,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:34:22,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-10 12:34:22,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:34:22,268 INFO L225 Difference]: With dead ends: 357 [2018-11-10 12:34:22,268 INFO L226 Difference]: Without dead ends: 355 [2018-11-10 12:34:22,268 INFO L605 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-10 12:34:22,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-11-10 12:34:22,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 253. [2018-11-10 12:34:22,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-11-10 12:34:22,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 447 transitions. [2018-11-10 12:34:22,278 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 447 transitions. Word has length 27 [2018-11-10 12:34:22,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:34:22,278 INFO L481 AbstractCegarLoop]: Abstraction has 253 states and 447 transitions. [2018-11-10 12:34:22,278 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:34:22,278 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 447 transitions. [2018-11-10 12:34:22,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 12:34:22,279 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:34:22,279 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-10 12:34:22,279 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:34:22,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:34:22,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1124084178, now seen corresponding path program 1 times [2018-11-10 12:34:22,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:34:22,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:22,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:34:22,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:22,281 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:34:22,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:34:22,309 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-10 12:34:22,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:34:22,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:34:22,309 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:34:22,310 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:34:22,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:34:22,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:34:22,310 INFO L87 Difference]: Start difference. First operand 253 states and 447 transitions. Second operand 3 states. [2018-11-10 12:34:22,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:34:22,337 INFO L93 Difference]: Finished difference Result 605 states and 1077 transitions. [2018-11-10 12:34:22,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:34:22,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-10 12:34:22,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:34:22,338 INFO L225 Difference]: With dead ends: 605 [2018-11-10 12:34:22,338 INFO L226 Difference]: Without dead ends: 363 [2018-11-10 12:34:22,340 INFO L605 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-10 12:34:22,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-11-10 12:34:22,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 361. [2018-11-10 12:34:22,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-11-10 12:34:22,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 635 transitions. [2018-11-10 12:34:22,349 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 635 transitions. Word has length 27 [2018-11-10 12:34:22,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:34:22,349 INFO L481 AbstractCegarLoop]: Abstraction has 361 states and 635 transitions. [2018-11-10 12:34:22,349 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:34:22,349 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 635 transitions. [2018-11-10 12:34:22,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 12:34:22,350 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:34:22,350 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-10 12:34:22,351 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:34:22,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:34:22,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1813738673, now seen corresponding path program 1 times [2018-11-10 12:34:22,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:34:22,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:22,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:34:22,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:22,352 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:34:22,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:34:22,372 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-10 12:34:22,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:34:22,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:34:22,372 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:34:22,372 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:34:22,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:34:22,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:34:22,373 INFO L87 Difference]: Start difference. First operand 361 states and 635 transitions. Second operand 3 states. [2018-11-10 12:34:22,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:34:22,388 INFO L93 Difference]: Finished difference Result 541 states and 949 transitions. [2018-11-10 12:34:22,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:34:22,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-10 12:34:22,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:34:22,390 INFO L225 Difference]: With dead ends: 541 [2018-11-10 12:34:22,390 INFO L226 Difference]: Without dead ends: 367 [2018-11-10 12:34:22,391 INFO L605 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-10 12:34:22,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-11-10 12:34:22,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 365. [2018-11-10 12:34:22,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-11-10 12:34:22,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 635 transitions. [2018-11-10 12:34:22,398 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 635 transitions. Word has length 28 [2018-11-10 12:34:22,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:34:22,399 INFO L481 AbstractCegarLoop]: Abstraction has 365 states and 635 transitions. [2018-11-10 12:34:22,399 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:34:22,399 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 635 transitions. [2018-11-10 12:34:22,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 12:34:22,400 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:34:22,400 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-10 12:34:22,400 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:34:22,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:34:22,400 INFO L82 PathProgramCache]: Analyzing trace with hash 487083917, now seen corresponding path program 1 times [2018-11-10 12:34:22,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:34:22,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:22,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:34:22,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:22,402 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:34:22,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:34:22,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-10 12:34:22,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:34:22,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:34:22,429 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:34:22,429 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:34:22,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:34:22,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:34:22,430 INFO L87 Difference]: Start difference. First operand 365 states and 635 transitions. Second operand 3 states. [2018-11-10 12:34:22,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:34:22,447 INFO L93 Difference]: Finished difference Result 685 states and 1209 transitions. [2018-11-10 12:34:22,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:34:22,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-10 12:34:22,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:34:22,449 INFO L225 Difference]: With dead ends: 685 [2018-11-10 12:34:22,449 INFO L226 Difference]: Without dead ends: 683 [2018-11-10 12:34:22,450 INFO L605 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-10 12:34:22,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2018-11-10 12:34:22,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 497. [2018-11-10 12:34:22,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2018-11-10 12:34:22,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 855 transitions. [2018-11-10 12:34:22,461 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 855 transitions. Word has length 28 [2018-11-10 12:34:22,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:34:22,461 INFO L481 AbstractCegarLoop]: Abstraction has 497 states and 855 transitions. [2018-11-10 12:34:22,461 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:34:22,461 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 855 transitions. [2018-11-10 12:34:22,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 12:34:22,462 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:34:22,463 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-10 12:34:22,463 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:34:22,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:34:22,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1101263985, now seen corresponding path program 1 times [2018-11-10 12:34:22,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:34:22,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:22,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:34:22,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:22,464 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:34:22,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:34:22,484 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-10 12:34:22,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:34:22,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:34:22,485 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:34:22,485 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:34:22,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:34:22,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:34:22,486 INFO L87 Difference]: Start difference. First operand 497 states and 855 transitions. Second operand 3 states. [2018-11-10 12:34:22,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:34:22,506 INFO L93 Difference]: Finished difference Result 1189 states and 2057 transitions. [2018-11-10 12:34:22,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:34:22,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-10 12:34:22,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:34:22,509 INFO L225 Difference]: With dead ends: 1189 [2018-11-10 12:34:22,509 INFO L226 Difference]: Without dead ends: 707 [2018-11-10 12:34:22,510 INFO L605 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-10 12:34:22,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2018-11-10 12:34:22,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 705. [2018-11-10 12:34:22,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705 states. [2018-11-10 12:34:22,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 1207 transitions. [2018-11-10 12:34:22,525 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 1207 transitions. Word has length 28 [2018-11-10 12:34:22,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:34:22,525 INFO L481 AbstractCegarLoop]: Abstraction has 705 states and 1207 transitions. [2018-11-10 12:34:22,525 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:34:22,525 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 1207 transitions. [2018-11-10 12:34:22,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 12:34:22,526 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:34:22,526 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-10 12:34:22,526 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:34:22,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:34:22,527 INFO L82 PathProgramCache]: Analyzing trace with hash -2080054649, now seen corresponding path program 1 times [2018-11-10 12:34:22,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:34:22,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:22,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:34:22,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:22,528 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:34:22,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:34:22,561 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-10 12:34:22,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:34:22,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:34:22,562 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:34:22,562 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:34:22,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:34:22,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:34:22,562 INFO L87 Difference]: Start difference. First operand 705 states and 1207 transitions. Second operand 3 states. [2018-11-10 12:34:22,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:34:22,578 INFO L93 Difference]: Finished difference Result 1057 states and 1805 transitions. [2018-11-10 12:34:22,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:34:22,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-10 12:34:22,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:34:22,580 INFO L225 Difference]: With dead ends: 1057 [2018-11-10 12:34:22,580 INFO L226 Difference]: Without dead ends: 715 [2018-11-10 12:34:22,580 INFO L605 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-10 12:34:22,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2018-11-10 12:34:22,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 713. [2018-11-10 12:34:22,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2018-11-10 12:34:22,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1207 transitions. [2018-11-10 12:34:22,593 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1207 transitions. Word has length 29 [2018-11-10 12:34:22,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:34:22,593 INFO L481 AbstractCegarLoop]: Abstraction has 713 states and 1207 transitions. [2018-11-10 12:34:22,593 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:34:22,594 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1207 transitions. [2018-11-10 12:34:22,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 12:34:22,594 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:34:22,595 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-10 12:34:22,595 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:34:22,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:34:22,595 INFO L82 PathProgramCache]: Analyzing trace with hash 220767941, now seen corresponding path program 1 times [2018-11-10 12:34:22,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:34:22,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:22,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:34:22,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:22,596 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:34:22,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:34:22,612 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-10 12:34:22,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:34:22,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:34:22,612 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:34:22,613 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:34:22,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:34:22,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:34:22,613 INFO L87 Difference]: Start difference. First operand 713 states and 1207 transitions. Second operand 3 states. [2018-11-10 12:34:22,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:34:22,647 INFO L93 Difference]: Finished difference Result 2077 states and 3513 transitions. [2018-11-10 12:34:22,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:34:22,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-10 12:34:22,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:34:22,650 INFO L225 Difference]: With dead ends: 2077 [2018-11-10 12:34:22,651 INFO L226 Difference]: Without dead ends: 1387 [2018-11-10 12:34:22,652 INFO L605 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-10 12:34:22,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2018-11-10 12:34:22,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 1385. [2018-11-10 12:34:22,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1385 states. [2018-11-10 12:34:22,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 2311 transitions. [2018-11-10 12:34:22,675 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 2311 transitions. Word has length 29 [2018-11-10 12:34:22,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:34:22,675 INFO L481 AbstractCegarLoop]: Abstraction has 1385 states and 2311 transitions. [2018-11-10 12:34:22,675 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:34:22,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 2311 transitions. [2018-11-10 12:34:22,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 12:34:22,676 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:34:22,677 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-10 12:34:22,677 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:34:22,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:34:22,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1809115843, now seen corresponding path program 1 times [2018-11-10 12:34:22,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:34:22,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:22,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:34:22,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:22,678 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:34:22,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:34:22,696 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-10 12:34:22,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:34:22,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:34:22,696 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:34:22,697 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:34:22,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:34:22,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:34:22,697 INFO L87 Difference]: Start difference. First operand 1385 states and 2311 transitions. Second operand 3 states. [2018-11-10 12:34:22,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:34:22,721 INFO L93 Difference]: Finished difference Result 1725 states and 2937 transitions. [2018-11-10 12:34:22,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:34:22,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-10 12:34:22,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:34:22,725 INFO L225 Difference]: With dead ends: 1725 [2018-11-10 12:34:22,725 INFO L226 Difference]: Without dead ends: 1723 [2018-11-10 12:34:22,726 INFO L605 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-10 12:34:22,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1723 states. [2018-11-10 12:34:22,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1723 to 1385. [2018-11-10 12:34:22,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1385 states. [2018-11-10 12:34:22,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 2295 transitions. [2018-11-10 12:34:22,750 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 2295 transitions. Word has length 29 [2018-11-10 12:34:22,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:34:22,750 INFO L481 AbstractCegarLoop]: Abstraction has 1385 states and 2295 transitions. [2018-11-10 12:34:22,750 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:34:22,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 2295 transitions. [2018-11-10 12:34:22,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 12:34:22,752 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:34:22,752 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-10 12:34:22,752 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:34:22,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:34:22,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1745914972, now seen corresponding path program 1 times [2018-11-10 12:34:22,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:34:22,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:22,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:34:22,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:22,754 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:34:22,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:34:22,768 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-10 12:34:22,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:34:22,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:34:22,768 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:34:22,769 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:34:22,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:34:22,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:34:22,769 INFO L87 Difference]: Start difference. First operand 1385 states and 2295 transitions. Second operand 3 states. [2018-11-10 12:34:22,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:34:22,802 INFO L93 Difference]: Finished difference Result 2557 states and 4313 transitions. [2018-11-10 12:34:22,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:34:22,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-10 12:34:22,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:34:22,808 INFO L225 Difference]: With dead ends: 2557 [2018-11-10 12:34:22,808 INFO L226 Difference]: Without dead ends: 2555 [2018-11-10 12:34:22,809 INFO L605 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-10 12:34:22,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2555 states. [2018-11-10 12:34:22,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2555 to 1945. [2018-11-10 12:34:22,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1945 states. [2018-11-10 12:34:22,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1945 states to 1945 states and 3159 transitions. [2018-11-10 12:34:22,843 INFO L78 Accepts]: Start accepts. Automaton has 1945 states and 3159 transitions. Word has length 30 [2018-11-10 12:34:22,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:34:22,843 INFO L481 AbstractCegarLoop]: Abstraction has 1945 states and 3159 transitions. [2018-11-10 12:34:22,843 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:34:22,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1945 states and 3159 transitions. [2018-11-10 12:34:22,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 12:34:22,845 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:34:22,845 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-10 12:34:22,845 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:34:22,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:34:22,845 INFO L82 PathProgramCache]: Analyzing trace with hash 960704422, now seen corresponding path program 1 times [2018-11-10 12:34:22,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:34:22,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:22,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:34:22,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:22,847 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:34:22,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:34:22,869 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-10 12:34:22,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:34:22,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:34:22,869 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:34:22,869 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:34:22,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:34:22,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:34:22,870 INFO L87 Difference]: Start difference. First operand 1945 states and 3159 transitions. Second operand 3 states. [2018-11-10 12:34:22,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:34:22,916 INFO L93 Difference]: Finished difference Result 4637 states and 7577 transitions. [2018-11-10 12:34:22,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:34:22,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-10 12:34:22,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:34:22,922 INFO L225 Difference]: With dead ends: 4637 [2018-11-10 12:34:22,922 INFO L226 Difference]: Without dead ends: 2715 [2018-11-10 12:34:22,925 INFO L605 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-10 12:34:22,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2715 states. [2018-11-10 12:34:22,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2715 to 2713. [2018-11-10 12:34:22,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2713 states. [2018-11-10 12:34:22,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2713 states to 2713 states and 4391 transitions. [2018-11-10 12:34:22,977 INFO L78 Accepts]: Start accepts. Automaton has 2713 states and 4391 transitions. Word has length 30 [2018-11-10 12:34:22,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:34:22,977 INFO L481 AbstractCegarLoop]: Abstraction has 2713 states and 4391 transitions. [2018-11-10 12:34:22,977 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:34:22,977 INFO L276 IsEmpty]: Start isEmpty. Operand 2713 states and 4391 transitions. [2018-11-10 12:34:22,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-10 12:34:22,979 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:34:22,979 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-10 12:34:22,980 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:34:22,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:34:22,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1711424506, now seen corresponding path program 1 times [2018-11-10 12:34:22,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:34:22,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:22,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:34:22,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:22,981 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:34:22,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:34:23,016 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-10 12:34:23,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:34:23,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:34:23,017 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:34:23,017 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:34:23,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:34:23,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:34:23,017 INFO L87 Difference]: Start difference. First operand 2713 states and 4391 transitions. Second operand 3 states. [2018-11-10 12:34:23,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:34:23,053 INFO L93 Difference]: Finished difference Result 4093 states and 6617 transitions. [2018-11-10 12:34:23,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:34:23,053 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-10 12:34:23,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:34:23,058 INFO L225 Difference]: With dead ends: 4093 [2018-11-10 12:34:23,059 INFO L226 Difference]: Without dead ends: 2763 [2018-11-10 12:34:23,061 INFO L605 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-10 12:34:23,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2763 states. [2018-11-10 12:34:23,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2763 to 2761. [2018-11-10 12:34:23,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2761 states. [2018-11-10 12:34:23,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2761 states to 2761 states and 4423 transitions. [2018-11-10 12:34:23,126 INFO L78 Accepts]: Start accepts. Automaton has 2761 states and 4423 transitions. Word has length 31 [2018-11-10 12:34:23,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:34:23,127 INFO L481 AbstractCegarLoop]: Abstraction has 2761 states and 4423 transitions. [2018-11-10 12:34:23,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:34:23,127 INFO L276 IsEmpty]: Start isEmpty. Operand 2761 states and 4423 transitions. [2018-11-10 12:34:23,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-10 12:34:23,129 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:34:23,129 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-10 12:34:23,129 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:34:23,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:34:23,129 INFO L82 PathProgramCache]: Analyzing trace with hash -282720200, now seen corresponding path program 1 times [2018-11-10 12:34:23,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:34:23,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:23,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:34:23,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:23,130 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:34:23,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:34:23,160 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-10 12:34:23,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:34:23,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:34:23,160 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:34:23,160 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:34:23,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:34:23,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:34:23,161 INFO L87 Difference]: Start difference. First operand 2761 states and 4423 transitions. Second operand 3 states. [2018-11-10 12:34:23,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:34:23,206 INFO L93 Difference]: Finished difference Result 5005 states and 8169 transitions. [2018-11-10 12:34:23,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:34:23,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-10 12:34:23,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:34:23,217 INFO L225 Difference]: With dead ends: 5005 [2018-11-10 12:34:23,217 INFO L226 Difference]: Without dead ends: 5003 [2018-11-10 12:34:23,219 INFO L605 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-10 12:34:23,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5003 states. [2018-11-10 12:34:23,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5003 to 3913. [2018-11-10 12:34:23,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3913 states. [2018-11-10 12:34:23,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3913 states to 3913 states and 6119 transitions. [2018-11-10 12:34:23,289 INFO L78 Accepts]: Start accepts. Automaton has 3913 states and 6119 transitions. Word has length 31 [2018-11-10 12:34:23,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:34:23,289 INFO L481 AbstractCegarLoop]: Abstraction has 3913 states and 6119 transitions. [2018-11-10 12:34:23,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:34:23,290 INFO L276 IsEmpty]: Start isEmpty. Operand 3913 states and 6119 transitions. [2018-11-10 12:34:23,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-10 12:34:23,293 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:34:23,293 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-10 12:34:23,293 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:34:23,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:34:23,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1871068102, now seen corresponding path program 1 times [2018-11-10 12:34:23,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:34:23,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:23,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:34:23,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:23,295 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:34:23,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:34:23,316 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-10 12:34:23,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:34:23,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:34:23,316 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:34:23,316 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:34:23,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:34:23,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:34:23,317 INFO L87 Difference]: Start difference. First operand 3913 states and 6119 transitions. Second operand 3 states. [2018-11-10 12:34:23,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:34:23,386 INFO L93 Difference]: Finished difference Result 9229 states and 14505 transitions. [2018-11-10 12:34:23,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:34:23,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-10 12:34:23,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:34:23,401 INFO L225 Difference]: With dead ends: 9229 [2018-11-10 12:34:23,401 INFO L226 Difference]: Without dead ends: 5387 [2018-11-10 12:34:23,407 INFO L605 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-10 12:34:23,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5387 states. [2018-11-10 12:34:23,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5387 to 5385. [2018-11-10 12:34:23,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5385 states. [2018-11-10 12:34:23,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5385 states to 5385 states and 8391 transitions. [2018-11-10 12:34:23,505 INFO L78 Accepts]: Start accepts. Automaton has 5385 states and 8391 transitions. Word has length 31 [2018-11-10 12:34:23,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:34:23,505 INFO L481 AbstractCegarLoop]: Abstraction has 5385 states and 8391 transitions. [2018-11-10 12:34:23,505 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:34:23,505 INFO L276 IsEmpty]: Start isEmpty. Operand 5385 states and 8391 transitions. [2018-11-10 12:34:23,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-10 12:34:23,509 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:34:23,509 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-10 12:34:23,509 INFO L424 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:34:23,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:34:23,509 INFO L82 PathProgramCache]: Analyzing trace with hash -174177477, now seen corresponding path program 1 times [2018-11-10 12:34:23,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:34:23,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:23,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:34:23,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:23,510 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:34:23,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:34:23,536 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-10 12:34:23,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:34:23,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:34:23,536 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:34:23,536 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:34:23,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:34:23,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:34:23,537 INFO L87 Difference]: Start difference. First operand 5385 states and 8391 transitions. Second operand 3 states. [2018-11-10 12:34:23,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:34:23,598 INFO L93 Difference]: Finished difference Result 8077 states and 12553 transitions. [2018-11-10 12:34:23,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:34:23,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-10 12:34:23,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:34:23,608 INFO L225 Difference]: With dead ends: 8077 [2018-11-10 12:34:23,608 INFO L226 Difference]: Without dead ends: 5451 [2018-11-10 12:34:23,611 INFO L605 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-10 12:34:23,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5451 states. [2018-11-10 12:34:23,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5451 to 5449. [2018-11-10 12:34:23,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5449 states. [2018-11-10 12:34:23,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5449 states to 5449 states and 8391 transitions. [2018-11-10 12:34:23,691 INFO L78 Accepts]: Start accepts. Automaton has 5449 states and 8391 transitions. Word has length 32 [2018-11-10 12:34:23,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:34:23,691 INFO L481 AbstractCegarLoop]: Abstraction has 5449 states and 8391 transitions. [2018-11-10 12:34:23,691 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:34:23,691 INFO L276 IsEmpty]: Start isEmpty. Operand 5449 states and 8391 transitions. [2018-11-10 12:34:23,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-10 12:34:23,694 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:34:23,694 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-10 12:34:23,695 INFO L424 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:34:23,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:34:23,695 INFO L82 PathProgramCache]: Analyzing trace with hash 2126645113, now seen corresponding path program 1 times [2018-11-10 12:34:23,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:34:23,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:23,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:34:23,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:23,696 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:34:23,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:34:23,712 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-10 12:34:23,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:34:23,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:34:23,712 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:34:23,712 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:34:23,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:34:23,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:34:23,713 INFO L87 Difference]: Start difference. First operand 5449 states and 8391 transitions. Second operand 3 states. [2018-11-10 12:34:23,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:34:23,789 INFO L93 Difference]: Finished difference Result 9741 states and 15305 transitions. [2018-11-10 12:34:23,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:34:23,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-10 12:34:23,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:34:23,801 INFO L225 Difference]: With dead ends: 9741 [2018-11-10 12:34:23,801 INFO L226 Difference]: Without dead ends: 9739 [2018-11-10 12:34:23,804 INFO L605 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-10 12:34:23,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9739 states. [2018-11-10 12:34:23,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9739 to 7817. [2018-11-10 12:34:23,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7817 states. [2018-11-10 12:34:23,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7817 states to 7817 states and 11719 transitions. [2018-11-10 12:34:23,947 INFO L78 Accepts]: Start accepts. Automaton has 7817 states and 11719 transitions. Word has length 32 [2018-11-10 12:34:23,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:34:23,947 INFO L481 AbstractCegarLoop]: Abstraction has 7817 states and 11719 transitions. [2018-11-10 12:34:23,947 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:34:23,948 INFO L276 IsEmpty]: Start isEmpty. Operand 7817 states and 11719 transitions. [2018-11-10 12:34:23,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-10 12:34:23,954 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:34:23,954 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-10 12:34:23,954 INFO L424 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:34:23,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:34:23,955 INFO L82 PathProgramCache]: Analyzing trace with hash 538297211, now seen corresponding path program 1 times [2018-11-10 12:34:23,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:34:23,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:23,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:34:23,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:23,956 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:34:23,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:34:23,976 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-10 12:34:23,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:34:23,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:34:23,976 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:34:23,977 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:34:23,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:34:23,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:34:23,977 INFO L87 Difference]: Start difference. First operand 7817 states and 11719 transitions. Second operand 3 states. [2018-11-10 12:34:24,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:34:24,124 INFO L93 Difference]: Finished difference Result 18317 states and 27593 transitions. [2018-11-10 12:34:24,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:34:24,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-10 12:34:24,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:34:24,144 INFO L225 Difference]: With dead ends: 18317 [2018-11-10 12:34:24,144 INFO L226 Difference]: Without dead ends: 10635 [2018-11-10 12:34:24,154 INFO L605 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-10 12:34:24,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10635 states. [2018-11-10 12:34:24,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10635 to 10633. [2018-11-10 12:34:24,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10633 states. [2018-11-10 12:34:24,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10633 states to 10633 states and 15879 transitions. [2018-11-10 12:34:24,370 INFO L78 Accepts]: Start accepts. Automaton has 10633 states and 15879 transitions. Word has length 32 [2018-11-10 12:34:24,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:34:24,370 INFO L481 AbstractCegarLoop]: Abstraction has 10633 states and 15879 transitions. [2018-11-10 12:34:24,370 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:34:24,370 INFO L276 IsEmpty]: Start isEmpty. Operand 10633 states and 15879 transitions. [2018-11-10 12:34:24,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-10 12:34:24,378 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:34:24,378 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:34:24,378 INFO L424 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:34:24,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:34:24,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1501703535, now seen corresponding path program 1 times [2018-11-10 12:34:24,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:34:24,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:24,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:34:24,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:24,379 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:34:24,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:34:24,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:34:24,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:34:24,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:34:24,392 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:34:24,393 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:34:24,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:34:24,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:34:24,393 INFO L87 Difference]: Start difference. First operand 10633 states and 15879 transitions. Second operand 3 states. [2018-11-10 12:34:24,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:34:24,521 INFO L93 Difference]: Finished difference Result 15949 states and 23753 transitions. [2018-11-10 12:34:24,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:34:24,521 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-10 12:34:24,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:34:24,537 INFO L225 Difference]: With dead ends: 15949 [2018-11-10 12:34:24,537 INFO L226 Difference]: Without dead ends: 10763 [2018-11-10 12:34:24,546 INFO L605 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-10 12:34:24,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10763 states. [2018-11-10 12:34:24,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10763 to 10761. [2018-11-10 12:34:24,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10761 states. [2018-11-10 12:34:24,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10761 states to 10761 states and 15879 transitions. [2018-11-10 12:34:24,749 INFO L78 Accepts]: Start accepts. Automaton has 10761 states and 15879 transitions. Word has length 33 [2018-11-10 12:34:24,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:34:24,749 INFO L481 AbstractCegarLoop]: Abstraction has 10761 states and 15879 transitions. [2018-11-10 12:34:24,749 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:34:24,749 INFO L276 IsEmpty]: Start isEmpty. Operand 10761 states and 15879 transitions. [2018-11-10 12:34:24,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-10 12:34:24,757 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:34:24,757 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:34:24,758 INFO L424 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:34:24,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:34:24,758 INFO L82 PathProgramCache]: Analyzing trace with hash -492441171, now seen corresponding path program 1 times [2018-11-10 12:34:24,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:34:24,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:24,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:34:24,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:24,759 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:34:24,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:34:24,772 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-10 12:34:24,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:34:24,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:34:24,772 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:34:24,773 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:34:24,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:34:24,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:34:24,773 INFO L87 Difference]: Start difference. First operand 10761 states and 15879 transitions. Second operand 3 states. [2018-11-10 12:34:24,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:34:24,984 INFO L93 Difference]: Finished difference Result 18957 states and 28553 transitions. [2018-11-10 12:34:24,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:34:24,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-10 12:34:24,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:34:25,015 INFO L225 Difference]: With dead ends: 18957 [2018-11-10 12:34:25,015 INFO L226 Difference]: Without dead ends: 18955 [2018-11-10 12:34:25,021 INFO L605 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-10 12:34:25,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18955 states. [2018-11-10 12:34:25,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18955 to 15625. [2018-11-10 12:34:25,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15625 states. [2018-11-10 12:34:25,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15625 states to 15625 states and 22407 transitions. [2018-11-10 12:34:25,294 INFO L78 Accepts]: Start accepts. Automaton has 15625 states and 22407 transitions. Word has length 33 [2018-11-10 12:34:25,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:34:25,294 INFO L481 AbstractCegarLoop]: Abstraction has 15625 states and 22407 transitions. [2018-11-10 12:34:25,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:34:25,294 INFO L276 IsEmpty]: Start isEmpty. Operand 15625 states and 22407 transitions. [2018-11-10 12:34:25,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-10 12:34:25,304 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:34:25,304 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:34:25,304 INFO L424 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:34:25,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:34:25,304 INFO L82 PathProgramCache]: Analyzing trace with hash -2080789073, now seen corresponding path program 1 times [2018-11-10 12:34:25,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:34:25,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:25,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:34:25,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:25,305 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:34:25,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:34:25,324 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-10 12:34:25,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:34:25,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:34:25,324 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:34:25,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:34:25,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:34:25,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:34:25,325 INFO L87 Difference]: Start difference. First operand 15625 states and 22407 transitions. Second operand 3 states. [2018-11-10 12:34:25,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:34:25,489 INFO L93 Difference]: Finished difference Result 36365 states and 52361 transitions. [2018-11-10 12:34:25,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:34:25,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-10 12:34:25,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:34:25,509 INFO L225 Difference]: With dead ends: 36365 [2018-11-10 12:34:25,509 INFO L226 Difference]: Without dead ends: 21003 [2018-11-10 12:34:25,525 INFO L605 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-10 12:34:25,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21003 states. [2018-11-10 12:34:25,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21003 to 21001. [2018-11-10 12:34:25,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21001 states. [2018-11-10 12:34:25,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21001 states to 21001 states and 29959 transitions. [2018-11-10 12:34:25,764 INFO L78 Accepts]: Start accepts. Automaton has 21001 states and 29959 transitions. Word has length 33 [2018-11-10 12:34:25,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:34:25,764 INFO L481 AbstractCegarLoop]: Abstraction has 21001 states and 29959 transitions. [2018-11-10 12:34:25,764 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:34:25,765 INFO L276 IsEmpty]: Start isEmpty. Operand 21001 states and 29959 transitions. [2018-11-10 12:34:25,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-10 12:34:25,775 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:34:25,775 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:34:25,775 INFO L424 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:34:25,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:34:25,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1914407696, now seen corresponding path program 1 times [2018-11-10 12:34:25,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:34:25,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:25,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:34:25,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:25,776 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:34:25,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:34:25,792 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-10 12:34:25,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:34:25,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:34:25,792 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:34:25,793 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:34:25,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:34:25,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:34:25,793 INFO L87 Difference]: Start difference. First operand 21001 states and 29959 transitions. Second operand 3 states. [2018-11-10 12:34:26,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:34:26,027 INFO L93 Difference]: Finished difference Result 31501 states and 44809 transitions. [2018-11-10 12:34:26,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:34:26,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-10 12:34:26,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:34:26,058 INFO L225 Difference]: With dead ends: 31501 [2018-11-10 12:34:26,058 INFO L226 Difference]: Without dead ends: 21259 [2018-11-10 12:34:26,073 INFO L605 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-10 12:34:26,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21259 states. [2018-11-10 12:34:26,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21259 to 21257. [2018-11-10 12:34:26,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21257 states. [2018-11-10 12:34:26,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21257 states to 21257 states and 29959 transitions. [2018-11-10 12:34:26,446 INFO L78 Accepts]: Start accepts. Automaton has 21257 states and 29959 transitions. Word has length 34 [2018-11-10 12:34:26,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:34:26,446 INFO L481 AbstractCegarLoop]: Abstraction has 21257 states and 29959 transitions. [2018-11-10 12:34:26,446 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:34:26,446 INFO L276 IsEmpty]: Start isEmpty. Operand 21257 states and 29959 transitions. [2018-11-10 12:34:26,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-10 12:34:26,459 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:34:26,459 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:34:26,459 INFO L424 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:34:26,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:34:26,459 INFO L82 PathProgramCache]: Analyzing trace with hash -79737010, now seen corresponding path program 1 times [2018-11-10 12:34:26,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:34:26,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:26,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:34:26,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:26,460 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:34:26,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:34:26,476 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-10 12:34:26,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:34:26,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:34:26,476 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:34:26,477 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:34:26,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:34:26,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:34:26,477 INFO L87 Difference]: Start difference. First operand 21257 states and 29959 transitions. Second operand 3 states. [2018-11-10 12:34:26,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:34:26,854 INFO L93 Difference]: Finished difference Result 36877 states and 53001 transitions. [2018-11-10 12:34:26,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:34:26,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-10 12:34:26,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:34:26,899 INFO L225 Difference]: With dead ends: 36877 [2018-11-10 12:34:26,899 INFO L226 Difference]: Without dead ends: 36875 [2018-11-10 12:34:26,911 INFO L605 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-10 12:34:26,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36875 states. [2018-11-10 12:34:27,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36875 to 31241. [2018-11-10 12:34:27,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31241 states. [2018-11-10 12:34:27,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31241 states to 31241 states and 42759 transitions. [2018-11-10 12:34:27,603 INFO L78 Accepts]: Start accepts. Automaton has 31241 states and 42759 transitions. Word has length 34 [2018-11-10 12:34:27,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:34:27,603 INFO L481 AbstractCegarLoop]: Abstraction has 31241 states and 42759 transitions. [2018-11-10 12:34:27,603 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:34:27,603 INFO L276 IsEmpty]: Start isEmpty. Operand 31241 states and 42759 transitions. [2018-11-10 12:34:27,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-10 12:34:27,615 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:34:27,616 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:34:27,616 INFO L424 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:34:27,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:34:27,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1668084912, now seen corresponding path program 1 times [2018-11-10 12:34:27,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:34:27,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:27,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:34:27,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:27,617 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:34:27,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:34:27,645 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-10 12:34:27,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:34:27,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:34:27,646 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:34:27,646 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:34:27,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:34:27,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:34:27,647 INFO L87 Difference]: Start difference. First operand 31241 states and 42759 transitions. Second operand 3 states. [2018-11-10 12:34:27,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:34:27,991 INFO L93 Difference]: Finished difference Result 72205 states and 99081 transitions. [2018-11-10 12:34:27,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:34:27,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-10 12:34:27,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:34:28,024 INFO L225 Difference]: With dead ends: 72205 [2018-11-10 12:34:28,024 INFO L226 Difference]: Without dead ends: 41483 [2018-11-10 12:34:28,047 INFO L605 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-10 12:34:28,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41483 states. [2018-11-10 12:34:28,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41483 to 41481. [2018-11-10 12:34:28,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41481 states. [2018-11-10 12:34:28,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41481 states to 41481 states and 56327 transitions. [2018-11-10 12:34:28,680 INFO L78 Accepts]: Start accepts. Automaton has 41481 states and 56327 transitions. Word has length 34 [2018-11-10 12:34:28,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:34:28,680 INFO L481 AbstractCegarLoop]: Abstraction has 41481 states and 56327 transitions. [2018-11-10 12:34:28,680 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:34:28,680 INFO L276 IsEmpty]: Start isEmpty. Operand 41481 states and 56327 transitions. [2018-11-10 12:34:28,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-10 12:34:28,694 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:34:28,694 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:34:28,694 INFO L424 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:34:28,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:34:28,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1823335140, now seen corresponding path program 1 times [2018-11-10 12:34:28,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:34:28,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:28,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:34:28,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:28,696 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:34:28,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:34:28,724 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-10 12:34:28,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:34:28,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:34:28,724 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:34:28,724 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:34:28,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:34:28,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:34:28,725 INFO L87 Difference]: Start difference. First operand 41481 states and 56327 transitions. Second operand 3 states. [2018-11-10 12:34:29,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:34:29,040 INFO L93 Difference]: Finished difference Result 62221 states and 84233 transitions. [2018-11-10 12:34:29,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:34:29,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-10 12:34:29,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:34:29,070 INFO L225 Difference]: With dead ends: 62221 [2018-11-10 12:34:29,071 INFO L226 Difference]: Without dead ends: 41995 [2018-11-10 12:34:29,087 INFO L605 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-10 12:34:29,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41995 states. [2018-11-10 12:34:29,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41995 to 41993. [2018-11-10 12:34:29,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41993 states. [2018-11-10 12:34:29,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41993 states to 41993 states and 56327 transitions. [2018-11-10 12:34:29,671 INFO L78 Accepts]: Start accepts. Automaton has 41993 states and 56327 transitions. Word has length 35 [2018-11-10 12:34:29,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:34:29,672 INFO L481 AbstractCegarLoop]: Abstraction has 41993 states and 56327 transitions. [2018-11-10 12:34:29,672 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:34:29,672 INFO L276 IsEmpty]: Start isEmpty. Operand 41993 states and 56327 transitions. [2018-11-10 12:34:29,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-10 12:34:29,695 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:34:29,695 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:34:29,695 INFO L424 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:34:29,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:34:29,696 INFO L82 PathProgramCache]: Analyzing trace with hash -170809566, now seen corresponding path program 1 times [2018-11-10 12:34:29,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:34:29,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:29,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:34:29,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:29,697 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:34:29,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:34:29,737 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-10 12:34:29,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:34:29,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:34:29,738 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:34:29,738 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:34:29,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:34:29,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:34:29,738 INFO L87 Difference]: Start difference. First operand 41993 states and 56327 transitions. Second operand 3 states. [2018-11-10 12:34:30,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:34:30,471 INFO L93 Difference]: Finished difference Result 71693 states and 97801 transitions. [2018-11-10 12:34:30,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:34:30,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-10 12:34:30,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:34:30,519 INFO L225 Difference]: With dead ends: 71693 [2018-11-10 12:34:30,519 INFO L226 Difference]: Without dead ends: 71691 [2018-11-10 12:34:30,527 INFO L605 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-10 12:34:30,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71691 states. [2018-11-10 12:34:31,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71691 to 62473. [2018-11-10 12:34:31,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62473 states. [2018-11-10 12:34:31,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62473 states to 62473 states and 81415 transitions. [2018-11-10 12:34:31,307 INFO L78 Accepts]: Start accepts. Automaton has 62473 states and 81415 transitions. Word has length 35 [2018-11-10 12:34:31,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:34:31,307 INFO L481 AbstractCegarLoop]: Abstraction has 62473 states and 81415 transitions. [2018-11-10 12:34:31,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:34:31,307 INFO L276 IsEmpty]: Start isEmpty. Operand 62473 states and 81415 transitions. [2018-11-10 12:34:31,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-10 12:34:31,342 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:34:31,342 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:34:31,342 INFO L424 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:34:31,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:34:31,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1759157468, now seen corresponding path program 1 times [2018-11-10 12:34:31,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:34:31,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:31,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:34:31,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:31,343 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:34:31,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:34:31,376 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-10 12:34:31,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:34:31,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:34:31,376 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:34:31,377 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:34:31,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:34:31,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:34:31,377 INFO L87 Difference]: Start difference. First operand 62473 states and 81415 transitions. Second operand 3 states. [2018-11-10 12:34:32,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:34:32,275 INFO L93 Difference]: Finished difference Result 143373 states and 186889 transitions. [2018-11-10 12:34:32,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:34:32,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-10 12:34:32,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:34:32,337 INFO L225 Difference]: With dead ends: 143373 [2018-11-10 12:34:32,337 INFO L226 Difference]: Without dead ends: 81931 [2018-11-10 12:34:32,374 INFO L605 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-10 12:34:32,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81931 states. [2018-11-10 12:34:33,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81931 to 81929. [2018-11-10 12:34:33,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81929 states. [2018-11-10 12:34:33,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81929 states to 81929 states and 105479 transitions. [2018-11-10 12:34:33,796 INFO L78 Accepts]: Start accepts. Automaton has 81929 states and 105479 transitions. Word has length 35 [2018-11-10 12:34:33,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:34:33,796 INFO L481 AbstractCegarLoop]: Abstraction has 81929 states and 105479 transitions. [2018-11-10 12:34:33,796 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:34:33,796 INFO L276 IsEmpty]: Start isEmpty. Operand 81929 states and 105479 transitions. [2018-11-10 12:34:33,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-10 12:34:33,824 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:34:33,824 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:34:33,824 INFO L424 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:34:33,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:34:33,825 INFO L82 PathProgramCache]: Analyzing trace with hash -999913755, now seen corresponding path program 1 times [2018-11-10 12:34:33,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:34:33,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:33,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:34:33,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:33,826 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:34:33,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:34:33,860 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-10 12:34:33,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:34:33,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:34:33,860 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:34:33,860 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:34:33,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:34:33,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:34:33,861 INFO L87 Difference]: Start difference. First operand 81929 states and 105479 transitions. Second operand 3 states. [2018-11-10 12:34:34,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:34:34,541 INFO L93 Difference]: Finished difference Result 122893 states and 157705 transitions. [2018-11-10 12:34:34,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:34:34,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-10 12:34:34,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:34:34,605 INFO L225 Difference]: With dead ends: 122893 [2018-11-10 12:34:34,606 INFO L226 Difference]: Without dead ends: 82955 [2018-11-10 12:34:34,635 INFO L605 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-10 12:34:34,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82955 states. [2018-11-10 12:34:35,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82955 to 82953. [2018-11-10 12:34:35,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82953 states. [2018-11-10 12:34:36,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82953 states to 82953 states and 105479 transitions. [2018-11-10 12:34:36,065 INFO L78 Accepts]: Start accepts. Automaton has 82953 states and 105479 transitions. Word has length 36 [2018-11-10 12:34:36,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:34:36,066 INFO L481 AbstractCegarLoop]: Abstraction has 82953 states and 105479 transitions. [2018-11-10 12:34:36,066 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:34:36,066 INFO L276 IsEmpty]: Start isEmpty. Operand 82953 states and 105479 transitions. [2018-11-10 12:34:36,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-10 12:34:36,094 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:34:36,094 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:34:36,094 INFO L424 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:34:36,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:34:36,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1300908835, now seen corresponding path program 1 times [2018-11-10 12:34:36,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:34:36,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:36,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:34:36,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:36,095 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:34:36,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:34:36,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:34:36,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:34:36,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:34:36,116 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:34:36,116 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:34:36,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:34:36,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:34:36,117 INFO L87 Difference]: Start difference. First operand 82953 states and 105479 transitions. Second operand 3 states. [2018-11-10 12:34:37,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:34:37,189 INFO L93 Difference]: Finished difference Result 139277 states and 179209 transitions. [2018-11-10 12:34:37,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:34:37,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-10 12:34:37,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:34:37,304 INFO L225 Difference]: With dead ends: 139277 [2018-11-10 12:34:37,304 INFO L226 Difference]: Without dead ends: 139275 [2018-11-10 12:34:37,331 INFO L605 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-10 12:34:37,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139275 states. [2018-11-10 12:34:39,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139275 to 124937. [2018-11-10 12:34:39,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124937 states. [2018-11-10 12:34:39,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124937 states to 124937 states and 154631 transitions. [2018-11-10 12:34:39,181 INFO L78 Accepts]: Start accepts. Automaton has 124937 states and 154631 transitions. Word has length 36 [2018-11-10 12:34:39,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:34:39,182 INFO L481 AbstractCegarLoop]: Abstraction has 124937 states and 154631 transitions. [2018-11-10 12:34:39,182 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:34:39,182 INFO L276 IsEmpty]: Start isEmpty. Operand 124937 states and 154631 transitions. [2018-11-10 12:34:39,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-10 12:34:39,241 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:34:39,241 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:34:39,242 INFO L424 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:34:39,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:34:39,242 INFO L82 PathProgramCache]: Analyzing trace with hash -287439067, now seen corresponding path program 1 times [2018-11-10 12:34:39,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:34:39,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:39,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:34:39,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:39,243 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:34:39,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:34:39,269 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-10 12:34:39,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:34:39,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:34:39,270 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:34:39,270 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:34:39,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:34:39,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:34:39,270 INFO L87 Difference]: Start difference. First operand 124937 states and 154631 transitions. Second operand 3 states. [2018-11-10 12:34:40,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:34:40,786 INFO L93 Difference]: Finished difference Result 284685 states and 351241 transitions. [2018-11-10 12:34:40,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:34:40,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-10 12:34:40,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:34:40,925 INFO L225 Difference]: With dead ends: 284685 [2018-11-10 12:34:40,925 INFO L226 Difference]: Without dead ends: 161803 [2018-11-10 12:34:41,004 INFO L605 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-10 12:34:41,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161803 states. [2018-11-10 12:34:44,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161803 to 161801. [2018-11-10 12:34:44,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161801 states. [2018-11-10 12:34:44,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161801 states to 161801 states and 196615 transitions. [2018-11-10 12:34:44,878 INFO L78 Accepts]: Start accepts. Automaton has 161801 states and 196615 transitions. Word has length 36 [2018-11-10 12:34:44,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:34:44,878 INFO L481 AbstractCegarLoop]: Abstraction has 161801 states and 196615 transitions. [2018-11-10 12:34:44,878 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:34:44,878 INFO L276 IsEmpty]: Start isEmpty. Operand 161801 states and 196615 transitions. [2018-11-10 12:34:44,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-10 12:34:44,940 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:34:44,940 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:34:44,940 INFO L424 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:34:44,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:34:44,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1673684057, now seen corresponding path program 1 times [2018-11-10 12:34:44,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:34:44,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:44,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:34:44,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:44,942 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:34:44,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:34:44,976 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-10 12:34:44,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:34:44,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:34:44,977 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:34:44,977 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:34:44,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:34:44,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:34:44,978 INFO L87 Difference]: Start difference. First operand 161801 states and 196615 transitions. Second operand 3 states. [2018-11-10 12:34:46,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:34:46,463 INFO L93 Difference]: Finished difference Result 242701 states and 293897 transitions. [2018-11-10 12:34:46,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:34:46,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-10 12:34:46,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:34:46,624 INFO L225 Difference]: With dead ends: 242701 [2018-11-10 12:34:46,624 INFO L226 Difference]: Without dead ends: 163851 [2018-11-10 12:34:46,691 INFO L605 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-10 12:34:46,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163851 states. [2018-11-10 12:34:49,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163851 to 163849. [2018-11-10 12:34:49,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163849 states. [2018-11-10 12:34:49,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163849 states to 163849 states and 196615 transitions. [2018-11-10 12:34:49,315 INFO L78 Accepts]: Start accepts. Automaton has 163849 states and 196615 transitions. Word has length 37 [2018-11-10 12:34:49,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:34:49,315 INFO L481 AbstractCegarLoop]: Abstraction has 163849 states and 196615 transitions. [2018-11-10 12:34:49,315 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:34:49,315 INFO L276 IsEmpty]: Start isEmpty. Operand 163849 states and 196615 transitions. [2018-11-10 12:34:49,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-10 12:34:49,385 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:34:49,385 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:34:49,385 INFO L424 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:34:49,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:34:49,386 INFO L82 PathProgramCache]: Analyzing trace with hash -320460649, now seen corresponding path program 1 times [2018-11-10 12:34:49,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:34:49,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:49,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:34:49,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:49,387 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:34:49,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:34:49,412 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-10 12:34:49,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:34:49,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:34:49,413 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:34:49,413 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:34:49,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:34:49,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:34:49,413 INFO L87 Difference]: Start difference. First operand 163849 states and 196615 transitions. Second operand 3 states. [2018-11-10 12:34:52,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:34:52,486 INFO L93 Difference]: Finished difference Result 479245 states and 565257 transitions. [2018-11-10 12:34:52,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:34:52,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-10 12:34:52,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:34:52,775 INFO L225 Difference]: With dead ends: 479245 [2018-11-10 12:34:52,775 INFO L226 Difference]: Without dead ends: 319499 [2018-11-10 12:34:52,874 INFO L605 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-10 12:34:52,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319499 states. [2018-11-10 12:34:57,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319499 to 319497. [2018-11-10 12:34:57,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319497 states. [2018-11-10 12:34:57,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319497 states to 319497 states and 368647 transitions. [2018-11-10 12:34:57,657 INFO L78 Accepts]: Start accepts. Automaton has 319497 states and 368647 transitions. Word has length 37 [2018-11-10 12:34:57,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:34:57,658 INFO L481 AbstractCegarLoop]: Abstraction has 319497 states and 368647 transitions. [2018-11-10 12:34:57,658 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:34:57,658 INFO L276 IsEmpty]: Start isEmpty. Operand 319497 states and 368647 transitions. [2018-11-10 12:34:57,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-10 12:34:57,783 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:34:57,783 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:34:57,783 INFO L424 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:34:57,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:34:57,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1267887253, now seen corresponding path program 1 times [2018-11-10 12:34:57,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:34:57,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:57,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:34:57,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:57,784 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:34:57,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:34:57,810 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-10 12:34:57,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:34:57,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:34:57,810 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:34:57,810 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:34:57,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:34:57,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:34:57,811 INFO L87 Difference]: Start difference. First operand 319497 states and 368647 transitions. Second operand 3 states. [2018-11-10 12:35:03,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:35:03,380 INFO L93 Difference]: Finished difference Result 339981 states and 397321 transitions. [2018-11-10 12:35:03,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:35:03,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-10 12:35:03,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:35:03,678 INFO L225 Difference]: With dead ends: 339981 [2018-11-10 12:35:03,679 INFO L226 Difference]: Without dead ends: 339979 [2018-11-10 12:35:03,725 INFO L605 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-10 12:35:03,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339979 states. [2018-11-10 12:35:07,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339979 to 319497. [2018-11-10 12:35:07,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319497 states. [2018-11-10 12:35:08,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319497 states to 319497 states and 364551 transitions. [2018-11-10 12:35:08,245 INFO L78 Accepts]: Start accepts. Automaton has 319497 states and 364551 transitions. Word has length 37 [2018-11-10 12:35:08,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:35:08,246 INFO L481 AbstractCegarLoop]: Abstraction has 319497 states and 364551 transitions. [2018-11-10 12:35:08,246 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:35:08,246 INFO L276 IsEmpty]: Start isEmpty. Operand 319497 states and 364551 transitions. [2018-11-10 12:35:08,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 12:35:08,371 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:35:08,371 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:35:08,371 INFO L424 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:35:08,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:35:08,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1344129350, now seen corresponding path program 1 times [2018-11-10 12:35:08,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:35:08,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:35:08,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:35:08,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:35:08,372 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:35:08,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:35:08,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:35:08,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:35:08,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:35:08,397 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:35:08,397 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:35:08,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:35:08,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:35:08,398 INFO L87 Difference]: Start difference. First operand 319497 states and 364551 transitions. Second operand 3 states. [2018-11-10 12:35:13,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:35:13,501 INFO L93 Difference]: Finished difference Result 520203 states and 589832 transitions. [2018-11-10 12:35:13,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:35:13,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-11-10 12:35:13,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:35:14,392 INFO L225 Difference]: With dead ends: 520203 [2018-11-10 12:35:14,392 INFO L226 Difference]: Without dead ends: 520201 [2018-11-10 12:35:14,438 INFO L605 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-10 12:35:14,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520201 states. [2018-11-10 12:35:19,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520201 to 495625. [2018-11-10 12:35:19,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495625 states. [2018-11-10 12:35:20,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495625 states to 495625 states and 557063 transitions. [2018-11-10 12:35:20,441 INFO L78 Accepts]: Start accepts. Automaton has 495625 states and 557063 transitions. Word has length 38 [2018-11-10 12:35:20,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:35:20,442 INFO L481 AbstractCegarLoop]: Abstraction has 495625 states and 557063 transitions. [2018-11-10 12:35:20,442 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:35:20,442 INFO L276 IsEmpty]: Start isEmpty. Operand 495625 states and 557063 transitions. [2018-11-10 12:35:20,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 12:35:20,708 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:35:20,709 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:35:20,709 INFO L424 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:35:20,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:35:20,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1362490044, now seen corresponding path program 1 times [2018-11-10 12:35:20,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:35:20,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:35:20,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:35:20,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:35:20,710 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:35:20,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:35:20,745 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-10 12:35:20,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:35:20,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:35:20,745 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:35:20,746 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:35:20,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:35:20,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:35:20,746 INFO L87 Difference]: Start difference. First operand 495625 states and 557063 transitions. Second operand 3 states. [2018-11-10 12:35:29,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:35:29,766 INFO L93 Difference]: Finished difference Result 1118217 states and 1245191 transitions. [2018-11-10 12:35:29,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:35:29,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-11-10 12:35:29,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:35:29,766 INFO L225 Difference]: With dead ends: 1118217 [2018-11-10 12:35:29,766 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 12:35:30,132 INFO L605 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-10 12:35:30,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 12:35:30,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 12:35:30,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 12:35:30,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 12:35:30,133 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2018-11-10 12:35:30,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:35:30,133 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:35:30,133 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:35:30,133 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 12:35:30,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 12:35:30,137 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 12:35:30,213 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 12:35:30,213 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 12:35:30,213 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 12:35:30,213 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 12:35:30,213 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 12:35:30,213 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 12:35:30,213 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 4 219) no Hoare annotation was computed. [2018-11-10 12:35:30,214 INFO L425 ceAbstractionStarter]: For program point L184-1(lines 51 214) no Hoare annotation was computed. [2018-11-10 12:35:30,214 INFO L425 ceAbstractionStarter]: For program point L118-1(lines 51 214) no Hoare annotation was computed. [2018-11-10 12:35:30,214 INFO L425 ceAbstractionStarter]: For program point L102-1(lines 51 214) no Hoare annotation was computed. [2018-11-10 12:35:30,214 INFO L425 ceAbstractionStarter]: For program point L185(line 185) no Hoare annotation was computed. [2018-11-10 12:35:30,214 INFO L425 ceAbstractionStarter]: For program point L86(lines 86 88) no Hoare annotation was computed. [2018-11-10 12:35:30,214 INFO L425 ceAbstractionStarter]: For program point L53(lines 53 55) no Hoare annotation was computed. [2018-11-10 12:35:30,214 INFO L425 ceAbstractionStarter]: For program point L86-2(lines 51 214) no Hoare annotation was computed. [2018-11-10 12:35:30,214 INFO L425 ceAbstractionStarter]: For program point L169-1(lines 51 214) no Hoare annotation was computed. [2018-11-10 12:35:30,214 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 4 219) no Hoare annotation was computed. [2018-11-10 12:35:30,214 INFO L425 ceAbstractionStarter]: For program point L170(line 170) no Hoare annotation was computed. [2018-11-10 12:35:30,214 INFO L425 ceAbstractionStarter]: For program point L154-1(lines 51 214) no Hoare annotation was computed. [2018-11-10 12:35:30,214 INFO L425 ceAbstractionStarter]: For program point L204-1(lines 51 214) no Hoare annotation was computed. [2018-11-10 12:35:30,214 INFO L425 ceAbstractionStarter]: For program point L138-1(lines 51 214) no Hoare annotation was computed. [2018-11-10 12:35:30,214 INFO L425 ceAbstractionStarter]: For program point L155(line 155) no Hoare annotation was computed. [2018-11-10 12:35:30,214 INFO L425 ceAbstractionStarter]: For program point L122-1(lines 51 214) no Hoare annotation was computed. [2018-11-10 12:35:30,214 INFO L425 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2018-11-10 12:35:30,214 INFO L425 ceAbstractionStarter]: For program point L106-1(lines 51 214) no Hoare annotation was computed. [2018-11-10 12:35:30,214 INFO L425 ceAbstractionStarter]: For program point L189-1(lines 51 214) no Hoare annotation was computed. [2018-11-10 12:35:30,214 INFO L425 ceAbstractionStarter]: For program point L90-1(lines 51 214) no Hoare annotation was computed. [2018-11-10 12:35:30,214 INFO L425 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-11-10 12:35:30,214 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 217) no Hoare annotation was computed. [2018-11-10 12:35:30,215 INFO L425 ceAbstractionStarter]: For program point L174-1(lines 51 214) no Hoare annotation was computed. [2018-11-10 12:35:30,215 INFO L425 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-11-10 12:35:30,215 INFO L425 ceAbstractionStarter]: For program point L159-1(lines 51 214) no Hoare annotation was computed. [2018-11-10 12:35:30,215 INFO L425 ceAbstractionStarter]: For program point L126-1(lines 51 214) no Hoare annotation was computed. [2018-11-10 12:35:30,215 INFO L428 ceAbstractionStarter]: At program point L209-1(lines 51 214) the Hoare annotation is: true [2018-11-10 12:35:30,215 INFO L425 ceAbstractionStarter]: For program point L110-1(lines 51 214) no Hoare annotation was computed. [2018-11-10 12:35:30,215 INFO L425 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-11-10 12:35:30,215 INFO L425 ceAbstractionStarter]: For program point L94-1(lines 51 214) no Hoare annotation was computed. [2018-11-10 12:35:30,215 INFO L425 ceAbstractionStarter]: For program point L210(line 210) no Hoare annotation was computed. [2018-11-10 12:35:30,215 INFO L421 ceAbstractionStarter]: At program point L210-1(lines 5 219) the Hoare annotation is: false [2018-11-10 12:35:30,215 INFO L425 ceAbstractionStarter]: For program point L144-1(lines 51 214) no Hoare annotation was computed. [2018-11-10 12:35:30,215 INFO L425 ceAbstractionStarter]: For program point L194-1(lines 51 214) no Hoare annotation was computed. [2018-11-10 12:35:30,215 INFO L425 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-11-10 12:35:30,215 INFO L425 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2018-11-10 12:35:30,215 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 4 219) the Hoare annotation is: true [2018-11-10 12:35:30,215 INFO L425 ceAbstractionStarter]: For program point L179-1(lines 51 214) no Hoare annotation was computed. [2018-11-10 12:35:30,215 INFO L425 ceAbstractionStarter]: For program point L130-1(lines 51 214) no Hoare annotation was computed. [2018-11-10 12:35:30,215 INFO L425 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2018-11-10 12:35:30,215 INFO L425 ceAbstractionStarter]: For program point L114-1(lines 51 214) no Hoare annotation was computed. [2018-11-10 12:35:30,215 INFO L425 ceAbstractionStarter]: For program point L164-1(lines 51 214) no Hoare annotation was computed. [2018-11-10 12:35:30,215 INFO L425 ceAbstractionStarter]: For program point L98-1(lines 51 214) no Hoare annotation was computed. [2018-11-10 12:35:30,216 INFO L425 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2018-11-10 12:35:30,216 INFO L428 ceAbstractionStarter]: At program point L215(lines 5 219) the Hoare annotation is: true [2018-11-10 12:35:30,216 INFO L425 ceAbstractionStarter]: For program point L149-1(lines 51 214) no Hoare annotation was computed. [2018-11-10 12:35:30,216 INFO L425 ceAbstractionStarter]: For program point L199-1(lines 51 214) no Hoare annotation was computed. [2018-11-10 12:35:30,216 INFO L425 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2018-11-10 12:35:30,216 INFO L425 ceAbstractionStarter]: For program point L51-1(lines 51 214) no Hoare annotation was computed. [2018-11-10 12:35:30,216 INFO L425 ceAbstractionStarter]: For program point L200(line 200) no Hoare annotation was computed. [2018-11-10 12:35:30,216 INFO L425 ceAbstractionStarter]: For program point L134-1(lines 51 214) no Hoare annotation was computed. [2018-11-10 12:35:30,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 12:35:30 BoogieIcfgContainer [2018-11-10 12:35:30,221 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 12:35:30,221 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 12:35:30,221 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 12:35:30,222 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 12:35:30,222 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:34:21" (3/4) ... [2018-11-10 12:35:30,226 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 12:35:30,232 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 12:35:30,233 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 12:35:30,239 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-10 12:35:30,239 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-10 12:35:30,239 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 12:35:30,292 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_117bd3c3-4192-474d-a81b-6f626d709b06/bin-2019/utaipan/witness.graphml [2018-11-10 12:35:30,292 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 12:35:30,294 INFO L168 Benchmark]: Toolchain (without parser) took 69405.97 ms. Allocated memory was 1.0 GB in the beginning and 5.9 GB in the end (delta: 4.9 GB). Free memory was 953.8 MB in the beginning and 3.2 GB in the end (delta: -2.3 GB). Peak memory consumption was 2.6 GB. Max. memory is 11.5 GB. [2018-11-10 12:35:30,295 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:35:30,295 INFO L168 Benchmark]: CACSL2BoogieTranslator took 189.49 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 942.9 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2018-11-10 12:35:30,295 INFO L168 Benchmark]: Boogie Procedure Inliner took 15.93 ms. Allocated memory is still 1.0 GB. Free memory is still 940.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:35:30,296 INFO L168 Benchmark]: Boogie Preprocessor took 27.00 ms. Allocated memory is still 1.0 GB. Free memory is still 940.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:35:30,296 INFO L168 Benchmark]: RCFGBuilder took 387.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 940.2 MB in the beginning and 1.1 GB in the end (delta: -153.4 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. [2018-11-10 12:35:30,296 INFO L168 Benchmark]: TraceAbstraction took 68711.25 ms. Allocated memory was 1.2 GB in the beginning and 5.9 GB in the end (delta: 4.8 GB). Free memory was 1.1 GB in the beginning and 3.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. [2018-11-10 12:35:30,296 INFO L168 Benchmark]: Witness Printer took 71.27 ms. Allocated memory is still 5.9 GB. Free memory was 3.2 GB in the beginning and 3.2 GB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 11.5 GB. [2018-11-10 12:35:30,298 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 189.49 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 942.9 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 15.93 ms. Allocated memory is still 1.0 GB. Free memory is still 940.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.00 ms. Allocated memory is still 1.0 GB. Free memory is still 940.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 387.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 940.2 MB in the beginning and 1.1 GB in the end (delta: -153.4 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 68711.25 ms. Allocated memory was 1.2 GB in the beginning and 5.9 GB in the end (delta: 4.8 GB). Free memory was 1.1 GB in the beginning and 3.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. * Witness Printer took 71.27 ms. Allocated memory is still 5.9 GB. Free memory was 3.2 GB in the beginning and 3.2 GB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 217]: 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: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 57 locations, 1 error locations. SAFE Result, 68.6s OverallTime, 39 OverallIterations, 1 TraceHistogramMax, 35.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4609 SDtfs, 2290 SDslu, 3157 SDs, 0 SdLazy, 207 SolverSat, 39 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=495625occurred in iteration=38, 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: 31.2s AutomataMinimizationTime, 39 MinimizatonAttempts, 81961 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 16394 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.8s InterpolantComputationTime, 1230 NumberOfCodeBlocks, 1230 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 1191 ConstructedInterpolants, 0 QuantifiedInterpolants, 75887 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 39 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...