./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_srvr_12.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_8ca7b94c-9059-4f01-8d78-357f73338f59/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8ca7b94c-9059-4f01-8d78-357f73338f59/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8ca7b94c-9059-4f01-8d78-357f73338f59/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8ca7b94c-9059-4f01-8d78-357f73338f59/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_srvr_12.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_8ca7b94c-9059-4f01-8d78-357f73338f59/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8ca7b94c-9059-4f01-8d78-357f73338f59/bin/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 d203fdfca57a36b6738b0f9dc4164fa3855180e7 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:25:45,857 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:25:45,859 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:25:45,871 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:25:45,871 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:25:45,872 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:25:45,873 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:25:45,875 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:25:45,877 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:25:45,879 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:25:45,880 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:25:45,881 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:25:45,881 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:25:45,882 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:25:45,882 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:25:45,890 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:25:45,890 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:25:45,891 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:25:45,892 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:25:45,893 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:25:45,894 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:25:45,898 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:25:45,900 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:25:45,900 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:25:45,902 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:25:45,902 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:25:45,902 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:25:45,907 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:25:45,908 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:25:45,908 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:25:45,908 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:25:45,909 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:25:45,909 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:25:45,910 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:25:45,911 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:25:45,911 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:25:45,914 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:25:45,914 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:25:45,914 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:25:45,915 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:25:45,915 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:25:45,916 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8ca7b94c-9059-4f01-8d78-357f73338f59/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:25:45,938 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:25:45,938 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:25:45,939 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:25:45,939 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:25:45,939 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:25:45,940 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:25:45,940 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:25:45,940 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:25:45,940 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:25:45,940 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:25:45,940 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:25:45,940 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:25:45,941 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:25:45,941 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:25:45,941 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:25:45,942 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:25:45,942 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:25:45,942 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:25:45,942 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:25:45,942 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:25:45,942 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:25:45,943 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:25:45,943 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:25:45,943 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:25:45,944 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:25:45,944 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:25:45,944 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:25:45,944 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:25:45,944 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:25:45,945 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:25:45,945 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:25:45,945 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:25:45,945 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:25:45,945 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:25:45,945 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:25:45,945 INFO L138 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_8ca7b94c-9059-4f01-8d78-357f73338f59/bin/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 -> d203fdfca57a36b6738b0f9dc4164fa3855180e7 [2019-10-22 11:25:45,978 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:25:45,989 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:25:45,994 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:25:45,997 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:25:45,998 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:25:45,998 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8ca7b94c-9059-4f01-8d78-357f73338f59/bin/utaipan/../../sv-benchmarks/c/ssh-simplified/s3_srvr_12.cil.c [2019-10-22 11:25:46,054 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8ca7b94c-9059-4f01-8d78-357f73338f59/bin/utaipan/data/97134a38f/3a78a584f00c4f1dbd67408c4ce60577/FLAG62273395b [2019-10-22 11:25:46,495 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:25:46,495 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8ca7b94c-9059-4f01-8d78-357f73338f59/sv-benchmarks/c/ssh-simplified/s3_srvr_12.cil.c [2019-10-22 11:25:46,505 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8ca7b94c-9059-4f01-8d78-357f73338f59/bin/utaipan/data/97134a38f/3a78a584f00c4f1dbd67408c4ce60577/FLAG62273395b [2019-10-22 11:25:46,867 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8ca7b94c-9059-4f01-8d78-357f73338f59/bin/utaipan/data/97134a38f/3a78a584f00c4f1dbd67408c4ce60577 [2019-10-22 11:25:46,869 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:25:46,870 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:25:46,871 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:25:46,871 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:25:46,875 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:25:46,876 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:25:46" (1/1) ... [2019-10-22 11:25:46,878 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68f82444 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:46, skipping insertion in model container [2019-10-22 11:25:46,879 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:25:46" (1/1) ... [2019-10-22 11:25:46,886 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:25:46,922 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:25:47,243 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:25:47,255 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:25:47,340 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:25:47,354 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:25:47,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:47 WrapperNode [2019-10-22 11:25:47,355 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:25:47,356 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:25:47,356 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:25:47,357 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:25:47,365 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:47" (1/1) ... [2019-10-22 11:25:47,375 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:47" (1/1) ... [2019-10-22 11:25:47,429 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:25:47,430 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:25:47,430 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:25:47,430 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:25:47,437 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:47" (1/1) ... [2019-10-22 11:25:47,437 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:47" (1/1) ... [2019-10-22 11:25:47,440 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:47" (1/1) ... [2019-10-22 11:25:47,440 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:47" (1/1) ... [2019-10-22 11:25:47,446 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:47" (1/1) ... [2019-10-22 11:25:47,455 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:47" (1/1) ... [2019-10-22 11:25:47,457 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:47" (1/1) ... [2019-10-22 11:25:47,461 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:25:47,461 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:25:47,462 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:25:47,462 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:25:47,462 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8ca7b94c-9059-4f01-8d78-357f73338f59/bin/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 [2019-10-22 11:25:47,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:25:47,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:25:47,700 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 11:25:48,402 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-10-22 11:25:48,403 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-10-22 11:25:48,404 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:25:48,404 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 11:25:48,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:25:48 BoogieIcfgContainer [2019-10-22 11:25:48,406 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:25:48,407 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:25:48,407 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:25:48,410 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:25:48,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:25:46" (1/3) ... [2019-10-22 11:25:48,411 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aaa797b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:25:48, skipping insertion in model container [2019-10-22 11:25:48,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:47" (2/3) ... [2019-10-22 11:25:48,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aaa797b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:25:48, skipping insertion in model container [2019-10-22 11:25:48,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:25:48" (3/3) ... [2019-10-22 11:25:48,414 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_12.cil.c [2019-10-22 11:25:48,423 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:25:48,431 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 11:25:48,441 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 11:25:48,468 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:25:48,469 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:25:48,469 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:25:48,469 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:25:48,469 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:25:48,469 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:25:48,469 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:25:48,469 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:25:48,487 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states. [2019-10-22 11:25:48,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-22 11:25:48,494 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:48,494 INFO L380 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] [2019-10-22 11:25:48,496 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:48,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:48,502 INFO L82 PathProgramCache]: Analyzing trace with hash 837253908, now seen corresponding path program 1 times [2019-10-22 11:25:48,510 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:48,510 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215818368] [2019-10-22 11:25:48,510 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:48,510 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:48,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:48,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:48,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:48,686 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215818368] [2019-10-22 11:25:48,687 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:48,687 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:25:48,688 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153687753] [2019-10-22 11:25:48,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:48,693 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:48,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:48,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:48,705 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 3 states. [2019-10-22 11:25:48,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:48,968 INFO L93 Difference]: Finished difference Result 352 states and 612 transitions. [2019-10-22 11:25:48,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:48,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-22 11:25:48,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:48,982 INFO L225 Difference]: With dead ends: 352 [2019-10-22 11:25:48,982 INFO L226 Difference]: Without dead ends: 173 [2019-10-22 11:25:48,986 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:49,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-10-22 11:25:49,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2019-10-22 11:25:49,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-10-22 11:25:49,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 276 transitions. [2019-10-22 11:25:49,036 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 276 transitions. Word has length 27 [2019-10-22 11:25:49,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:49,036 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 276 transitions. [2019-10-22 11:25:49,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:49,037 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 276 transitions. [2019-10-22 11:25:49,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-22 11:25:49,038 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:49,038 INFO L380 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] [2019-10-22 11:25:49,038 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:49,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:49,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1153856875, now seen corresponding path program 1 times [2019-10-22 11:25:49,039 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:49,039 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078710141] [2019-10-22 11:25:49,039 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:49,040 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:49,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:49,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:49,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:49,105 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078710141] [2019-10-22 11:25:49,105 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:49,106 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:25:49,106 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395710379] [2019-10-22 11:25:49,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:49,108 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:49,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:49,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:49,109 INFO L87 Difference]: Start difference. First operand 171 states and 276 transitions. Second operand 3 states. [2019-10-22 11:25:49,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:49,257 INFO L93 Difference]: Finished difference Result 357 states and 574 transitions. [2019-10-22 11:25:49,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:49,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-22 11:25:49,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:49,260 INFO L225 Difference]: With dead ends: 357 [2019-10-22 11:25:49,260 INFO L226 Difference]: Without dead ends: 193 [2019-10-22 11:25:49,261 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:49,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-10-22 11:25:49,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2019-10-22 11:25:49,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-10-22 11:25:49,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 306 transitions. [2019-10-22 11:25:49,298 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 306 transitions. Word has length 28 [2019-10-22 11:25:49,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:49,298 INFO L462 AbstractCegarLoop]: Abstraction has 193 states and 306 transitions. [2019-10-22 11:25:49,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:49,298 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 306 transitions. [2019-10-22 11:25:49,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-22 11:25:49,299 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:49,299 INFO L380 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] [2019-10-22 11:25:49,300 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:49,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:49,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1283716064, now seen corresponding path program 1 times [2019-10-22 11:25:49,300 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:49,300 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263190502] [2019-10-22 11:25:49,301 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:49,301 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:49,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:49,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:49,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:49,388 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263190502] [2019-10-22 11:25:49,388 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:49,388 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:25:49,388 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389160235] [2019-10-22 11:25:49,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:49,389 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:49,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:49,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:49,390 INFO L87 Difference]: Start difference. First operand 193 states and 306 transitions. Second operand 3 states. [2019-10-22 11:25:49,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:49,561 INFO L93 Difference]: Finished difference Result 387 states and 615 transitions. [2019-10-22 11:25:49,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:49,562 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-22 11:25:49,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:49,564 INFO L225 Difference]: With dead ends: 387 [2019-10-22 11:25:49,564 INFO L226 Difference]: Without dead ends: 201 [2019-10-22 11:25:49,565 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:49,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-10-22 11:25:49,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2019-10-22 11:25:49,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-10-22 11:25:49,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 317 transitions. [2019-10-22 11:25:49,588 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 317 transitions. Word has length 28 [2019-10-22 11:25:49,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:49,588 INFO L462 AbstractCegarLoop]: Abstraction has 199 states and 317 transitions. [2019-10-22 11:25:49,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:49,589 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 317 transitions. [2019-10-22 11:25:49,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-22 11:25:49,590 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:49,590 INFO L380 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] [2019-10-22 11:25:49,590 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:49,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:49,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1700322528, now seen corresponding path program 1 times [2019-10-22 11:25:49,591 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:49,591 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93376639] [2019-10-22 11:25:49,591 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:49,592 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:49,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:49,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:49,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:49,635 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93376639] [2019-10-22 11:25:49,635 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:49,635 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:25:49,635 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410942140] [2019-10-22 11:25:49,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:49,636 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:49,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:49,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:49,637 INFO L87 Difference]: Start difference. First operand 199 states and 317 transitions. Second operand 3 states. [2019-10-22 11:25:49,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:49,778 INFO L93 Difference]: Finished difference Result 392 states and 625 transitions. [2019-10-22 11:25:49,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:49,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-22 11:25:49,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:49,780 INFO L225 Difference]: With dead ends: 392 [2019-10-22 11:25:49,780 INFO L226 Difference]: Without dead ends: 200 [2019-10-22 11:25:49,788 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:49,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-10-22 11:25:49,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2019-10-22 11:25:49,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-10-22 11:25:49,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 318 transitions. [2019-10-22 11:25:49,806 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 318 transitions. Word has length 28 [2019-10-22 11:25:49,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:49,806 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 318 transitions. [2019-10-22 11:25:49,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:49,807 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 318 transitions. [2019-10-22 11:25:49,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-22 11:25:49,812 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:49,812 INFO L380 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] [2019-10-22 11:25:49,812 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:49,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:49,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1839049416, now seen corresponding path program 1 times [2019-10-22 11:25:49,813 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:49,813 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423399633] [2019-10-22 11:25:49,813 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:49,814 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:49,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:49,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:49,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:49,874 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423399633] [2019-10-22 11:25:49,874 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:49,875 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:25:49,875 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419440547] [2019-10-22 11:25:49,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:49,878 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:49,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:49,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:49,879 INFO L87 Difference]: Start difference. First operand 200 states and 318 transitions. Second operand 3 states. [2019-10-22 11:25:50,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:50,027 INFO L93 Difference]: Finished difference Result 403 states and 637 transitions. [2019-10-22 11:25:50,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:50,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-22 11:25:50,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:50,029 INFO L225 Difference]: With dead ends: 403 [2019-10-22 11:25:50,029 INFO L226 Difference]: Without dead ends: 210 [2019-10-22 11:25:50,030 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:50,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-10-22 11:25:50,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 200. [2019-10-22 11:25:50,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-10-22 11:25:50,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 316 transitions. [2019-10-22 11:25:50,041 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 316 transitions. Word has length 29 [2019-10-22 11:25:50,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:50,041 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 316 transitions. [2019-10-22 11:25:50,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:50,042 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 316 transitions. [2019-10-22 11:25:50,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-22 11:25:50,043 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:50,043 INFO L380 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] [2019-10-22 11:25:50,043 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:50,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:50,044 INFO L82 PathProgramCache]: Analyzing trace with hash 208599556, now seen corresponding path program 1 times [2019-10-22 11:25:50,044 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:50,044 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158020124] [2019-10-22 11:25:50,044 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:50,044 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:50,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:50,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:50,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:50,075 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158020124] [2019-10-22 11:25:50,075 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:50,075 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:25:50,075 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044545980] [2019-10-22 11:25:50,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:50,076 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:50,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:50,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:50,077 INFO L87 Difference]: Start difference. First operand 200 states and 316 transitions. Second operand 3 states. [2019-10-22 11:25:50,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:50,241 INFO L93 Difference]: Finished difference Result 403 states and 633 transitions. [2019-10-22 11:25:50,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:50,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-22 11:25:50,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:50,243 INFO L225 Difference]: With dead ends: 403 [2019-10-22 11:25:50,243 INFO L226 Difference]: Without dead ends: 210 [2019-10-22 11:25:50,244 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:50,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-10-22 11:25:50,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 200. [2019-10-22 11:25:50,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-10-22 11:25:50,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 314 transitions. [2019-10-22 11:25:50,253 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 314 transitions. Word has length 30 [2019-10-22 11:25:50,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:50,254 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 314 transitions. [2019-10-22 11:25:50,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:50,254 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 314 transitions. [2019-10-22 11:25:50,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-22 11:25:50,255 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:50,259 INFO L380 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] [2019-10-22 11:25:50,259 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:50,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:50,260 INFO L82 PathProgramCache]: Analyzing trace with hash 317962813, now seen corresponding path program 1 times [2019-10-22 11:25:50,260 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:50,260 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248017647] [2019-10-22 11:25:50,260 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:50,260 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:50,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:50,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:50,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:50,315 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248017647] [2019-10-22 11:25:50,315 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:50,315 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:25:50,315 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536599271] [2019-10-22 11:25:50,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:50,316 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:50,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:50,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:50,316 INFO L87 Difference]: Start difference. First operand 200 states and 314 transitions. Second operand 3 states. [2019-10-22 11:25:50,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:50,438 INFO L93 Difference]: Finished difference Result 403 states and 629 transitions. [2019-10-22 11:25:50,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:50,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-22 11:25:50,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:50,440 INFO L225 Difference]: With dead ends: 403 [2019-10-22 11:25:50,440 INFO L226 Difference]: Without dead ends: 210 [2019-10-22 11:25:50,440 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:50,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-10-22 11:25:50,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 200. [2019-10-22 11:25:50,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-10-22 11:25:50,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 312 transitions. [2019-10-22 11:25:50,449 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 312 transitions. Word has length 31 [2019-10-22 11:25:50,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:50,449 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 312 transitions. [2019-10-22 11:25:50,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:50,449 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 312 transitions. [2019-10-22 11:25:50,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-22 11:25:50,453 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:50,455 INFO L380 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] [2019-10-22 11:25:50,455 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:50,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:50,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1377718110, now seen corresponding path program 1 times [2019-10-22 11:25:50,455 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:50,456 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400395345] [2019-10-22 11:25:50,456 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:50,456 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:50,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:50,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:50,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:50,513 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400395345] [2019-10-22 11:25:50,513 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:50,513 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:25:50,513 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293604380] [2019-10-22 11:25:50,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:25:50,514 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:50,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:25:50,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:25:50,514 INFO L87 Difference]: Start difference. First operand 200 states and 312 transitions. Second operand 4 states. [2019-10-22 11:25:50,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:50,767 INFO L93 Difference]: Finished difference Result 599 states and 929 transitions. [2019-10-22 11:25:50,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:25:50,768 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-10-22 11:25:50,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:50,770 INFO L225 Difference]: With dead ends: 599 [2019-10-22 11:25:50,770 INFO L226 Difference]: Without dead ends: 406 [2019-10-22 11:25:50,771 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:25:50,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-10-22 11:25:50,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 382. [2019-10-22 11:25:50,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-10-22 11:25:50,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 594 transitions. [2019-10-22 11:25:50,788 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 594 transitions. Word has length 31 [2019-10-22 11:25:50,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:50,788 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 594 transitions. [2019-10-22 11:25:50,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:25:50,788 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 594 transitions. [2019-10-22 11:25:50,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-22 11:25:50,789 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:50,790 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:50,790 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:50,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:50,790 INFO L82 PathProgramCache]: Analyzing trace with hash 2127610357, now seen corresponding path program 1 times [2019-10-22 11:25:50,790 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:50,791 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526426624] [2019-10-22 11:25:50,791 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:50,791 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:50,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:50,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:50,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:50,821 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526426624] [2019-10-22 11:25:50,822 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:50,822 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:25:50,822 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228974232] [2019-10-22 11:25:50,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:50,823 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:50,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:50,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:50,823 INFO L87 Difference]: Start difference. First operand 382 states and 594 transitions. Second operand 3 states. [2019-10-22 11:25:51,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:51,033 INFO L93 Difference]: Finished difference Result 841 states and 1323 transitions. [2019-10-22 11:25:51,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:51,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-10-22 11:25:51,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:51,037 INFO L225 Difference]: With dead ends: 841 [2019-10-22 11:25:51,037 INFO L226 Difference]: Without dead ends: 466 [2019-10-22 11:25:51,038 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:51,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-10-22 11:25:51,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 448. [2019-10-22 11:25:51,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-10-22 11:25:51,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 709 transitions. [2019-10-22 11:25:51,057 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 709 transitions. Word has length 43 [2019-10-22 11:25:51,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:51,057 INFO L462 AbstractCegarLoop]: Abstraction has 448 states and 709 transitions. [2019-10-22 11:25:51,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:51,058 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 709 transitions. [2019-10-22 11:25:51,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-22 11:25:51,059 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:51,059 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:51,059 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:51,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:51,063 INFO L82 PathProgramCache]: Analyzing trace with hash -918181316, now seen corresponding path program 1 times [2019-10-22 11:25:51,063 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:51,064 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839034250] [2019-10-22 11:25:51,064 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:51,064 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:51,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:51,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:51,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:51,106 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839034250] [2019-10-22 11:25:51,106 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:51,106 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:25:51,106 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549289596] [2019-10-22 11:25:51,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:51,107 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:51,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:51,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:51,108 INFO L87 Difference]: Start difference. First operand 448 states and 709 transitions. Second operand 3 states. [2019-10-22 11:25:51,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:51,265 INFO L93 Difference]: Finished difference Result 930 states and 1481 transitions. [2019-10-22 11:25:51,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:51,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-10-22 11:25:51,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:51,268 INFO L225 Difference]: With dead ends: 930 [2019-10-22 11:25:51,268 INFO L226 Difference]: Without dead ends: 489 [2019-10-22 11:25:51,269 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:51,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2019-10-22 11:25:51,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 471. [2019-10-22 11:25:51,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2019-10-22 11:25:51,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 752 transitions. [2019-10-22 11:25:51,285 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 752 transitions. Word has length 44 [2019-10-22 11:25:51,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:51,285 INFO L462 AbstractCegarLoop]: Abstraction has 471 states and 752 transitions. [2019-10-22 11:25:51,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:51,286 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 752 transitions. [2019-10-22 11:25:51,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-22 11:25:51,287 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:51,287 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:51,287 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:51,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:51,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1360549312, now seen corresponding path program 1 times [2019-10-22 11:25:51,288 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:51,288 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181981687] [2019-10-22 11:25:51,288 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:51,288 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:51,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:51,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:51,328 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:25:51,328 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181981687] [2019-10-22 11:25:51,329 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:51,329 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:25:51,329 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079641600] [2019-10-22 11:25:51,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:51,329 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:51,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:51,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:51,330 INFO L87 Difference]: Start difference. First operand 471 states and 752 transitions. Second operand 3 states. [2019-10-22 11:25:51,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:51,480 INFO L93 Difference]: Finished difference Result 987 states and 1577 transitions. [2019-10-22 11:25:51,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:51,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-10-22 11:25:51,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:51,483 INFO L225 Difference]: With dead ends: 987 [2019-10-22 11:25:51,483 INFO L226 Difference]: Without dead ends: 523 [2019-10-22 11:25:51,484 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:51,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2019-10-22 11:25:51,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 505. [2019-10-22 11:25:51,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-10-22 11:25:51,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 803 transitions. [2019-10-22 11:25:51,502 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 803 transitions. Word has length 55 [2019-10-22 11:25:51,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:51,502 INFO L462 AbstractCegarLoop]: Abstraction has 505 states and 803 transitions. [2019-10-22 11:25:51,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:51,502 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 803 transitions. [2019-10-22 11:25:51,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-22 11:25:51,504 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:51,504 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:51,505 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:51,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:51,505 INFO L82 PathProgramCache]: Analyzing trace with hash -938767092, now seen corresponding path program 1 times [2019-10-22 11:25:51,505 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:51,505 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940016341] [2019-10-22 11:25:51,505 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:51,506 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:51,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:51,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:51,553 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:25:51,553 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940016341] [2019-10-22 11:25:51,553 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:51,554 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:25:51,554 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080551298] [2019-10-22 11:25:51,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:51,554 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:51,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:51,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:51,555 INFO L87 Difference]: Start difference. First operand 505 states and 803 transitions. Second operand 3 states. [2019-10-22 11:25:51,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:51,701 INFO L93 Difference]: Finished difference Result 1021 states and 1625 transitions. [2019-10-22 11:25:51,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:51,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-10-22 11:25:51,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:51,703 INFO L225 Difference]: With dead ends: 1021 [2019-10-22 11:25:51,704 INFO L226 Difference]: Without dead ends: 523 [2019-10-22 11:25:51,704 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:51,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2019-10-22 11:25:51,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 505. [2019-10-22 11:25:51,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-10-22 11:25:51,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 800 transitions. [2019-10-22 11:25:51,722 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 800 transitions. Word has length 56 [2019-10-22 11:25:51,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:51,722 INFO L462 AbstractCegarLoop]: Abstraction has 505 states and 800 transitions. [2019-10-22 11:25:51,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:51,722 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 800 transitions. [2019-10-22 11:25:51,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-22 11:25:51,725 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:51,725 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:51,725 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:51,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:51,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1817934782, now seen corresponding path program 1 times [2019-10-22 11:25:51,726 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:51,726 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766584303] [2019-10-22 11:25:51,726 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:51,726 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:51,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:51,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:51,764 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:25:51,765 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766584303] [2019-10-22 11:25:51,765 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:51,765 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:25:51,765 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285078920] [2019-10-22 11:25:51,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:51,766 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:51,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:51,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:51,766 INFO L87 Difference]: Start difference. First operand 505 states and 800 transitions. Second operand 3 states. [2019-10-22 11:25:51,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:51,914 INFO L93 Difference]: Finished difference Result 1068 states and 1696 transitions. [2019-10-22 11:25:51,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:51,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-10-22 11:25:51,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:51,916 INFO L225 Difference]: With dead ends: 1068 [2019-10-22 11:25:51,916 INFO L226 Difference]: Without dead ends: 570 [2019-10-22 11:25:51,917 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:51,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-10-22 11:25:51,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 568. [2019-10-22 11:25:51,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-10-22 11:25:51,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 897 transitions. [2019-10-22 11:25:51,938 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 897 transitions. Word has length 56 [2019-10-22 11:25:51,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:51,939 INFO L462 AbstractCegarLoop]: Abstraction has 568 states and 897 transitions. [2019-10-22 11:25:51,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:51,939 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 897 transitions. [2019-10-22 11:25:51,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-22 11:25:51,940 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:51,940 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:51,941 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:51,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:51,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1041214451, now seen corresponding path program 1 times [2019-10-22 11:25:51,941 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:51,941 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326548670] [2019-10-22 11:25:51,941 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:51,941 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:51,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:51,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:51,969 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:51,970 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326548670] [2019-10-22 11:25:51,970 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:51,970 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:25:51,970 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210120658] [2019-10-22 11:25:51,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:51,971 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:51,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:51,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:51,971 INFO L87 Difference]: Start difference. First operand 568 states and 897 transitions. Second operand 3 states. [2019-10-22 11:25:52,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:52,132 INFO L93 Difference]: Finished difference Result 1178 states and 1858 transitions. [2019-10-22 11:25:52,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:52,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-10-22 11:25:52,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:52,135 INFO L225 Difference]: With dead ends: 1178 [2019-10-22 11:25:52,136 INFO L226 Difference]: Without dead ends: 617 [2019-10-22 11:25:52,137 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:52,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-10-22 11:25:52,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 611. [2019-10-22 11:25:52,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-10-22 11:25:52,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 961 transitions. [2019-10-22 11:25:52,164 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 961 transitions. Word has length 78 [2019-10-22 11:25:52,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:52,165 INFO L462 AbstractCegarLoop]: Abstraction has 611 states and 961 transitions. [2019-10-22 11:25:52,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:52,165 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 961 transitions. [2019-10-22 11:25:52,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-22 11:25:52,166 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:52,166 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:52,166 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:52,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:52,167 INFO L82 PathProgramCache]: Analyzing trace with hash 45471174, now seen corresponding path program 1 times [2019-10-22 11:25:52,167 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:52,167 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547113645] [2019-10-22 11:25:52,167 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:52,167 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:52,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:52,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:52,207 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:52,207 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547113645] [2019-10-22 11:25:52,207 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:52,207 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:25:52,207 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882220823] [2019-10-22 11:25:52,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:52,208 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:52,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:52,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:52,208 INFO L87 Difference]: Start difference. First operand 611 states and 961 transitions. Second operand 3 states. [2019-10-22 11:25:52,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:52,361 INFO L93 Difference]: Finished difference Result 1221 states and 1919 transitions. [2019-10-22 11:25:52,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:52,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-10-22 11:25:52,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:52,364 INFO L225 Difference]: With dead ends: 1221 [2019-10-22 11:25:52,365 INFO L226 Difference]: Without dead ends: 617 [2019-10-22 11:25:52,366 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:52,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-10-22 11:25:52,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 611. [2019-10-22 11:25:52,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-10-22 11:25:52,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 958 transitions. [2019-10-22 11:25:52,395 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 958 transitions. Word has length 79 [2019-10-22 11:25:52,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:52,395 INFO L462 AbstractCegarLoop]: Abstraction has 611 states and 958 transitions. [2019-10-22 11:25:52,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:52,395 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 958 transitions. [2019-10-22 11:25:52,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-22 11:25:52,396 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:52,397 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:52,397 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:52,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:52,397 INFO L82 PathProgramCache]: Analyzing trace with hash -998330754, now seen corresponding path program 1 times [2019-10-22 11:25:52,397 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:52,398 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189406685] [2019-10-22 11:25:52,398 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:52,398 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:52,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:52,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:52,433 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-22 11:25:52,433 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189406685] [2019-10-22 11:25:52,433 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:52,433 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:25:52,433 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866097475] [2019-10-22 11:25:52,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:52,434 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:52,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:52,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:52,434 INFO L87 Difference]: Start difference. First operand 611 states and 958 transitions. Second operand 3 states. [2019-10-22 11:25:52,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:52,568 INFO L93 Difference]: Finished difference Result 1217 states and 1907 transitions. [2019-10-22 11:25:52,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:52,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-10-22 11:25:52,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:52,570 INFO L225 Difference]: With dead ends: 1217 [2019-10-22 11:25:52,571 INFO L226 Difference]: Without dead ends: 613 [2019-10-22 11:25:52,572 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:52,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2019-10-22 11:25:52,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 611. [2019-10-22 11:25:52,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-10-22 11:25:52,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 953 transitions. [2019-10-22 11:25:52,593 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 953 transitions. Word has length 84 [2019-10-22 11:25:52,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:52,593 INFO L462 AbstractCegarLoop]: Abstraction has 611 states and 953 transitions. [2019-10-22 11:25:52,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:52,593 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 953 transitions. [2019-10-22 11:25:52,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-22 11:25:52,594 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:52,594 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:52,595 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:52,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:52,595 INFO L82 PathProgramCache]: Analyzing trace with hash -92645170, now seen corresponding path program 1 times [2019-10-22 11:25:52,595 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:52,595 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453771431] [2019-10-22 11:25:52,595 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:52,596 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:52,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:52,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:52,638 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-22 11:25:52,638 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453771431] [2019-10-22 11:25:52,638 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:52,638 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:25:52,639 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115104349] [2019-10-22 11:25:52,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:52,640 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:52,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:52,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:52,640 INFO L87 Difference]: Start difference. First operand 611 states and 953 transitions. Second operand 3 states. [2019-10-22 11:25:52,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:52,789 INFO L93 Difference]: Finished difference Result 1275 states and 1990 transitions. [2019-10-22 11:25:52,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:52,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-10-22 11:25:52,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:52,792 INFO L225 Difference]: With dead ends: 1275 [2019-10-22 11:25:52,792 INFO L226 Difference]: Without dead ends: 671 [2019-10-22 11:25:52,793 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:52,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2019-10-22 11:25:52,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 643. [2019-10-22 11:25:52,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-10-22 11:25:52,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 996 transitions. [2019-10-22 11:25:52,838 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 996 transitions. Word has length 92 [2019-10-22 11:25:52,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:52,838 INFO L462 AbstractCegarLoop]: Abstraction has 643 states and 996 transitions. [2019-10-22 11:25:52,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:52,838 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 996 transitions. [2019-10-22 11:25:52,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-22 11:25:52,839 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:52,840 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:52,840 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:52,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:52,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1567438302, now seen corresponding path program 1 times [2019-10-22 11:25:52,840 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:52,840 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357025051] [2019-10-22 11:25:52,840 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:52,841 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:52,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:52,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:52,877 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-22 11:25:52,878 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357025051] [2019-10-22 11:25:52,878 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:52,878 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:25:52,878 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215045270] [2019-10-22 11:25:52,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:52,878 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:52,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:52,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:52,879 INFO L87 Difference]: Start difference. First operand 643 states and 996 transitions. Second operand 3 states. [2019-10-22 11:25:53,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:53,031 INFO L93 Difference]: Finished difference Result 1307 states and 2027 transitions. [2019-10-22 11:25:53,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:53,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-10-22 11:25:53,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:53,034 INFO L225 Difference]: With dead ends: 1307 [2019-10-22 11:25:53,034 INFO L226 Difference]: Without dead ends: 671 [2019-10-22 11:25:53,035 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:53,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2019-10-22 11:25:53,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 643. [2019-10-22 11:25:53,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-10-22 11:25:53,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 990 transitions. [2019-10-22 11:25:53,060 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 990 transitions. Word has length 93 [2019-10-22 11:25:53,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:53,061 INFO L462 AbstractCegarLoop]: Abstraction has 643 states and 990 transitions. [2019-10-22 11:25:53,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:53,061 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 990 transitions. [2019-10-22 11:25:53,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-22 11:25:53,062 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:53,062 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:53,063 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:53,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:53,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1415900119, now seen corresponding path program 1 times [2019-10-22 11:25:53,063 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:53,063 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061049854] [2019-10-22 11:25:53,063 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:53,063 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:53,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:53,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:53,100 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-22 11:25:53,101 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061049854] [2019-10-22 11:25:53,101 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:53,101 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:25:53,101 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245823503] [2019-10-22 11:25:53,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:53,102 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:53,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:53,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:53,102 INFO L87 Difference]: Start difference. First operand 643 states and 990 transitions. Second operand 3 states. [2019-10-22 11:25:53,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:53,270 INFO L93 Difference]: Finished difference Result 1343 states and 2067 transitions. [2019-10-22 11:25:53,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:53,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-10-22 11:25:53,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:53,274 INFO L225 Difference]: With dead ends: 1343 [2019-10-22 11:25:53,274 INFO L226 Difference]: Without dead ends: 707 [2019-10-22 11:25:53,275 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:53,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2019-10-22 11:25:53,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 695. [2019-10-22 11:25:53,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 695 states. [2019-10-22 11:25:53,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 1066 transitions. [2019-10-22 11:25:53,302 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 1066 transitions. Word has length 99 [2019-10-22 11:25:53,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:53,303 INFO L462 AbstractCegarLoop]: Abstraction has 695 states and 1066 transitions. [2019-10-22 11:25:53,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:53,303 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 1066 transitions. [2019-10-22 11:25:53,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-22 11:25:53,304 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:53,304 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:53,305 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:53,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:53,305 INFO L82 PathProgramCache]: Analyzing trace with hash 128670256, now seen corresponding path program 1 times [2019-10-22 11:25:53,305 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:53,305 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576016437] [2019-10-22 11:25:53,305 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:53,306 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:53,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:53,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:53,337 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-22 11:25:53,338 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576016437] [2019-10-22 11:25:53,338 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:53,338 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:25:53,338 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438261360] [2019-10-22 11:25:53,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:53,338 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:53,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:53,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:53,339 INFO L87 Difference]: Start difference. First operand 695 states and 1066 transitions. Second operand 3 states. [2019-10-22 11:25:53,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:53,487 INFO L93 Difference]: Finished difference Result 1400 states and 2149 transitions. [2019-10-22 11:25:53,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:53,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-10-22 11:25:53,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:53,490 INFO L225 Difference]: With dead ends: 1400 [2019-10-22 11:25:53,490 INFO L226 Difference]: Without dead ends: 708 [2019-10-22 11:25:53,491 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:53,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2019-10-22 11:25:53,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 696. [2019-10-22 11:25:53,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2019-10-22 11:25:53,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1067 transitions. [2019-10-22 11:25:53,521 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1067 transitions. Word has length 100 [2019-10-22 11:25:53,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:53,522 INFO L462 AbstractCegarLoop]: Abstraction has 696 states and 1067 transitions. [2019-10-22 11:25:53,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:53,522 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1067 transitions. [2019-10-22 11:25:53,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-22 11:25:53,523 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:53,523 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:53,523 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:53,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:53,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1243086285, now seen corresponding path program 1 times [2019-10-22 11:25:53,524 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:53,524 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853623721] [2019-10-22 11:25:53,524 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:53,524 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:53,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:53,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:53,556 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-22 11:25:53,556 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853623721] [2019-10-22 11:25:53,557 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:53,557 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:25:53,557 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210078129] [2019-10-22 11:25:53,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:53,557 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:53,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:53,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:53,558 INFO L87 Difference]: Start difference. First operand 696 states and 1067 transitions. Second operand 3 states. [2019-10-22 11:25:53,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:53,710 INFO L93 Difference]: Finished difference Result 1432 states and 2191 transitions. [2019-10-22 11:25:53,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:53,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-10-22 11:25:53,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:53,713 INFO L225 Difference]: With dead ends: 1432 [2019-10-22 11:25:53,713 INFO L226 Difference]: Without dead ends: 743 [2019-10-22 11:25:53,714 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:53,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2019-10-22 11:25:53,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 737. [2019-10-22 11:25:53,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2019-10-22 11:25:53,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1122 transitions. [2019-10-22 11:25:53,742 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1122 transitions. Word has length 111 [2019-10-22 11:25:53,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:53,742 INFO L462 AbstractCegarLoop]: Abstraction has 737 states and 1122 transitions. [2019-10-22 11:25:53,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:53,742 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1122 transitions. [2019-10-22 11:25:53,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-22 11:25:53,744 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:53,744 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:53,744 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:53,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:53,745 INFO L82 PathProgramCache]: Analyzing trace with hash -2098703404, now seen corresponding path program 1 times [2019-10-22 11:25:53,745 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:53,745 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044800810] [2019-10-22 11:25:53,745 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:53,745 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:53,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:53,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:53,783 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-22 11:25:53,783 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044800810] [2019-10-22 11:25:53,783 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:53,783 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:25:53,783 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8726519] [2019-10-22 11:25:53,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:53,784 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:53,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:53,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:53,784 INFO L87 Difference]: Start difference. First operand 737 states and 1122 transitions. Second operand 3 states. [2019-10-22 11:25:53,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:53,950 INFO L93 Difference]: Finished difference Result 1473 states and 2241 transitions. [2019-10-22 11:25:53,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:53,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-10-22 11:25:53,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:53,955 INFO L225 Difference]: With dead ends: 1473 [2019-10-22 11:25:53,955 INFO L226 Difference]: Without dead ends: 743 [2019-10-22 11:25:53,956 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:53,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2019-10-22 11:25:53,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 737. [2019-10-22 11:25:53,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2019-10-22 11:25:53,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1117 transitions. [2019-10-22 11:25:53,981 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1117 transitions. Word has length 112 [2019-10-22 11:25:53,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:53,982 INFO L462 AbstractCegarLoop]: Abstraction has 737 states and 1117 transitions. [2019-10-22 11:25:53,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:53,982 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1117 transitions. [2019-10-22 11:25:53,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-22 11:25:53,983 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:53,984 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:53,984 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:53,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:53,984 INFO L82 PathProgramCache]: Analyzing trace with hash -742521014, now seen corresponding path program 1 times [2019-10-22 11:25:53,984 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:53,984 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812871871] [2019-10-22 11:25:53,984 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:53,985 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:53,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:53,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:54,016 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-10-22 11:25:54,016 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812871871] [2019-10-22 11:25:54,017 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:54,017 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:25:54,017 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96166338] [2019-10-22 11:25:54,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:54,017 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:54,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:54,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:54,018 INFO L87 Difference]: Start difference. First operand 737 states and 1117 transitions. Second operand 3 states. [2019-10-22 11:25:54,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:54,172 INFO L93 Difference]: Finished difference Result 1509 states and 2284 transitions. [2019-10-22 11:25:54,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:54,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2019-10-22 11:25:54,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:54,176 INFO L225 Difference]: With dead ends: 1509 [2019-10-22 11:25:54,176 INFO L226 Difference]: Without dead ends: 779 [2019-10-22 11:25:54,177 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:54,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2019-10-22 11:25:54,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 769. [2019-10-22 11:25:54,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2019-10-22 11:25:54,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1155 transitions. [2019-10-22 11:25:54,209 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1155 transitions. Word has length 114 [2019-10-22 11:25:54,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:54,209 INFO L462 AbstractCegarLoop]: Abstraction has 769 states and 1155 transitions. [2019-10-22 11:25:54,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:54,209 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1155 transitions. [2019-10-22 11:25:54,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-22 11:25:54,211 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:54,211 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:54,211 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:54,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:54,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1633130946, now seen corresponding path program 1 times [2019-10-22 11:25:54,212 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:54,212 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047140447] [2019-10-22 11:25:54,212 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:54,212 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:54,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:54,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:54,246 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-10-22 11:25:54,247 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047140447] [2019-10-22 11:25:54,247 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:54,247 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:25:54,247 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850034115] [2019-10-22 11:25:54,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:54,248 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:54,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:54,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:54,248 INFO L87 Difference]: Start difference. First operand 769 states and 1155 transitions. Second operand 3 states. [2019-10-22 11:25:54,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:54,405 INFO L93 Difference]: Finished difference Result 1541 states and 2313 transitions. [2019-10-22 11:25:54,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:54,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2019-10-22 11:25:54,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:54,409 INFO L225 Difference]: With dead ends: 1541 [2019-10-22 11:25:54,409 INFO L226 Difference]: Without dead ends: 779 [2019-10-22 11:25:54,410 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:54,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2019-10-22 11:25:54,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 769. [2019-10-22 11:25:54,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2019-10-22 11:25:54,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1146 transitions. [2019-10-22 11:25:54,442 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1146 transitions. Word has length 115 [2019-10-22 11:25:54,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:54,442 INFO L462 AbstractCegarLoop]: Abstraction has 769 states and 1146 transitions. [2019-10-22 11:25:54,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:54,443 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1146 transitions. [2019-10-22 11:25:54,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-22 11:25:54,446 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:54,446 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:54,446 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:54,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:54,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1432440334, now seen corresponding path program 1 times [2019-10-22 11:25:54,447 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:54,447 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831121423] [2019-10-22 11:25:54,447 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:54,447 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:54,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:54,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:54,480 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-10-22 11:25:54,480 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831121423] [2019-10-22 11:25:54,480 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:54,480 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:25:54,481 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888871705] [2019-10-22 11:25:54,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:54,481 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:54,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:54,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:54,482 INFO L87 Difference]: Start difference. First operand 769 states and 1146 transitions. Second operand 3 states. [2019-10-22 11:25:54,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:54,631 INFO L93 Difference]: Finished difference Result 1567 states and 2334 transitions. [2019-10-22 11:25:54,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:54,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-10-22 11:25:54,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:54,635 INFO L225 Difference]: With dead ends: 1567 [2019-10-22 11:25:54,635 INFO L226 Difference]: Without dead ends: 805 [2019-10-22 11:25:54,636 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:54,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2019-10-22 11:25:54,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 797. [2019-10-22 11:25:54,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2019-10-22 11:25:54,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1177 transitions. [2019-10-22 11:25:54,668 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1177 transitions. Word has length 136 [2019-10-22 11:25:54,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:54,668 INFO L462 AbstractCegarLoop]: Abstraction has 797 states and 1177 transitions. [2019-10-22 11:25:54,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:54,668 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1177 transitions. [2019-10-22 11:25:54,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-22 11:25:54,670 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:54,670 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:54,670 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:54,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:54,671 INFO L82 PathProgramCache]: Analyzing trace with hash 700393094, now seen corresponding path program 1 times [2019-10-22 11:25:54,671 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:54,671 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526782273] [2019-10-22 11:25:54,672 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:54,672 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:54,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:54,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:54,704 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-10-22 11:25:54,704 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526782273] [2019-10-22 11:25:54,704 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:54,704 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:25:54,704 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60501885] [2019-10-22 11:25:54,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:54,705 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:54,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:54,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:54,705 INFO L87 Difference]: Start difference. First operand 797 states and 1177 transitions. Second operand 3 states. [2019-10-22 11:25:54,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:54,847 INFO L93 Difference]: Finished difference Result 1595 states and 2355 transitions. [2019-10-22 11:25:54,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:54,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2019-10-22 11:25:54,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:54,850 INFO L225 Difference]: With dead ends: 1595 [2019-10-22 11:25:54,851 INFO L226 Difference]: Without dead ends: 805 [2019-10-22 11:25:54,852 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:54,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2019-10-22 11:25:54,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 797. [2019-10-22 11:25:54,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2019-10-22 11:25:54,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1167 transitions. [2019-10-22 11:25:54,892 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1167 transitions. Word has length 137 [2019-10-22 11:25:54,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:54,892 INFO L462 AbstractCegarLoop]: Abstraction has 797 states and 1167 transitions. [2019-10-22 11:25:54,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:54,892 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1167 transitions. [2019-10-22 11:25:54,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-22 11:25:54,895 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:54,895 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:54,895 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:54,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:54,896 INFO L82 PathProgramCache]: Analyzing trace with hash 26936470, now seen corresponding path program 1 times [2019-10-22 11:25:54,896 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:54,896 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868194000] [2019-10-22 11:25:54,896 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:54,896 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:54,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:54,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:54,951 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-22 11:25:54,952 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868194000] [2019-10-22 11:25:54,952 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:54,952 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:25:54,952 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010247762] [2019-10-22 11:25:54,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:54,953 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:54,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:54,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:54,953 INFO L87 Difference]: Start difference. First operand 797 states and 1167 transitions. Second operand 3 states. [2019-10-22 11:25:55,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:55,161 INFO L93 Difference]: Finished difference Result 1650 states and 2409 transitions. [2019-10-22 11:25:55,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:55,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-10-22 11:25:55,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:55,164 INFO L225 Difference]: With dead ends: 1650 [2019-10-22 11:25:55,165 INFO L226 Difference]: Without dead ends: 860 [2019-10-22 11:25:55,166 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:55,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2019-10-22 11:25:55,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 846. [2019-10-22 11:25:55,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-10-22 11:25:55,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1228 transitions. [2019-10-22 11:25:55,197 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1228 transitions. Word has length 140 [2019-10-22 11:25:55,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:55,198 INFO L462 AbstractCegarLoop]: Abstraction has 846 states and 1228 transitions. [2019-10-22 11:25:55,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:55,198 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1228 transitions. [2019-10-22 11:25:55,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-22 11:25:55,200 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:55,200 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:55,201 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:55,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:55,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1329151537, now seen corresponding path program 1 times [2019-10-22 11:25:55,201 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:55,201 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505093541] [2019-10-22 11:25:55,201 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:55,201 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:55,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:55,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:55,237 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-22 11:25:55,237 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505093541] [2019-10-22 11:25:55,237 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:55,238 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:25:55,239 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448965469] [2019-10-22 11:25:55,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:55,239 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:55,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:55,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:55,240 INFO L87 Difference]: Start difference. First operand 846 states and 1228 transitions. Second operand 3 states. [2019-10-22 11:25:55,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:55,410 INFO L93 Difference]: Finished difference Result 1699 states and 2467 transitions. [2019-10-22 11:25:55,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:55,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2019-10-22 11:25:55,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:55,413 INFO L225 Difference]: With dead ends: 1699 [2019-10-22 11:25:55,413 INFO L226 Difference]: Without dead ends: 844 [2019-10-22 11:25:55,414 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:55,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2019-10-22 11:25:55,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 830. [2019-10-22 11:25:55,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2019-10-22 11:25:55,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1205 transitions. [2019-10-22 11:25:55,448 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1205 transitions. Word has length 141 [2019-10-22 11:25:55,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:55,448 INFO L462 AbstractCegarLoop]: Abstraction has 830 states and 1205 transitions. [2019-10-22 11:25:55,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:55,449 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1205 transitions. [2019-10-22 11:25:55,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-22 11:25:55,450 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:55,451 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:55,451 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:55,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:55,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1387042847, now seen corresponding path program 1 times [2019-10-22 11:25:55,452 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:55,452 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261359652] [2019-10-22 11:25:55,452 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:55,452 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:55,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:55,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:55,487 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-10-22 11:25:55,487 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261359652] [2019-10-22 11:25:55,487 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:55,487 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:25:55,487 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142067882] [2019-10-22 11:25:55,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:55,488 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:55,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:55,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:55,488 INFO L87 Difference]: Start difference. First operand 830 states and 1205 transitions. Second operand 3 states. [2019-10-22 11:25:55,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:55,643 INFO L93 Difference]: Finished difference Result 1665 states and 2417 transitions. [2019-10-22 11:25:55,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:55,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2019-10-22 11:25:55,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:55,647 INFO L225 Difference]: With dead ends: 1665 [2019-10-22 11:25:55,647 INFO L226 Difference]: Without dead ends: 842 [2019-10-22 11:25:55,648 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:55,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2019-10-22 11:25:55,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 830. [2019-10-22 11:25:55,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2019-10-22 11:25:55,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1198 transitions. [2019-10-22 11:25:55,681 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1198 transitions. Word has length 145 [2019-10-22 11:25:55,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:55,681 INFO L462 AbstractCegarLoop]: Abstraction has 830 states and 1198 transitions. [2019-10-22 11:25:55,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:55,681 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1198 transitions. [2019-10-22 11:25:55,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-22 11:25:55,683 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:55,683 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:55,684 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:55,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:55,684 INFO L82 PathProgramCache]: Analyzing trace with hash 146712776, now seen corresponding path program 1 times [2019-10-22 11:25:55,684 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:55,684 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484981525] [2019-10-22 11:25:55,684 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:55,685 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:55,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:55,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:55,720 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-10-22 11:25:55,720 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484981525] [2019-10-22 11:25:55,720 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:55,721 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:25:55,721 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572148070] [2019-10-22 11:25:55,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:55,721 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:55,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:55,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:55,722 INFO L87 Difference]: Start difference. First operand 830 states and 1198 transitions. Second operand 3 states. [2019-10-22 11:25:55,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:55,877 INFO L93 Difference]: Finished difference Result 1665 states and 2403 transitions. [2019-10-22 11:25:55,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:55,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2019-10-22 11:25:55,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:55,880 INFO L225 Difference]: With dead ends: 1665 [2019-10-22 11:25:55,881 INFO L226 Difference]: Without dead ends: 825 [2019-10-22 11:25:55,882 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:55,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2019-10-22 11:25:55,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 813. [2019-10-22 11:25:55,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-10-22 11:25:55,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1169 transitions. [2019-10-22 11:25:55,912 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1169 transitions. Word has length 146 [2019-10-22 11:25:55,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:55,912 INFO L462 AbstractCegarLoop]: Abstraction has 813 states and 1169 transitions. [2019-10-22 11:25:55,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:55,912 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1169 transitions. [2019-10-22 11:25:55,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-22 11:25:55,914 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:55,914 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:55,914 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:55,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:55,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1643771369, now seen corresponding path program 1 times [2019-10-22 11:25:55,915 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:55,915 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244615912] [2019-10-22 11:25:55,916 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:55,916 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:55,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:55,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:55,957 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-10-22 11:25:55,957 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244615912] [2019-10-22 11:25:55,957 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:55,957 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:25:55,957 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703608511] [2019-10-22 11:25:55,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:55,958 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:55,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:55,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:55,958 INFO L87 Difference]: Start difference. First operand 813 states and 1169 transitions. Second operand 3 states. [2019-10-22 11:25:56,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:56,013 INFO L93 Difference]: Finished difference Result 2411 states and 3459 transitions. [2019-10-22 11:25:56,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:56,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-10-22 11:25:56,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:56,018 INFO L225 Difference]: With dead ends: 2411 [2019-10-22 11:25:56,019 INFO L226 Difference]: Without dead ends: 1605 [2019-10-22 11:25:56,020 INFO L600 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 [2019-10-22 11:25:56,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1605 states. [2019-10-22 11:25:56,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1605 to 815. [2019-10-22 11:25:56,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 815 states. [2019-10-22 11:25:56,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1171 transitions. [2019-10-22 11:25:56,059 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1171 transitions. Word has length 153 [2019-10-22 11:25:56,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:56,059 INFO L462 AbstractCegarLoop]: Abstraction has 815 states and 1171 transitions. [2019-10-22 11:25:56,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:56,059 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1171 transitions. [2019-10-22 11:25:56,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-22 11:25:56,061 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:56,061 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:56,061 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:56,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:56,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1697255769, now seen corresponding path program 1 times [2019-10-22 11:25:56,061 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:56,062 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668131704] [2019-10-22 11:25:56,062 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:56,062 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:56,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:56,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:56,126 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-10-22 11:25:56,127 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668131704] [2019-10-22 11:25:56,127 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:56,129 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:25:56,129 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959768097] [2019-10-22 11:25:56,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:56,129 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:56,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:56,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:56,130 INFO L87 Difference]: Start difference. First operand 815 states and 1171 transitions. Second operand 3 states. [2019-10-22 11:25:56,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:56,188 INFO L93 Difference]: Finished difference Result 2410 states and 3455 transitions. [2019-10-22 11:25:56,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:56,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-10-22 11:25:56,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:56,193 INFO L225 Difference]: With dead ends: 2410 [2019-10-22 11:25:56,194 INFO L226 Difference]: Without dead ends: 1602 [2019-10-22 11:25:56,195 INFO L600 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 [2019-10-22 11:25:56,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1602 states. [2019-10-22 11:25:56,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1602 to 1600. [2019-10-22 11:25:56,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1600 states. [2019-10-22 11:25:56,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 2291 transitions. [2019-10-22 11:25:56,254 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 2291 transitions. Word has length 153 [2019-10-22 11:25:56,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:56,254 INFO L462 AbstractCegarLoop]: Abstraction has 1600 states and 2291 transitions. [2019-10-22 11:25:56,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:56,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 2291 transitions. [2019-10-22 11:25:56,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-22 11:25:56,256 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:56,256 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:56,257 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:56,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:56,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1707419253, now seen corresponding path program 1 times [2019-10-22 11:25:56,257 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:56,257 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707601721] [2019-10-22 11:25:56,257 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:56,257 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:56,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:56,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:56,347 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-10-22 11:25:56,347 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707601721] [2019-10-22 11:25:56,347 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:56,347 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:25:56,347 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32348439] [2019-10-22 11:25:56,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:56,348 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:56,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:56,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:56,348 INFO L87 Difference]: Start difference. First operand 1600 states and 2291 transitions. Second operand 3 states. [2019-10-22 11:25:56,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:56,479 INFO L93 Difference]: Finished difference Result 4746 states and 6779 transitions. [2019-10-22 11:25:56,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:56,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-10-22 11:25:56,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:56,489 INFO L225 Difference]: With dead ends: 4746 [2019-10-22 11:25:56,489 INFO L226 Difference]: Without dead ends: 3153 [2019-10-22 11:25:56,491 INFO L600 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 [2019-10-22 11:25:56,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3153 states. [2019-10-22 11:25:56,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3153 to 1600. [2019-10-22 11:25:56,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1600 states. [2019-10-22 11:25:56,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 2287 transitions. [2019-10-22 11:25:56,576 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 2287 transitions. Word has length 155 [2019-10-22 11:25:56,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:56,577 INFO L462 AbstractCegarLoop]: Abstraction has 1600 states and 2287 transitions. [2019-10-22 11:25:56,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:56,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 2287 transitions. [2019-10-22 11:25:56,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-22 11:25:56,579 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:56,579 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:56,579 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:56,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:56,580 INFO L82 PathProgramCache]: Analyzing trace with hash 306587411, now seen corresponding path program 1 times [2019-10-22 11:25:56,580 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:56,580 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101307484] [2019-10-22 11:25:56,580 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:56,580 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:56,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:56,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:56,628 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-22 11:25:56,628 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101307484] [2019-10-22 11:25:56,628 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:56,628 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:25:56,628 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775890473] [2019-10-22 11:25:56,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:56,629 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:56,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:56,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:56,629 INFO L87 Difference]: Start difference. First operand 1600 states and 2287 transitions. Second operand 3 states. [2019-10-22 11:25:56,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:56,826 INFO L93 Difference]: Finished difference Result 4786 states and 6839 transitions. [2019-10-22 11:25:56,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:56,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-10-22 11:25:56,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:56,841 INFO L225 Difference]: With dead ends: 4786 [2019-10-22 11:25:56,845 INFO L226 Difference]: Without dead ends: 3193 [2019-10-22 11:25:56,847 INFO L600 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 [2019-10-22 11:25:56,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3193 states. [2019-10-22 11:25:56,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3193 to 3191. [2019-10-22 11:25:56,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3191 states. [2019-10-22 11:25:56,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3191 states to 3191 states and 4487 transitions. [2019-10-22 11:25:56,981 INFO L78 Accepts]: Start accepts. Automaton has 3191 states and 4487 transitions. Word has length 156 [2019-10-22 11:25:56,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:56,982 INFO L462 AbstractCegarLoop]: Abstraction has 3191 states and 4487 transitions. [2019-10-22 11:25:56,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:56,982 INFO L276 IsEmpty]: Start isEmpty. Operand 3191 states and 4487 transitions. [2019-10-22 11:25:56,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-22 11:25:56,985 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:56,985 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:56,985 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:56,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:56,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1260527569, now seen corresponding path program 1 times [2019-10-22 11:25:56,986 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:56,986 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925875899] [2019-10-22 11:25:56,986 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:56,986 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:56,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:57,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:25:57,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:25:57,109 INFO L168 tionRefinementEngine]: Strategy TAIPAN found a feasible trace [2019-10-22 11:25:57,109 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 11:25:57,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:25:57 BoogieIcfgContainer [2019-10-22 11:25:57,177 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:25:57,177 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:25:57,177 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:25:57,177 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:25:57,178 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:25:48" (3/4) ... [2019-10-22 11:25:57,181 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 11:25:57,294 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_8ca7b94c-9059-4f01-8d78-357f73338f59/bin/utaipan/witness.graphml [2019-10-22 11:25:57,294 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:25:57,296 INFO L168 Benchmark]: Toolchain (without parser) took 10425.62 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 369.1 MB). Free memory was 948.5 MB in the beginning and 926.3 MB in the end (delta: 22.3 MB). Peak memory consumption was 391.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:57,296 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:25:57,297 INFO L168 Benchmark]: CACSL2BoogieTranslator took 484.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 948.5 MB in the beginning and 1.1 GB in the end (delta: -172.9 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:57,297 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.38 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:25:57,297 INFO L168 Benchmark]: Boogie Preprocessor took 31.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:57,298 INFO L168 Benchmark]: RCFGBuilder took 944.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 60.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:57,298 INFO L168 Benchmark]: TraceAbstraction took 8770.15 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 235.4 MB). Free memory was 1.1 GB in the beginning and 940.1 MB in the end (delta: 110.6 MB). Peak memory consumption was 346.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:57,298 INFO L168 Benchmark]: Witness Printer took 116.93 ms. Allocated memory is still 1.4 GB. Free memory was 940.1 MB in the beginning and 926.3 MB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:57,300 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 484.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 948.5 MB in the beginning and 1.1 GB in the end (delta: -172.9 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 73.38 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 944.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 60.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8770.15 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 235.4 MB). Free memory was 1.1 GB in the beginning and 940.1 MB in the end (delta: 110.6 MB). Peak memory consumption was 346.0 MB. Max. memory is 11.5 GB. * Witness Printer took 116.93 ms. Allocated memory is still 1.4 GB. Free memory was 940.1 MB in the beginning and 926.3 MB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 698]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L703] int s ; [L704] int tmp ; [L708] s = 8464 [L13] int s__info_callback = __VERIFIER_nondet_int() ; [L14] int s__in_handshake = __VERIFIER_nondet_int() ; [L15] int s__state ; [L16] int s__new_session ; [L17] int s__server ; [L18] int s__version = __VERIFIER_nondet_int() ; [L19] int s__type ; [L20] int s__init_num ; [L21] int s__hit = __VERIFIER_nondet_int() ; [L22] int s__rwstate ; [L23] int s__init_buf___0 = 1; [L24] int s__debug = __VERIFIER_nondet_int() ; [L25] int s__shutdown ; [L26] int s__cert = __VERIFIER_nondet_int() ; [L27] int s__options = __VERIFIER_nondet_int() ; [L28] int s__verify_mode = __VERIFIER_nondet_int() ; [L29] int s__session__peer = __VERIFIER_nondet_int() ; [L30] int s__cert__pkeys__AT0__privatekey = __VERIFIER_nondet_int() ; [L31] int s__ctx__info_callback = __VERIFIER_nondet_int() ; [L32] int s__ctx__stats__sess_accept_renegotiate = __VERIFIER_nondet_int() ; [L33] int s__ctx__stats__sess_accept = __VERIFIER_nondet_int() ; [L34] int s__ctx__stats__sess_accept_good = __VERIFIER_nondet_int() ; [L35] int s__s3__tmp__cert_request ; [L36] int s__s3__tmp__reuse_message ; [L37] int s__s3__tmp__use_rsa_tmp ; [L38] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int() ; [L39] int s__s3__tmp__new_cipher__algorithms ; [L40] int s__s3__tmp__next_state___0 ; [L41] int s__s3__tmp__new_cipher__algo_strength ; [L42] int s__session__cipher ; [L43] int buf ; [L44] unsigned long l ; [L45] unsigned long Time ; [L46] unsigned long tmp ; [L47] int cb ; [L48] long num1 = __VERIFIER_nondet_long() ; [L49] int ret ; [L50] int new_state ; [L51] int state ; [L52] int skip ; [L53] int got_new_session ; [L54] int tmp___1 = __VERIFIER_nondet_int() ; [L55] int tmp___2 = __VERIFIER_nondet_int() ; [L56] int tmp___3 = __VERIFIER_nondet_int() ; [L57] int tmp___4 = __VERIFIER_nondet_int() ; [L58] int tmp___5 = __VERIFIER_nondet_int() ; [L59] int tmp___6 = __VERIFIER_nondet_int() ; [L60] int tmp___7 ; [L61] long tmp___8 = __VERIFIER_nondet_long() ; [L62] int tmp___9 = __VERIFIER_nondet_int() ; [L63] int tmp___10 = __VERIFIER_nondet_int() ; [L64] int blastFlag ; [L65] int __cil_tmp55 ; [L66] unsigned long __cil_tmp56 ; [L67] unsigned long __cil_tmp57 ; [L68] unsigned long __cil_tmp58 ; [L69] unsigned long __cil_tmp59 ; [L70] int __cil_tmp60 ; [L71] unsigned long __cil_tmp61 = __VERIFIER_nondet_ulong() ; [L75] s__state = initial_state [L76] blastFlag = 0 [L77] tmp = __VERIFIER_nondet_int() [L78] Time = tmp [L79] cb = 0 [L80] ret = -1 [L81] skip = 0 [L82] got_new_session = 0 [L83] COND TRUE s__info_callback != 0 [L84] cb = s__info_callback [L90] s__in_handshake ++ [L91] COND FALSE !(tmp___1 + 12288) [L96] COND FALSE !(s__cert == 0) [L100] COND TRUE 1 [L102] state = s__state [L103] COND FALSE !(s__state == 12292) [L106] COND FALSE !(s__state == 16384) [L109] COND FALSE !(s__state == 8192) [L112] COND FALSE !(s__state == 24576) [L115] COND FALSE !(s__state == 8195) [L118] COND FALSE !(s__state == 8480) [L121] COND FALSE !(s__state == 8481) [L124] COND FALSE !(s__state == 8482) [L127] COND TRUE s__state == 8464 [L273] s__shutdown = 0 [L274] ret = __VERIFIER_nondet_int() [L275] COND TRUE blastFlag == 0 [L276] blastFlag = 1 [L278] COND FALSE !(ret <= 0) [L281] got_new_session = 1 [L282] s__state = 8496 [L283] s__init_num = 0 [L652] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L653] COND FALSE !(! s__s3__tmp__reuse_message) [L687] skip = 0 [L100] COND TRUE 1 [L102] state = s__state [L103] COND FALSE !(s__state == 12292) [L106] COND FALSE !(s__state == 16384) [L109] COND FALSE !(s__state == 8192) [L112] COND FALSE !(s__state == 24576) [L115] COND FALSE !(s__state == 8195) [L118] COND FALSE !(s__state == 8480) [L121] COND FALSE !(s__state == 8481) [L124] COND FALSE !(s__state == 8482) [L127] COND FALSE !(s__state == 8464) [L130] COND FALSE !(s__state == 8465) [L133] COND FALSE !(s__state == 8466) [L136] COND TRUE s__state == 8496 [L287] ret = __VERIFIER_nondet_int() [L288] COND TRUE blastFlag == 1 [L289] blastFlag = 2 [L291] COND FALSE !(ret <= 0) [L294] COND FALSE !(\read(s__hit)) [L297] s__state = 8512 [L299] s__init_num = 0 [L652] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L653] COND FALSE !(! s__s3__tmp__reuse_message) [L687] skip = 0 [L100] COND TRUE 1 [L102] state = s__state [L103] COND FALSE !(s__state == 12292) [L106] COND FALSE !(s__state == 16384) [L109] COND FALSE !(s__state == 8192) [L112] COND FALSE !(s__state == 24576) [L115] COND FALSE !(s__state == 8195) [L118] COND FALSE !(s__state == 8480) [L121] COND FALSE !(s__state == 8481) [L124] COND FALSE !(s__state == 8482) [L127] COND FALSE !(s__state == 8464) [L130] COND FALSE !(s__state == 8465) [L133] COND FALSE !(s__state == 8466) [L136] COND FALSE !(s__state == 8496) [L139] COND FALSE !(s__state == 8497) [L142] COND TRUE s__state == 8512 [L304] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L305] __cil_tmp56 = (unsigned long )s__s3__tmp__new_cipher__algorithms [L306] COND TRUE __cil_tmp56 + 256UL [L307] __cil_tmp56 = 256345 [L308] skip = 1 [L319] s__state = 8528 [L320] s__init_num = 0 [L652] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L653] COND FALSE !(! s__s3__tmp__reuse_message) [L687] skip = 0 [L100] COND TRUE 1 [L102] state = s__state [L103] COND FALSE !(s__state == 12292) [L106] COND FALSE !(s__state == 16384) [L109] COND FALSE !(s__state == 8192) [L112] COND FALSE !(s__state == 24576) [L115] COND FALSE !(s__state == 8195) [L118] COND FALSE !(s__state == 8480) [L121] COND FALSE !(s__state == 8481) [L124] COND FALSE !(s__state == 8482) [L127] COND FALSE !(s__state == 8464) [L130] COND FALSE !(s__state == 8465) [L133] COND FALSE !(s__state == 8466) [L136] COND FALSE !(s__state == 8496) [L139] COND FALSE !(s__state == 8497) [L142] COND FALSE !(s__state == 8512) [L145] COND FALSE !(s__state == 8513) [L148] COND TRUE s__state == 8528 [L324] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L325] l = (unsigned long )s__s3__tmp__new_cipher__algorithms [L327] __cil_tmp57 = (unsigned long )s__options [L328] COND TRUE __cil_tmp57 + 2097152UL [L329] s__s3__tmp__use_rsa_tmp = 1 [L334] COND TRUE \read(s__s3__tmp__use_rsa_tmp) [L362] ret = __VERIFIER_nondet_int() [L363] COND FALSE !(blastFlag == 3) [L366] COND FALSE !(ret <= 0) [L383] s__state = 8544 [L384] s__init_num = 0 [L652] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L653] COND FALSE !(! s__s3__tmp__reuse_message) [L687] skip = 0 [L100] COND TRUE 1 [L102] state = s__state [L103] COND FALSE !(s__state == 12292) [L106] COND FALSE !(s__state == 16384) [L109] COND FALSE !(s__state == 8192) [L112] COND FALSE !(s__state == 24576) [L115] COND FALSE !(s__state == 8195) [L118] COND FALSE !(s__state == 8480) [L121] COND FALSE !(s__state == 8481) [L124] COND FALSE !(s__state == 8482) [L127] COND FALSE !(s__state == 8464) [L130] COND FALSE !(s__state == 8465) [L133] COND FALSE !(s__state == 8466) [L136] COND FALSE !(s__state == 8496) [L139] COND FALSE !(s__state == 8497) [L142] COND FALSE !(s__state == 8512) [L145] COND FALSE !(s__state == 8513) [L148] COND FALSE !(s__state == 8528) [L151] COND FALSE !(s__state == 8529) [L154] COND TRUE s__state == 8544 [L388] COND TRUE s__verify_mode + 1 [L389] COND TRUE s__session__peer != 0 [L390] COND TRUE s__verify_mode + 4 [L391] s__verify_mode = 123 [L392] skip = 1 [L393] s__s3__tmp__cert_request = 0 [L394] s__state = 8560 [L652] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L653] COND FALSE !(! s__s3__tmp__reuse_message) [L687] skip = 0 [L100] COND TRUE 1 [L102] state = s__state [L103] COND FALSE !(s__state == 12292) [L106] COND FALSE !(s__state == 16384) [L109] COND FALSE !(s__state == 8192) [L112] COND FALSE !(s__state == 24576) [L115] COND FALSE !(s__state == 8195) [L118] COND FALSE !(s__state == 8480) [L121] COND FALSE !(s__state == 8481) [L124] COND FALSE !(s__state == 8482) [L127] COND FALSE !(s__state == 8464) [L130] COND FALSE !(s__state == 8465) [L133] COND FALSE !(s__state == 8466) [L136] COND FALSE !(s__state == 8496) [L139] COND FALSE !(s__state == 8497) [L142] COND FALSE !(s__state == 8512) [L145] COND FALSE !(s__state == 8513) [L148] COND FALSE !(s__state == 8528) [L151] COND FALSE !(s__state == 8529) [L154] COND FALSE !(s__state == 8544) [L157] COND FALSE !(s__state == 8545) [L160] COND TRUE s__state == 8560 [L438] ret = __VERIFIER_nondet_int() [L439] COND FALSE !(ret <= 0) [L442] s__s3__tmp__next_state___0 = 8576 [L443] s__state = 8448 [L444] s__init_num = 0 [L652] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L653] COND TRUE ! s__s3__tmp__reuse_message [L654] COND TRUE ! skip [L655] COND TRUE state == 8560 [L656] COND TRUE s__state == 8448 [L657] COND TRUE s__verify_mode != -1 [L658] COND TRUE s__verify_mode != -2 [L659] COND TRUE __cil_tmp61 != 9021 [L660] COND TRUE __cil_tmp58 != 4294967294 [L661] COND TRUE blastFlag != 4 [L662] COND TRUE tmp___7 != 1024 [L698] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 166 locations, 1 error locations. Result: UNSAFE, OverallTime: 8.7s, OverallIterations: 35, TraceHistogramMax: 6, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7083 SDtfs, 6887 SDslu, 1778 SDs, 0 SdLazy, 2873 SolverSat, 1350 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3191occurred in iteration=34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 34 MinimizatonAttempts, 2673 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 3181 NumberOfCodeBlocks, 3181 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2991 ConstructedInterpolants, 0 QuantifiedInterpolants, 567746 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 2752/2752 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...