./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi001_tso.opt.i --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/run_dir_4de5414b-0001-4a61-83fc-abfcbc65b08e/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_4de5414b-0001-4a61-83fc-abfcbc65b08e/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4de5414b-0001-4a61-83fc-abfcbc65b08e/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4de5414b-0001-4a61-83fc-abfcbc65b08e/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi001_tso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_4de5414b-0001-4a61-83fc-abfcbc65b08e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4de5414b-0001-4a61-83fc-abfcbc65b08e/bin/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d00f8f74ff25a59ad5e2435307831d3938469c19 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-11-15 22:59:59,938 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:59:59,939 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:59:59,949 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:59:59,950 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:59:59,951 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:59:59,952 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:59:59,954 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:59:59,956 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:59:59,957 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:59:59,958 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:59:59,959 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:59:59,959 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:59:59,960 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:59:59,961 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:59:59,962 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:59:59,963 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:59:59,964 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:59:59,966 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:59:59,968 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:59:59,970 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:59:59,971 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:59:59,972 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:59:59,972 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:59:59,975 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:59:59,975 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:59:59,976 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:59:59,977 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:59:59,977 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:59:59,978 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:59:59,978 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:59:59,979 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:59:59,980 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:59:59,981 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:59:59,982 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:59:59,982 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:59:59,983 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:59:59,983 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:59:59,983 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:59:59,984 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:59:59,985 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:59:59,986 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4de5414b-0001-4a61-83fc-abfcbc65b08e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 22:59:59,998 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:59:59,999 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:00:00,000 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:00:00,000 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:00:00,001 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:00:00,001 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:00:00,001 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:00:00,002 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:00:00,002 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:00:00,002 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:00:00,002 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:00:00,003 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:00:00,003 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:00:00,003 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:00:00,003 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:00:00,004 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:00:00,004 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:00:00,004 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:00:00,004 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:00:00,005 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:00:00,005 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:00:00,005 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:00:00,005 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:00:00,006 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:00:00,006 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:00:00,006 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:00:00,006 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:00:00,007 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:00:00,007 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/run_dir_4de5414b-0001-4a61-83fc-abfcbc65b08e/bin/uautomizer 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 -> Automizer 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 -> d00f8f74ff25a59ad5e2435307831d3938469c19 [2019-11-15 23:00:00,033 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:00:00,044 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:00:00,047 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:00:00,048 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:00:00,049 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:00:00,049 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4de5414b-0001-4a61-83fc-abfcbc65b08e/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/rfi001_tso.opt.i [2019-11-15 23:00:00,103 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4de5414b-0001-4a61-83fc-abfcbc65b08e/bin/uautomizer/data/bb7b94641/1373fd0e645f451e8cf9756b0ec61fd3/FLAGc42f2f7df [2019-11-15 23:00:00,624 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:00:00,625 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4de5414b-0001-4a61-83fc-abfcbc65b08e/sv-benchmarks/c/pthread-wmm/rfi001_tso.opt.i [2019-11-15 23:00:00,644 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4de5414b-0001-4a61-83fc-abfcbc65b08e/bin/uautomizer/data/bb7b94641/1373fd0e645f451e8cf9756b0ec61fd3/FLAGc42f2f7df [2019-11-15 23:00:00,884 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4de5414b-0001-4a61-83fc-abfcbc65b08e/bin/uautomizer/data/bb7b94641/1373fd0e645f451e8cf9756b0ec61fd3 [2019-11-15 23:00:00,886 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:00:00,887 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:00:00,887 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:00:00,888 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:00:00,890 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:00:00,891 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:00:00" (1/1) ... [2019-11-15 23:00:00,894 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bdeb2ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:00:00, skipping insertion in model container [2019-11-15 23:00:00,894 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:00:00" (1/1) ... [2019-11-15 23:00:00,901 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:00:00,942 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:00:01,346 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:00:01,357 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:00:01,443 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:00:01,513 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:00:01,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:00:01 WrapperNode [2019-11-15 23:00:01,514 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:00:01,515 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:00:01,515 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:00:01,515 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:00:01,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:00:01" (1/1) ... [2019-11-15 23:00:01,567 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:00:01" (1/1) ... [2019-11-15 23:00:01,600 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:00:01,601 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:00:01,601 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:00:01,601 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:00:01,610 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:00:01" (1/1) ... [2019-11-15 23:00:01,610 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:00:01" (1/1) ... [2019-11-15 23:00:01,614 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:00:01" (1/1) ... [2019-11-15 23:00:01,615 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:00:01" (1/1) ... [2019-11-15 23:00:01,624 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:00:01" (1/1) ... [2019-11-15 23:00:01,641 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:00:01" (1/1) ... [2019-11-15 23:00:01,644 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:00:01" (1/1) ... [2019-11-15 23:00:01,649 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:00:01,662 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:00:01,662 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:00:01,662 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:00:01,663 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:00:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4de5414b-0001-4a61-83fc-abfcbc65b08e/bin/uautomizer/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-11-15 23:00:01,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:00:01,734 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-15 23:00:01,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:00:01,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:00:01,734 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-15 23:00:01,734 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-15 23:00:01,734 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-15 23:00:01,735 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-15 23:00:01,735 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-15 23:00:01,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:00:01,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:00:01,737 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-15 23:00:02,343 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:00:02,344 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 23:00:02,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:00:02 BoogieIcfgContainer [2019-11-15 23:00:02,345 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:00:02,346 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:00:02,346 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:00:02,349 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:00:02,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:00:00" (1/3) ... [2019-11-15 23:00:02,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21c5e3f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:00:02, skipping insertion in model container [2019-11-15 23:00:02,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:00:01" (2/3) ... [2019-11-15 23:00:02,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21c5e3f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:00:02, skipping insertion in model container [2019-11-15 23:00:02,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:00:02" (3/3) ... [2019-11-15 23:00:02,352 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi001_tso.opt.i [2019-11-15 23:00:02,393 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:00:02,393 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:00:02,394 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:00:02,394 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:00:02,394 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:00:02,394 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:00:02,394 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:00:02,395 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:00:02,395 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:00:02,395 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:00:02,395 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:00:02,396 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:00:02,396 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:00:02,396 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:00:02,396 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:00:02,396 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:00:02,397 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:00:02,397 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:00:02,397 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:00:02,397 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:00:02,397 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:00:02,398 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:00:02,398 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:00:02,398 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:00:02,398 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:00:02,399 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:00:02,399 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:00:02,399 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:00:02,399 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:00:02,400 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:00:02,401 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:00:02,401 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:00:02,401 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:00:02,401 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:00:02,402 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:00:02,402 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:00:02,402 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:00:02,402 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:00:02,403 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:00:02,405 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:00:02,405 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:00:02,406 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:00:02,406 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:00:02,406 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:00:02,406 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:00:02,407 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:00:02,408 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:00:02,408 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:00:02,408 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:00:02,408 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:00:02,409 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:00:02,409 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:00:02,409 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:00:02,409 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:00:02,410 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:00:02,410 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:00:02,411 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:00:02,411 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:00:02,411 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:00:02,411 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:00:02,412 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:00:02,412 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:00:02,412 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:00:02,412 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:00:02,418 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-15 23:00:02,419 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:00:02,430 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-15 23:00:02,440 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-15 23:00:02,460 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:00:02,460 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:00:02,460 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:00:02,460 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:00:02,460 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:00:02,461 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:00:02,461 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:00:02,461 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:00:02,481 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 141 places, 179 transitions [2019-11-15 23:00:04,119 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 22495 states. [2019-11-15 23:00:04,122 INFO L276 IsEmpty]: Start isEmpty. Operand 22495 states. [2019-11-15 23:00:04,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-15 23:00:04,137 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:00:04,139 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] [2019-11-15 23:00:04,143 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:00:04,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:00:04,149 INFO L82 PathProgramCache]: Analyzing trace with hash -697756791, now seen corresponding path program 1 times [2019-11-15 23:00:04,157 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:00:04,158 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991426168] [2019-11-15 23:00:04,158 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:04,158 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:04,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:00:04,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:00:04,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:00:04,486 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991426168] [2019-11-15 23:00:04,487 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:00:04,488 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:00:04,488 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365157134] [2019-11-15 23:00:04,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:00:04,492 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:00:04,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:00:04,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:00:04,509 INFO L87 Difference]: Start difference. First operand 22495 states. Second operand 4 states. [2019-11-15 23:00:05,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:00:05,069 INFO L93 Difference]: Finished difference Result 23447 states and 91748 transitions. [2019-11-15 23:00:05,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:00:05,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-11-15 23:00:05,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:00:05,302 INFO L225 Difference]: With dead ends: 23447 [2019-11-15 23:00:05,302 INFO L226 Difference]: Without dead ends: 21271 [2019-11-15 23:00:05,304 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:00:05,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21271 states. [2019-11-15 23:00:06,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21271 to 21271. [2019-11-15 23:00:06,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21271 states. [2019-11-15 23:00:06,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21271 states to 21271 states and 83772 transitions. [2019-11-15 23:00:06,507 INFO L78 Accepts]: Start accepts. Automaton has 21271 states and 83772 transitions. Word has length 38 [2019-11-15 23:00:06,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:00:06,507 INFO L462 AbstractCegarLoop]: Abstraction has 21271 states and 83772 transitions. [2019-11-15 23:00:06,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:00:06,508 INFO L276 IsEmpty]: Start isEmpty. Operand 21271 states and 83772 transitions. [2019-11-15 23:00:06,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 23:00:06,514 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:00:06,514 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, 1] [2019-11-15 23:00:06,515 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:00:06,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:00:06,515 INFO L82 PathProgramCache]: Analyzing trace with hash 298957026, now seen corresponding path program 1 times [2019-11-15 23:00:06,515 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:00:06,516 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248035531] [2019-11-15 23:00:06,516 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:06,516 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:06,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:00:06,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:00:06,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:00:06,620 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248035531] [2019-11-15 23:00:06,621 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:00:06,621 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:00:06,621 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283668332] [2019-11-15 23:00:06,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:00:06,623 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:00:06,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:00:06,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:00:06,624 INFO L87 Difference]: Start difference. First operand 21271 states and 83772 transitions. Second operand 5 states. [2019-11-15 23:00:07,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:00:07,409 INFO L93 Difference]: Finished difference Result 34705 states and 129064 transitions. [2019-11-15 23:00:07,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:00:07,410 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-15 23:00:07,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:00:07,532 INFO L225 Difference]: With dead ends: 34705 [2019-11-15 23:00:07,532 INFO L226 Difference]: Without dead ends: 34561 [2019-11-15 23:00:07,533 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:00:08,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34561 states. [2019-11-15 23:00:08,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34561 to 33061. [2019-11-15 23:00:08,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33061 states. [2019-11-15 23:00:08,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33061 states to 33061 states and 123952 transitions. [2019-11-15 23:00:08,834 INFO L78 Accepts]: Start accepts. Automaton has 33061 states and 123952 transitions. Word has length 45 [2019-11-15 23:00:08,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:00:08,837 INFO L462 AbstractCegarLoop]: Abstraction has 33061 states and 123952 transitions. [2019-11-15 23:00:08,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:00:08,838 INFO L276 IsEmpty]: Start isEmpty. Operand 33061 states and 123952 transitions. [2019-11-15 23:00:08,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-15 23:00:08,849 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:00:08,849 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, 1, 1] [2019-11-15 23:00:08,849 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:00:08,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:00:08,850 INFO L82 PathProgramCache]: Analyzing trace with hash 528900453, now seen corresponding path program 1 times [2019-11-15 23:00:08,850 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:00:08,851 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684707016] [2019-11-15 23:00:08,851 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:08,851 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:08,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:00:08,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:00:08,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:00:08,977 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684707016] [2019-11-15 23:00:08,977 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:00:08,978 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:00:08,978 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699654625] [2019-11-15 23:00:08,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:00:08,978 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:00:08,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:00:08,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:00:08,979 INFO L87 Difference]: Start difference. First operand 33061 states and 123952 transitions. Second operand 5 states. [2019-11-15 23:00:09,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:00:09,972 INFO L93 Difference]: Finished difference Result 40213 states and 148621 transitions. [2019-11-15 23:00:09,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:00:09,972 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-11-15 23:00:09,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:00:10,115 INFO L225 Difference]: With dead ends: 40213 [2019-11-15 23:00:10,115 INFO L226 Difference]: Without dead ends: 40053 [2019-11-15 23:00:10,116 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:00:10,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40053 states. [2019-11-15 23:00:10,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40053 to 34634. [2019-11-15 23:00:10,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34634 states. [2019-11-15 23:00:10,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34634 states to 34634 states and 129248 transitions. [2019-11-15 23:00:10,995 INFO L78 Accepts]: Start accepts. Automaton has 34634 states and 129248 transitions. Word has length 46 [2019-11-15 23:00:10,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:00:10,995 INFO L462 AbstractCegarLoop]: Abstraction has 34634 states and 129248 transitions. [2019-11-15 23:00:10,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:00:10,996 INFO L276 IsEmpty]: Start isEmpty. Operand 34634 states and 129248 transitions. [2019-11-15 23:00:11,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 23:00:11,007 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:00:11,008 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:00:11,008 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:00:11,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:00:11,009 INFO L82 PathProgramCache]: Analyzing trace with hash 440704446, now seen corresponding path program 1 times [2019-11-15 23:00:11,009 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:00:11,009 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477342993] [2019-11-15 23:00:11,009 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:11,009 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:11,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:00:11,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:00:11,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:00:11,537 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477342993] [2019-11-15 23:00:11,538 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:00:11,538 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:00:11,538 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850378703] [2019-11-15 23:00:11,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:00:11,539 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:00:11,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:00:11,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:00:11,540 INFO L87 Difference]: Start difference. First operand 34634 states and 129248 transitions. Second operand 6 states. [2019-11-15 23:00:12,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:00:12,449 INFO L93 Difference]: Finished difference Result 45662 states and 166142 transitions. [2019-11-15 23:00:12,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 23:00:12,449 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-11-15 23:00:12,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:00:12,574 INFO L225 Difference]: With dead ends: 45662 [2019-11-15 23:00:12,574 INFO L226 Difference]: Without dead ends: 45518 [2019-11-15 23:00:12,575 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-11-15 23:00:12,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45518 states. [2019-11-15 23:00:13,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45518 to 33597. [2019-11-15 23:00:13,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33597 states. [2019-11-15 23:00:13,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33597 states to 33597 states and 125403 transitions. [2019-11-15 23:00:13,437 INFO L78 Accepts]: Start accepts. Automaton has 33597 states and 125403 transitions. Word has length 53 [2019-11-15 23:00:13,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:00:13,437 INFO L462 AbstractCegarLoop]: Abstraction has 33597 states and 125403 transitions. [2019-11-15 23:00:13,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:00:13,438 INFO L276 IsEmpty]: Start isEmpty. Operand 33597 states and 125403 transitions. [2019-11-15 23:00:13,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-15 23:00:13,470 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:00:13,470 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:00:13,471 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:00:13,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:00:13,471 INFO L82 PathProgramCache]: Analyzing trace with hash -2021901069, now seen corresponding path program 1 times [2019-11-15 23:00:13,478 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:00:13,480 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301870461] [2019-11-15 23:00:13,480 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:13,481 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:13,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:00:13,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:00:13,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:00:13,657 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301870461] [2019-11-15 23:00:13,658 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:00:13,658 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:00:13,658 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454970918] [2019-11-15 23:00:13,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:00:13,659 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:00:13,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:00:13,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:00:13,660 INFO L87 Difference]: Start difference. First operand 33597 states and 125403 transitions. Second operand 6 states. [2019-11-15 23:00:14,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:00:14,562 INFO L93 Difference]: Finished difference Result 46069 states and 167836 transitions. [2019-11-15 23:00:14,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 23:00:14,562 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-11-15 23:00:14,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:00:14,650 INFO L225 Difference]: With dead ends: 46069 [2019-11-15 23:00:14,650 INFO L226 Difference]: Without dead ends: 45829 [2019-11-15 23:00:14,651 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:00:14,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45829 states. [2019-11-15 23:00:15,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45829 to 39958. [2019-11-15 23:00:15,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39958 states. [2019-11-15 23:00:15,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39958 states to 39958 states and 147327 transitions. [2019-11-15 23:00:15,396 INFO L78 Accepts]: Start accepts. Automaton has 39958 states and 147327 transitions. Word has length 60 [2019-11-15 23:00:15,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:00:15,396 INFO L462 AbstractCegarLoop]: Abstraction has 39958 states and 147327 transitions. [2019-11-15 23:00:15,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:00:15,396 INFO L276 IsEmpty]: Start isEmpty. Operand 39958 states and 147327 transitions. [2019-11-15 23:00:15,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-15 23:00:15,427 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:00:15,428 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:00:15,428 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:00:15,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:00:15,428 INFO L82 PathProgramCache]: Analyzing trace with hash -481942333, now seen corresponding path program 1 times [2019-11-15 23:00:15,428 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:00:15,429 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982464298] [2019-11-15 23:00:15,429 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:15,429 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:15,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:00:15,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:00:15,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:00:15,472 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982464298] [2019-11-15 23:00:15,472 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:00:15,472 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:00:15,472 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59366028] [2019-11-15 23:00:15,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:00:15,473 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:00:15,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:00:15,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:00:15,473 INFO L87 Difference]: Start difference. First operand 39958 states and 147327 transitions. Second operand 3 states. [2019-11-15 23:00:15,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:00:15,734 INFO L93 Difference]: Finished difference Result 50256 states and 182162 transitions. [2019-11-15 23:00:15,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:00:15,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-11-15 23:00:15,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:00:15,855 INFO L225 Difference]: With dead ends: 50256 [2019-11-15 23:00:15,855 INFO L226 Difference]: Without dead ends: 50256 [2019-11-15 23:00:15,855 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-11-15 23:00:16,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50256 states. [2019-11-15 23:00:16,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50256 to 43888. [2019-11-15 23:00:16,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43888 states. [2019-11-15 23:00:17,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43888 states to 43888 states and 160765 transitions. [2019-11-15 23:00:17,033 INFO L78 Accepts]: Start accepts. Automaton has 43888 states and 160765 transitions. Word has length 62 [2019-11-15 23:00:17,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:00:17,033 INFO L462 AbstractCegarLoop]: Abstraction has 43888 states and 160765 transitions. [2019-11-15 23:00:17,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:00:17,033 INFO L276 IsEmpty]: Start isEmpty. Operand 43888 states and 160765 transitions. [2019-11-15 23:00:17,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 23:00:17,067 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:00:17,068 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:00:17,068 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:00:17,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:00:17,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1024024957, now seen corresponding path program 1 times [2019-11-15 23:00:17,068 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:00:17,068 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201970197] [2019-11-15 23:00:17,069 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:17,069 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:17,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:00:17,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:00:17,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:00:17,162 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201970197] [2019-11-15 23:00:17,162 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:00:17,162 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:00:17,162 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389420099] [2019-11-15 23:00:17,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:00:17,163 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:00:17,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:00:17,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:00:17,164 INFO L87 Difference]: Start difference. First operand 43888 states and 160765 transitions. Second operand 7 states. [2019-11-15 23:00:18,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:00:18,047 INFO L93 Difference]: Finished difference Result 55884 states and 200499 transitions. [2019-11-15 23:00:18,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 23:00:18,047 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-11-15 23:00:18,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:00:18,163 INFO L225 Difference]: With dead ends: 55884 [2019-11-15 23:00:18,164 INFO L226 Difference]: Without dead ends: 55644 [2019-11-15 23:00:18,164 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-11-15 23:00:18,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55644 states. [2019-11-15 23:00:18,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55644 to 45114. [2019-11-15 23:00:18,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45114 states. [2019-11-15 23:00:19,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45114 states to 45114 states and 164932 transitions. [2019-11-15 23:00:19,621 INFO L78 Accepts]: Start accepts. Automaton has 45114 states and 164932 transitions. Word has length 66 [2019-11-15 23:00:19,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:00:19,621 INFO L462 AbstractCegarLoop]: Abstraction has 45114 states and 164932 transitions. [2019-11-15 23:00:19,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:00:19,622 INFO L276 IsEmpty]: Start isEmpty. Operand 45114 states and 164932 transitions. [2019-11-15 23:00:19,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 23:00:19,655 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:00:19,655 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:00:19,655 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:00:19,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:00:19,656 INFO L82 PathProgramCache]: Analyzing trace with hash -2014746228, now seen corresponding path program 1 times [2019-11-15 23:00:19,656 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:00:19,656 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325263244] [2019-11-15 23:00:19,656 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:19,657 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:19,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:00:19,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:00:19,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:00:19,749 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325263244] [2019-11-15 23:00:19,749 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:00:19,749 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:00:19,750 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990372167] [2019-11-15 23:00:19,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:00:19,751 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:00:19,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:00:19,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:00:19,751 INFO L87 Difference]: Start difference. First operand 45114 states and 164932 transitions. Second operand 7 states. [2019-11-15 23:00:20,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:00:20,814 INFO L93 Difference]: Finished difference Result 55098 states and 197676 transitions. [2019-11-15 23:00:20,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 23:00:20,815 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-11-15 23:00:20,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:00:20,927 INFO L225 Difference]: With dead ends: 55098 [2019-11-15 23:00:20,928 INFO L226 Difference]: Without dead ends: 54898 [2019-11-15 23:00:20,928 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2019-11-15 23:00:21,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54898 states. [2019-11-15 23:00:21,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54898 to 45992. [2019-11-15 23:00:21,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45992 states. [2019-11-15 23:00:21,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45992 states to 45992 states and 167803 transitions. [2019-11-15 23:00:21,767 INFO L78 Accepts]: Start accepts. Automaton has 45992 states and 167803 transitions. Word has length 67 [2019-11-15 23:00:21,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:00:21,767 INFO L462 AbstractCegarLoop]: Abstraction has 45992 states and 167803 transitions. [2019-11-15 23:00:21,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:00:21,767 INFO L276 IsEmpty]: Start isEmpty. Operand 45992 states and 167803 transitions. [2019-11-15 23:00:21,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-15 23:00:21,798 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:00:21,798 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, 1, 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-11-15 23:00:21,799 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:00:21,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:00:21,799 INFO L82 PathProgramCache]: Analyzing trace with hash 883100043, now seen corresponding path program 1 times [2019-11-15 23:00:21,799 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:00:21,800 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626691980] [2019-11-15 23:00:21,800 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:21,800 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:21,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:00:21,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:00:21,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-11-15 23:00:21,874 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626691980] [2019-11-15 23:00:21,874 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:00:21,874 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:00:21,874 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429996609] [2019-11-15 23:00:21,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:00:21,875 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:00:21,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:00:21,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:00:21,875 INFO L87 Difference]: Start difference. First operand 45992 states and 167803 transitions. Second operand 3 states. [2019-11-15 23:00:22,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:00:22,259 INFO L93 Difference]: Finished difference Result 61486 states and 224137 transitions. [2019-11-15 23:00:22,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:00:22,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-11-15 23:00:22,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:00:22,385 INFO L225 Difference]: With dead ends: 61486 [2019-11-15 23:00:22,385 INFO L226 Difference]: Without dead ends: 61486 [2019-11-15 23:00:22,385 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-11-15 23:00:23,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61486 states. [2019-11-15 23:00:23,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61486 to 53433. [2019-11-15 23:00:23,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53433 states. [2019-11-15 23:00:23,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53433 states to 53433 states and 195616 transitions. [2019-11-15 23:00:23,990 INFO L78 Accepts]: Start accepts. Automaton has 53433 states and 195616 transitions. Word has length 69 [2019-11-15 23:00:23,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:00:23,990 INFO L462 AbstractCegarLoop]: Abstraction has 53433 states and 195616 transitions. [2019-11-15 23:00:23,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:00:23,991 INFO L276 IsEmpty]: Start isEmpty. Operand 53433 states and 195616 transitions. [2019-11-15 23:00:24,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-15 23:00:24,035 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:00:24,035 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, 1, 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-11-15 23:00:24,036 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:00:24,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:00:24,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1887210997, now seen corresponding path program 1 times [2019-11-15 23:00:24,036 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:00:24,036 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837361398] [2019-11-15 23:00:24,037 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:24,037 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:24,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:00:24,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:00:24,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:00:24,162 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837361398] [2019-11-15 23:00:24,163 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:00:24,163 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:00:24,163 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855663469] [2019-11-15 23:00:24,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:00:24,164 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:00:24,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:00:24,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:00:24,165 INFO L87 Difference]: Start difference. First operand 53433 states and 195616 transitions. Second operand 6 states. [2019-11-15 23:00:24,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:00:24,788 INFO L93 Difference]: Finished difference Result 65982 states and 238830 transitions. [2019-11-15 23:00:24,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:00:24,789 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-11-15 23:00:24,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:00:24,923 INFO L225 Difference]: With dead ends: 65982 [2019-11-15 23:00:24,924 INFO L226 Difference]: Without dead ends: 65338 [2019-11-15 23:00:24,924 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:00:25,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65338 states. [2019-11-15 23:00:25,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65338 to 56042. [2019-11-15 23:00:25,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56042 states. [2019-11-15 23:00:25,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56042 states to 56042 states and 204333 transitions. [2019-11-15 23:00:25,951 INFO L78 Accepts]: Start accepts. Automaton has 56042 states and 204333 transitions. Word has length 69 [2019-11-15 23:00:25,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:00:25,951 INFO L462 AbstractCegarLoop]: Abstraction has 56042 states and 204333 transitions. [2019-11-15 23:00:25,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:00:25,951 INFO L276 IsEmpty]: Start isEmpty. Operand 56042 states and 204333 transitions. [2019-11-15 23:00:26,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-15 23:00:26,002 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:00:26,002 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, 1, 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-11-15 23:00:26,002 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:00:26,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:00:26,002 INFO L82 PathProgramCache]: Analyzing trace with hash -925596980, now seen corresponding path program 1 times [2019-11-15 23:00:26,002 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:00:26,003 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977113306] [2019-11-15 23:00:26,003 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:26,003 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:26,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:00:26,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:00:26,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:00:26,125 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977113306] [2019-11-15 23:00:26,125 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:00:26,126 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:00:26,126 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746124254] [2019-11-15 23:00:26,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:00:26,127 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:00:26,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:00:26,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:00:26,127 INFO L87 Difference]: Start difference. First operand 56042 states and 204333 transitions. Second operand 7 states. [2019-11-15 23:00:27,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:00:27,790 INFO L93 Difference]: Finished difference Result 83030 states and 292761 transitions. [2019-11-15 23:00:27,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:00:27,791 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2019-11-15 23:00:27,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:00:27,987 INFO L225 Difference]: With dead ends: 83030 [2019-11-15 23:00:27,987 INFO L226 Difference]: Without dead ends: 83030 [2019-11-15 23:00:27,988 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:00:28,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83030 states. [2019-11-15 23:00:29,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83030 to 76079. [2019-11-15 23:00:29,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76079 states. [2019-11-15 23:00:29,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76079 states to 76079 states and 270628 transitions. [2019-11-15 23:00:29,432 INFO L78 Accepts]: Start accepts. Automaton has 76079 states and 270628 transitions. Word has length 69 [2019-11-15 23:00:29,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:00:29,432 INFO L462 AbstractCegarLoop]: Abstraction has 76079 states and 270628 transitions. [2019-11-15 23:00:29,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:00:29,432 INFO L276 IsEmpty]: Start isEmpty. Operand 76079 states and 270628 transitions. [2019-11-15 23:00:29,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-15 23:00:29,493 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:00:29,493 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, 1, 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-11-15 23:00:29,494 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:00:29,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:00:29,494 INFO L82 PathProgramCache]: Analyzing trace with hash 319167501, now seen corresponding path program 1 times [2019-11-15 23:00:29,494 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:00:29,494 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937093373] [2019-11-15 23:00:29,494 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:29,494 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:29,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:00:29,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:00:29,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:00:29,549 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937093373] [2019-11-15 23:00:29,550 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:00:29,550 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:00:29,550 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643099260] [2019-11-15 23:00:29,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:00:29,551 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:00:29,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:00:29,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:00:29,552 INFO L87 Difference]: Start difference. First operand 76079 states and 270628 transitions. Second operand 3 states. [2019-11-15 23:00:29,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:00:29,862 INFO L93 Difference]: Finished difference Result 54415 states and 197409 transitions. [2019-11-15 23:00:29,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:00:29,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-11-15 23:00:29,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:00:29,979 INFO L225 Difference]: With dead ends: 54415 [2019-11-15 23:00:29,979 INFO L226 Difference]: Without dead ends: 54253 [2019-11-15 23:00:29,979 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:00:30,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54253 states. [2019-11-15 23:00:30,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54253 to 54213. [2019-11-15 23:00:30,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54213 states. [2019-11-15 23:00:30,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54213 states to 54213 states and 196824 transitions. [2019-11-15 23:00:30,879 INFO L78 Accepts]: Start accepts. Automaton has 54213 states and 196824 transitions. Word has length 69 [2019-11-15 23:00:30,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:00:30,879 INFO L462 AbstractCegarLoop]: Abstraction has 54213 states and 196824 transitions. [2019-11-15 23:00:30,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:00:30,879 INFO L276 IsEmpty]: Start isEmpty. Operand 54213 states and 196824 transitions. [2019-11-15 23:00:30,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-15 23:00:30,915 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:00:30,915 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, 1, 1, 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-11-15 23:00:30,915 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:00:30,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:00:30,916 INFO L82 PathProgramCache]: Analyzing trace with hash 871106303, now seen corresponding path program 1 times [2019-11-15 23:00:30,916 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:00:30,916 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286273001] [2019-11-15 23:00:30,916 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:30,916 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:30,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:00:30,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:00:30,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:00:30,999 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286273001] [2019-11-15 23:00:30,999 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:00:30,999 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:00:30,999 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657533299] [2019-11-15 23:00:30,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:00:30,999 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:00:31,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:00:31,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:00:31,000 INFO L87 Difference]: Start difference. First operand 54213 states and 196824 transitions. Second operand 5 states. [2019-11-15 23:00:31,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:00:31,890 INFO L93 Difference]: Finished difference Result 84428 states and 303656 transitions. [2019-11-15 23:00:31,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:00:31,891 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-11-15 23:00:31,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:00:32,052 INFO L225 Difference]: With dead ends: 84428 [2019-11-15 23:00:32,052 INFO L226 Difference]: Without dead ends: 84232 [2019-11-15 23:00:32,053 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:00:32,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84232 states. [2019-11-15 23:00:33,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84232 to 76147. [2019-11-15 23:00:33,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76147 states. [2019-11-15 23:00:33,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76147 states to 76147 states and 275544 transitions. [2019-11-15 23:00:33,410 INFO L78 Accepts]: Start accepts. Automaton has 76147 states and 275544 transitions. Word has length 70 [2019-11-15 23:00:33,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:00:33,411 INFO L462 AbstractCegarLoop]: Abstraction has 76147 states and 275544 transitions. [2019-11-15 23:00:33,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:00:33,411 INFO L276 IsEmpty]: Start isEmpty. Operand 76147 states and 275544 transitions. [2019-11-15 23:00:33,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-15 23:00:33,469 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:00:33,469 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, 1, 1, 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-11-15 23:00:33,469 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:00:33,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:00:33,470 INFO L82 PathProgramCache]: Analyzing trace with hash 2115870784, now seen corresponding path program 1 times [2019-11-15 23:00:33,470 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:00:33,470 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788282028] [2019-11-15 23:00:33,470 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:33,470 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:33,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:00:33,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:00:33,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:00:33,566 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788282028] [2019-11-15 23:00:33,566 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:00:33,567 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:00:33,567 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152970744] [2019-11-15 23:00:33,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:00:33,567 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:00:33,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:00:33,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:00:33,568 INFO L87 Difference]: Start difference. First operand 76147 states and 275544 transitions. Second operand 5 states. [2019-11-15 23:00:33,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:00:33,691 INFO L93 Difference]: Finished difference Result 19615 states and 62265 transitions. [2019-11-15 23:00:33,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:00:33,691 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-11-15 23:00:33,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:00:33,729 INFO L225 Difference]: With dead ends: 19615 [2019-11-15 23:00:33,729 INFO L226 Difference]: Without dead ends: 19137 [2019-11-15 23:00:33,730 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:00:33,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19137 states. [2019-11-15 23:00:34,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19137 to 19125. [2019-11-15 23:00:34,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19125 states. [2019-11-15 23:00:34,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19125 states to 19125 states and 60760 transitions. [2019-11-15 23:00:34,062 INFO L78 Accepts]: Start accepts. Automaton has 19125 states and 60760 transitions. Word has length 70 [2019-11-15 23:00:34,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:00:34,063 INFO L462 AbstractCegarLoop]: Abstraction has 19125 states and 60760 transitions. [2019-11-15 23:00:34,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:00:34,063 INFO L276 IsEmpty]: Start isEmpty. Operand 19125 states and 60760 transitions. [2019-11-15 23:00:34,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-15 23:00:34,083 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:00:34,083 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-15 23:00:34,083 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:00:34,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:00:34,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1855900557, now seen corresponding path program 1 times [2019-11-15 23:00:34,084 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:00:34,084 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669417100] [2019-11-15 23:00:34,084 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:34,084 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:34,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:00:34,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:00:34,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:00:34,165 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669417100] [2019-11-15 23:00:34,166 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:00:34,166 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:00:34,166 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870925810] [2019-11-15 23:00:34,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:00:34,167 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:00:34,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:00:34,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:00:34,167 INFO L87 Difference]: Start difference. First operand 19125 states and 60760 transitions. Second operand 4 states. [2019-11-15 23:00:34,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:00:34,422 INFO L93 Difference]: Finished difference Result 24075 states and 75428 transitions. [2019-11-15 23:00:34,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:00:34,422 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-11-15 23:00:34,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:00:34,453 INFO L225 Difference]: With dead ends: 24075 [2019-11-15 23:00:34,453 INFO L226 Difference]: Without dead ends: 24075 [2019-11-15 23:00:34,453 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:00:34,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24075 states. [2019-11-15 23:00:34,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24075 to 19965. [2019-11-15 23:00:34,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19965 states. [2019-11-15 23:00:34,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19965 states to 19965 states and 63127 transitions. [2019-11-15 23:00:34,723 INFO L78 Accepts]: Start accepts. Automaton has 19965 states and 63127 transitions. Word has length 79 [2019-11-15 23:00:34,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:00:34,723 INFO L462 AbstractCegarLoop]: Abstraction has 19965 states and 63127 transitions. [2019-11-15 23:00:34,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:00:34,724 INFO L276 IsEmpty]: Start isEmpty. Operand 19965 states and 63127 transitions. [2019-11-15 23:00:34,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-15 23:00:34,737 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:00:34,737 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-15 23:00:34,738 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:00:34,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:00:34,738 INFO L82 PathProgramCache]: Analyzing trace with hash -2110637102, now seen corresponding path program 1 times [2019-11-15 23:00:34,738 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:00:34,739 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115139355] [2019-11-15 23:00:34,739 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:34,739 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:34,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:00:34,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:00:34,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:00:34,839 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115139355] [2019-11-15 23:00:34,839 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:00:34,839 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 23:00:34,839 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086464429] [2019-11-15 23:00:34,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:00:34,840 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:00:34,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:00:34,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:00:34,841 INFO L87 Difference]: Start difference. First operand 19965 states and 63127 transitions. Second operand 8 states. [2019-11-15 23:00:35,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:00:35,704 INFO L93 Difference]: Finished difference Result 22071 states and 69319 transitions. [2019-11-15 23:00:35,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-15 23:00:35,705 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 79 [2019-11-15 23:00:35,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:00:35,731 INFO L225 Difference]: With dead ends: 22071 [2019-11-15 23:00:35,731 INFO L226 Difference]: Without dead ends: 22023 [2019-11-15 23:00:35,732 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2019-11-15 23:00:35,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22023 states. [2019-11-15 23:00:35,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22023 to 19437. [2019-11-15 23:00:35,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19437 states. [2019-11-15 23:00:35,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19437 states to 19437 states and 61629 transitions. [2019-11-15 23:00:35,994 INFO L78 Accepts]: Start accepts. Automaton has 19437 states and 61629 transitions. Word has length 79 [2019-11-15 23:00:35,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:00:35,994 INFO L462 AbstractCegarLoop]: Abstraction has 19437 states and 61629 transitions. [2019-11-15 23:00:35,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:00:35,995 INFO L276 IsEmpty]: Start isEmpty. Operand 19437 states and 61629 transitions. [2019-11-15 23:00:36,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-15 23:00:36,015 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:00:36,015 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-15 23:00:36,015 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:00:36,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:00:36,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1015310952, now seen corresponding path program 1 times [2019-11-15 23:00:36,016 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:00:36,016 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610790768] [2019-11-15 23:00:36,016 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:36,016 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:36,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:00:36,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:00:36,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:00:36,120 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610790768] [2019-11-15 23:00:36,120 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:00:36,120 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 23:00:36,120 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965092912] [2019-11-15 23:00:36,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:00:36,121 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:00:36,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:00:36,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:00:36,121 INFO L87 Difference]: Start difference. First operand 19437 states and 61629 transitions. Second operand 8 states. [2019-11-15 23:00:38,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:00:38,211 INFO L93 Difference]: Finished difference Result 50431 states and 153647 transitions. [2019-11-15 23:00:38,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-15 23:00:38,211 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2019-11-15 23:00:38,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:00:38,290 INFO L225 Difference]: With dead ends: 50431 [2019-11-15 23:00:38,291 INFO L226 Difference]: Without dead ends: 49732 [2019-11-15 23:00:38,291 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2019-11-15 23:00:38,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49732 states. [2019-11-15 23:00:39,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49732 to 29965. [2019-11-15 23:00:39,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29965 states. [2019-11-15 23:00:39,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29965 states to 29965 states and 93559 transitions. [2019-11-15 23:00:39,060 INFO L78 Accepts]: Start accepts. Automaton has 29965 states and 93559 transitions. Word has length 82 [2019-11-15 23:00:39,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:00:39,060 INFO L462 AbstractCegarLoop]: Abstraction has 29965 states and 93559 transitions. [2019-11-15 23:00:39,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:00:39,061 INFO L276 IsEmpty]: Start isEmpty. Operand 29965 states and 93559 transitions. [2019-11-15 23:00:39,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-15 23:00:39,090 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:00:39,091 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-15 23:00:39,091 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:00:39,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:00:39,091 INFO L82 PathProgramCache]: Analyzing trace with hash -53696935, now seen corresponding path program 1 times [2019-11-15 23:00:39,091 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:00:39,091 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133962942] [2019-11-15 23:00:39,091 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:39,092 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:39,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:00:39,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:00:39,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:00:39,195 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133962942] [2019-11-15 23:00:39,195 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:00:39,196 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:00:39,196 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436473180] [2019-11-15 23:00:39,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:00:39,196 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:00:39,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:00:39,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:00:39,197 INFO L87 Difference]: Start difference. First operand 29965 states and 93559 transitions. Second operand 6 states. [2019-11-15 23:00:39,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:00:39,648 INFO L93 Difference]: Finished difference Result 31403 states and 97496 transitions. [2019-11-15 23:00:39,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:00:39,648 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-11-15 23:00:39,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:00:39,689 INFO L225 Difference]: With dead ends: 31403 [2019-11-15 23:00:39,689 INFO L226 Difference]: Without dead ends: 31403 [2019-11-15 23:00:39,689 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:00:39,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31403 states. [2019-11-15 23:00:40,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31403 to 29634. [2019-11-15 23:00:40,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29634 states. [2019-11-15 23:00:40,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29634 states to 29634 states and 92402 transitions. [2019-11-15 23:00:40,069 INFO L78 Accepts]: Start accepts. Automaton has 29634 states and 92402 transitions. Word has length 82 [2019-11-15 23:00:40,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:00:40,070 INFO L462 AbstractCegarLoop]: Abstraction has 29634 states and 92402 transitions. [2019-11-15 23:00:40,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:00:40,070 INFO L276 IsEmpty]: Start isEmpty. Operand 29634 states and 92402 transitions. [2019-11-15 23:00:40,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-15 23:00:40,093 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:00:40,093 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-15 23:00:40,094 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:00:40,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:00:40,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1989357222, now seen corresponding path program 1 times [2019-11-15 23:00:40,094 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:00:40,094 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988806192] [2019-11-15 23:00:40,094 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:40,094 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:40,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:00:40,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:00:40,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:00:40,195 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988806192] [2019-11-15 23:00:40,196 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:00:40,196 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:00:40,196 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783642104] [2019-11-15 23:00:40,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:00:40,197 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:00:40,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:00:40,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:00:40,197 INFO L87 Difference]: Start difference. First operand 29634 states and 92402 transitions. Second operand 7 states. [2019-11-15 23:00:40,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:00:40,826 INFO L93 Difference]: Finished difference Result 31148 states and 96558 transitions. [2019-11-15 23:00:40,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:00:40,827 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2019-11-15 23:00:40,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:00:40,868 INFO L225 Difference]: With dead ends: 31148 [2019-11-15 23:00:40,868 INFO L226 Difference]: Without dead ends: 31148 [2019-11-15 23:00:40,868 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:00:40,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31148 states. [2019-11-15 23:00:41,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31148 to 29966. [2019-11-15 23:00:41,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29966 states. [2019-11-15 23:00:41,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29966 states to 29966 states and 93233 transitions. [2019-11-15 23:00:41,238 INFO L78 Accepts]: Start accepts. Automaton has 29966 states and 93233 transitions. Word has length 82 [2019-11-15 23:00:41,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:00:41,238 INFO L462 AbstractCegarLoop]: Abstraction has 29966 states and 93233 transitions. [2019-11-15 23:00:41,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:00:41,238 INFO L276 IsEmpty]: Start isEmpty. Operand 29966 states and 93233 transitions. [2019-11-15 23:00:41,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-15 23:00:41,264 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:00:41,265 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-15 23:00:41,265 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:00:41,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:00:41,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1659591461, now seen corresponding path program 1 times [2019-11-15 23:00:41,265 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:00:41,265 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882500415] [2019-11-15 23:00:41,266 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:41,266 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:41,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:00:41,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:00:41,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:00:41,316 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882500415] [2019-11-15 23:00:41,317 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:00:41,317 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:00:41,317 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473048219] [2019-11-15 23:00:41,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:00:41,318 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:00:41,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:00:41,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:00:41,318 INFO L87 Difference]: Start difference. First operand 29966 states and 93233 transitions. Second operand 3 states. [2019-11-15 23:00:41,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:00:41,415 INFO L93 Difference]: Finished difference Result 21487 states and 66270 transitions. [2019-11-15 23:00:41,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:00:41,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-11-15 23:00:41,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:00:41,454 INFO L225 Difference]: With dead ends: 21487 [2019-11-15 23:00:41,454 INFO L226 Difference]: Without dead ends: 21487 [2019-11-15 23:00:41,454 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:00:41,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21487 states. [2019-11-15 23:00:41,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21487 to 21164. [2019-11-15 23:00:41,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21164 states. [2019-11-15 23:00:41,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21164 states to 21164 states and 65321 transitions. [2019-11-15 23:00:41,797 INFO L78 Accepts]: Start accepts. Automaton has 21164 states and 65321 transitions. Word has length 82 [2019-11-15 23:00:41,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:00:41,797 INFO L462 AbstractCegarLoop]: Abstraction has 21164 states and 65321 transitions. [2019-11-15 23:00:41,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:00:41,798 INFO L276 IsEmpty]: Start isEmpty. Operand 21164 states and 65321 transitions. [2019-11-15 23:00:41,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-15 23:00:41,820 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:00:41,820 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-15 23:00:41,821 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:00:41,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:00:41,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1372218890, now seen corresponding path program 1 times [2019-11-15 23:00:41,821 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:00:41,822 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187484300] [2019-11-15 23:00:41,822 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:41,822 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:41,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:00:41,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:00:41,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:00:41,903 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187484300] [2019-11-15 23:00:41,903 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:00:41,903 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:00:41,904 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126742956] [2019-11-15 23:00:41,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:00:41,904 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:00:41,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:00:41,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:00:41,907 INFO L87 Difference]: Start difference. First operand 21164 states and 65321 transitions. Second operand 6 states. [2019-11-15 23:00:42,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:00:42,272 INFO L93 Difference]: Finished difference Result 37344 states and 115064 transitions. [2019-11-15 23:00:42,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:00:42,272 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-11-15 23:00:42,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:00:42,325 INFO L225 Difference]: With dead ends: 37344 [2019-11-15 23:00:42,325 INFO L226 Difference]: Without dead ends: 37344 [2019-11-15 23:00:42,325 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:00:42,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37344 states. [2019-11-15 23:00:42,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37344 to 23234. [2019-11-15 23:00:42,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23234 states. [2019-11-15 23:00:42,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23234 states to 23234 states and 71275 transitions. [2019-11-15 23:00:42,713 INFO L78 Accepts]: Start accepts. Automaton has 23234 states and 71275 transitions. Word has length 83 [2019-11-15 23:00:42,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:00:42,713 INFO L462 AbstractCegarLoop]: Abstraction has 23234 states and 71275 transitions. [2019-11-15 23:00:42,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:00:42,713 INFO L276 IsEmpty]: Start isEmpty. Operand 23234 states and 71275 transitions. [2019-11-15 23:00:42,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-15 23:00:42,732 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:00:42,732 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-15 23:00:42,732 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:00:42,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:00:42,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1042453129, now seen corresponding path program 1 times [2019-11-15 23:00:42,733 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:00:42,733 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638304799] [2019-11-15 23:00:42,733 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:42,733 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:42,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:00:42,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:00:42,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:00:42,799 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638304799] [2019-11-15 23:00:42,799 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:00:42,799 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:00:42,799 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211904484] [2019-11-15 23:00:42,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:00:42,800 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:00:42,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:00:42,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:00:42,800 INFO L87 Difference]: Start difference. First operand 23234 states and 71275 transitions. Second operand 5 states. [2019-11-15 23:00:42,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:00:42,846 INFO L93 Difference]: Finished difference Result 3104 states and 7662 transitions. [2019-11-15 23:00:42,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:00:42,846 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-11-15 23:00:42,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:00:42,849 INFO L225 Difference]: With dead ends: 3104 [2019-11-15 23:00:42,849 INFO L226 Difference]: Without dead ends: 2718 [2019-11-15 23:00:42,850 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:00:42,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2718 states. [2019-11-15 23:00:42,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2718 to 2566. [2019-11-15 23:00:42,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2566 states. [2019-11-15 23:00:42,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2566 states to 2566 states and 6342 transitions. [2019-11-15 23:00:42,883 INFO L78 Accepts]: Start accepts. Automaton has 2566 states and 6342 transitions. Word has length 83 [2019-11-15 23:00:42,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:00:42,883 INFO L462 AbstractCegarLoop]: Abstraction has 2566 states and 6342 transitions. [2019-11-15 23:00:42,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:00:42,884 INFO L276 IsEmpty]: Start isEmpty. Operand 2566 states and 6342 transitions. [2019-11-15 23:00:42,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 23:00:42,887 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:00:42,887 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-15 23:00:42,887 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:00:42,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:00:42,888 INFO L82 PathProgramCache]: Analyzing trace with hash -179745300, now seen corresponding path program 1 times [2019-11-15 23:00:42,888 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:00:42,888 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822959335] [2019-11-15 23:00:42,888 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:42,888 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:42,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:00:42,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:00:43,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:00:43,023 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822959335] [2019-11-15 23:00:43,023 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:00:43,023 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:00:43,023 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826550556] [2019-11-15 23:00:43,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:00:43,024 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:00:43,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:00:43,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:00:43,025 INFO L87 Difference]: Start difference. First operand 2566 states and 6342 transitions. Second operand 6 states. [2019-11-15 23:00:43,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:00:43,202 INFO L93 Difference]: Finished difference Result 2544 states and 6297 transitions. [2019-11-15 23:00:43,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:00:43,202 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-11-15 23:00:43,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:00:43,204 INFO L225 Difference]: With dead ends: 2544 [2019-11-15 23:00:43,204 INFO L226 Difference]: Without dead ends: 2544 [2019-11-15 23:00:43,205 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:00:43,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2544 states. [2019-11-15 23:00:43,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2544 to 2446. [2019-11-15 23:00:43,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2446 states. [2019-11-15 23:00:43,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2446 states to 2446 states and 6054 transitions. [2019-11-15 23:00:43,227 INFO L78 Accepts]: Start accepts. Automaton has 2446 states and 6054 transitions. Word has length 96 [2019-11-15 23:00:43,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:00:43,228 INFO L462 AbstractCegarLoop]: Abstraction has 2446 states and 6054 transitions. [2019-11-15 23:00:43,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:00:43,228 INFO L276 IsEmpty]: Start isEmpty. Operand 2446 states and 6054 transitions. [2019-11-15 23:00:43,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 23:00:43,231 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:00:43,231 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-15 23:00:43,231 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:00:43,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:00:43,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1458300365, now seen corresponding path program 1 times [2019-11-15 23:00:43,232 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:00:43,233 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700512993] [2019-11-15 23:00:43,233 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:43,233 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:43,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:00:43,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:00:43,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:00:43,290 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700512993] [2019-11-15 23:00:43,291 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:00:43,291 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:00:43,291 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027604676] [2019-11-15 23:00:43,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:00:43,292 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:00:43,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:00:43,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:00:43,293 INFO L87 Difference]: Start difference. First operand 2446 states and 6054 transitions. Second operand 4 states. [2019-11-15 23:00:43,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:00:43,413 INFO L93 Difference]: Finished difference Result 2810 states and 6865 transitions. [2019-11-15 23:00:43,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:00:43,413 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-15 23:00:43,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:00:43,416 INFO L225 Difference]: With dead ends: 2810 [2019-11-15 23:00:43,416 INFO L226 Difference]: Without dead ends: 2810 [2019-11-15 23:00:43,417 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:00:43,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2810 states. [2019-11-15 23:00:43,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2810 to 2534. [2019-11-15 23:00:43,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2534 states. [2019-11-15 23:00:43,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2534 states to 2534 states and 6250 transitions. [2019-11-15 23:00:43,451 INFO L78 Accepts]: Start accepts. Automaton has 2534 states and 6250 transitions. Word has length 96 [2019-11-15 23:00:43,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:00:43,451 INFO L462 AbstractCegarLoop]: Abstraction has 2534 states and 6250 transitions. [2019-11-15 23:00:43,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:00:43,451 INFO L276 IsEmpty]: Start isEmpty. Operand 2534 states and 6250 transitions. [2019-11-15 23:00:43,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 23:00:43,454 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:00:43,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-15 23:00:43,455 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:00:43,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:00:43,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1009603726, now seen corresponding path program 1 times [2019-11-15 23:00:43,455 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:00:43,456 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084561459] [2019-11-15 23:00:43,456 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:43,456 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:43,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:00:43,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:00:43,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:00:43,604 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084561459] [2019-11-15 23:00:43,604 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:00:43,605 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:00:43,605 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004226318] [2019-11-15 23:00:43,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:00:43,605 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:00:43,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:00:43,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:00:43,606 INFO L87 Difference]: Start difference. First operand 2534 states and 6250 transitions. Second operand 7 states. [2019-11-15 23:00:43,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:00:43,850 INFO L93 Difference]: Finished difference Result 2909 states and 7051 transitions. [2019-11-15 23:00:43,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:00:43,851 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-11-15 23:00:43,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:00:43,853 INFO L225 Difference]: With dead ends: 2909 [2019-11-15 23:00:43,853 INFO L226 Difference]: Without dead ends: 2909 [2019-11-15 23:00:43,853 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:00:43,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2909 states. [2019-11-15 23:00:43,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2909 to 2749. [2019-11-15 23:00:43,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2749 states. [2019-11-15 23:00:43,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2749 states to 2749 states and 6722 transitions. [2019-11-15 23:00:43,877 INFO L78 Accepts]: Start accepts. Automaton has 2749 states and 6722 transitions. Word has length 96 [2019-11-15 23:00:43,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:00:43,878 INFO L462 AbstractCegarLoop]: Abstraction has 2749 states and 6722 transitions. [2019-11-15 23:00:43,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:00:43,878 INFO L276 IsEmpty]: Start isEmpty. Operand 2749 states and 6722 transitions. [2019-11-15 23:00:43,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 23:00:43,880 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:00:43,880 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-15 23:00:43,880 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:00:43,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:00:43,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1339369487, now seen corresponding path program 1 times [2019-11-15 23:00:43,881 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:00:43,881 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558818647] [2019-11-15 23:00:43,881 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:43,882 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:43,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:00:43,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:00:43,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:00:43,987 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558818647] [2019-11-15 23:00:43,987 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:00:43,987 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:00:43,987 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583784533] [2019-11-15 23:00:43,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:00:43,988 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:00:43,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:00:43,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:00:43,989 INFO L87 Difference]: Start difference. First operand 2749 states and 6722 transitions. Second operand 6 states. [2019-11-15 23:00:44,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:00:44,075 INFO L93 Difference]: Finished difference Result 2946 states and 7028 transitions. [2019-11-15 23:00:44,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:00:44,076 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-11-15 23:00:44,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:00:44,079 INFO L225 Difference]: With dead ends: 2946 [2019-11-15 23:00:44,079 INFO L226 Difference]: Without dead ends: 2895 [2019-11-15 23:00:44,081 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:00:44,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2895 states. [2019-11-15 23:00:44,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2895 to 2768. [2019-11-15 23:00:44,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2768 states. [2019-11-15 23:00:44,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2768 states to 2768 states and 6671 transitions. [2019-11-15 23:00:44,116 INFO L78 Accepts]: Start accepts. Automaton has 2768 states and 6671 transitions. Word has length 96 [2019-11-15 23:00:44,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:00:44,116 INFO L462 AbstractCegarLoop]: Abstraction has 2768 states and 6671 transitions. [2019-11-15 23:00:44,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:00:44,116 INFO L276 IsEmpty]: Start isEmpty. Operand 2768 states and 6671 transitions. [2019-11-15 23:00:44,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 23:00:44,118 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:00:44,119 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-15 23:00:44,119 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:00:44,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:00:44,119 INFO L82 PathProgramCache]: Analyzing trace with hash -361370992, now seen corresponding path program 1 times [2019-11-15 23:00:44,120 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:00:44,120 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669189590] [2019-11-15 23:00:44,120 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:44,120 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:44,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:00:44,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:00:44,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:00:44,221 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669189590] [2019-11-15 23:00:44,222 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:00:44,222 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:00:44,222 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456554425] [2019-11-15 23:00:44,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:00:44,222 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:00:44,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:00:44,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:00:44,223 INFO L87 Difference]: Start difference. First operand 2768 states and 6671 transitions. Second operand 6 states. [2019-11-15 23:00:44,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:00:44,376 INFO L93 Difference]: Finished difference Result 2925 states and 6948 transitions. [2019-11-15 23:00:44,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:00:44,377 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-11-15 23:00:44,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:00:44,380 INFO L225 Difference]: With dead ends: 2925 [2019-11-15 23:00:44,380 INFO L226 Difference]: Without dead ends: 2925 [2019-11-15 23:00:44,380 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:00:44,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2925 states. [2019-11-15 23:00:44,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2925 to 2754. [2019-11-15 23:00:44,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2754 states. [2019-11-15 23:00:44,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2754 states to 2754 states and 6615 transitions. [2019-11-15 23:00:44,416 INFO L78 Accepts]: Start accepts. Automaton has 2754 states and 6615 transitions. Word has length 96 [2019-11-15 23:00:44,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:00:44,417 INFO L462 AbstractCegarLoop]: Abstraction has 2754 states and 6615 transitions. [2019-11-15 23:00:44,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:00:44,417 INFO L276 IsEmpty]: Start isEmpty. Operand 2754 states and 6615 transitions. [2019-11-15 23:00:44,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 23:00:44,420 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:00:44,420 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-15 23:00:44,421 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:00:44,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:00:44,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1997936017, now seen corresponding path program 1 times [2019-11-15 23:00:44,421 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:00:44,421 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431126619] [2019-11-15 23:00:44,422 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:44,422 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:44,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:00:44,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:00:44,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:00:44,481 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431126619] [2019-11-15 23:00:44,481 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:00:44,482 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:00:44,482 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254213632] [2019-11-15 23:00:44,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:00:44,482 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:00:44,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:00:44,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:00:44,483 INFO L87 Difference]: Start difference. First operand 2754 states and 6615 transitions. Second operand 4 states. [2019-11-15 23:00:44,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:00:44,564 INFO L93 Difference]: Finished difference Result 2178 states and 5091 transitions. [2019-11-15 23:00:44,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:00:44,564 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-15 23:00:44,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:00:44,566 INFO L225 Difference]: With dead ends: 2178 [2019-11-15 23:00:44,567 INFO L226 Difference]: Without dead ends: 2178 [2019-11-15 23:00:44,567 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:00:44,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2178 states. [2019-11-15 23:00:44,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2178 to 2082. [2019-11-15 23:00:44,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2082 states. [2019-11-15 23:00:44,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2082 states to 2082 states and 4895 transitions. [2019-11-15 23:00:44,593 INFO L78 Accepts]: Start accepts. Automaton has 2082 states and 4895 transitions. Word has length 96 [2019-11-15 23:00:44,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:00:44,593 INFO L462 AbstractCegarLoop]: Abstraction has 2082 states and 4895 transitions. [2019-11-15 23:00:44,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:00:44,593 INFO L276 IsEmpty]: Start isEmpty. Operand 2082 states and 4895 transitions. [2019-11-15 23:00:44,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 23:00:44,596 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:00:44,596 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-15 23:00:44,596 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:00:44,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:00:44,597 INFO L82 PathProgramCache]: Analyzing trace with hash -295318288, now seen corresponding path program 1 times [2019-11-15 23:00:44,597 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:00:44,597 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465235834] [2019-11-15 23:00:44,597 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:44,597 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:44,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:00:44,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:00:44,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:00:44,670 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465235834] [2019-11-15 23:00:44,671 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:00:44,671 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:00:44,671 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268930226] [2019-11-15 23:00:44,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:00:44,671 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:00:44,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:00:44,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:00:44,672 INFO L87 Difference]: Start difference. First operand 2082 states and 4895 transitions. Second operand 5 states. [2019-11-15 23:00:44,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:00:44,849 INFO L93 Difference]: Finished difference Result 2334 states and 5474 transitions. [2019-11-15 23:00:44,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:00:44,849 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-11-15 23:00:44,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:00:44,852 INFO L225 Difference]: With dead ends: 2334 [2019-11-15 23:00:44,852 INFO L226 Difference]: Without dead ends: 2316 [2019-11-15 23:00:44,852 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:00:44,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2316 states. [2019-11-15 23:00:44,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2316 to 2109. [2019-11-15 23:00:44,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2109 states. [2019-11-15 23:00:44,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2109 states to 2109 states and 4949 transitions. [2019-11-15 23:00:44,881 INFO L78 Accepts]: Start accepts. Automaton has 2109 states and 4949 transitions. Word has length 96 [2019-11-15 23:00:44,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:00:44,882 INFO L462 AbstractCegarLoop]: Abstraction has 2109 states and 4949 transitions. [2019-11-15 23:00:44,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:00:44,882 INFO L276 IsEmpty]: Start isEmpty. Operand 2109 states and 4949 transitions. [2019-11-15 23:00:44,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 23:00:44,885 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:00:44,885 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-15 23:00:44,885 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:00:44,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:00:44,886 INFO L82 PathProgramCache]: Analyzing trace with hash 949446193, now seen corresponding path program 1 times [2019-11-15 23:00:44,886 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:00:44,886 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397715806] [2019-11-15 23:00:44,886 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:44,886 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:44,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:00:44,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:00:45,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:00:45,027 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397715806] [2019-11-15 23:00:45,027 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:00:45,027 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:00:45,027 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147284960] [2019-11-15 23:00:45,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:00:45,028 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:00:45,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:00:45,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:00:45,028 INFO L87 Difference]: Start difference. First operand 2109 states and 4949 transitions. Second operand 7 states. [2019-11-15 23:00:45,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:00:45,113 INFO L93 Difference]: Finished difference Result 3400 states and 8085 transitions. [2019-11-15 23:00:45,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:00:45,114 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-11-15 23:00:45,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:00:45,115 INFO L225 Difference]: With dead ends: 3400 [2019-11-15 23:00:45,115 INFO L226 Difference]: Without dead ends: 1372 [2019-11-15 23:00:45,115 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:00:45,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2019-11-15 23:00:45,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1372. [2019-11-15 23:00:45,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1372 states. [2019-11-15 23:00:45,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 3268 transitions. [2019-11-15 23:00:45,127 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 3268 transitions. Word has length 96 [2019-11-15 23:00:45,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:00:45,127 INFO L462 AbstractCegarLoop]: Abstraction has 1372 states and 3268 transitions. [2019-11-15 23:00:45,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:00:45,127 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 3268 transitions. [2019-11-15 23:00:45,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 23:00:45,128 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:00:45,128 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-15 23:00:45,129 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:00:45,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:00:45,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1727149841, now seen corresponding path program 2 times [2019-11-15 23:00:45,129 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:00:45,129 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004493482] [2019-11-15 23:00:45,129 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:45,129 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:00:45,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:00:45,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:00:45,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:00:45,207 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:00:45,207 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 23:00:45,348 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-15 23:00:45,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:00:45 BasicIcfg [2019-11-15 23:00:45,353 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:00:45,353 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:00:45,353 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:00:45,354 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:00:45,354 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:00:02" (3/4) ... [2019-11-15 23:00:45,362 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 23:00:45,525 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_4de5414b-0001-4a61-83fc-abfcbc65b08e/bin/uautomizer/witness.graphml [2019-11-15 23:00:45,525 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:00:45,528 INFO L168 Benchmark]: Toolchain (without parser) took 44639.63 ms. Allocated memory was 1.0 GB in the beginning and 4.4 GB in the end (delta: 3.4 GB). Free memory was 939.3 MB in the beginning and 991.6 MB in the end (delta: -52.2 MB). Peak memory consumption was 3.4 GB. Max. memory is 11.5 GB. [2019-11-15 23:00:45,528 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:00:45,529 INFO L168 Benchmark]: CACSL2BoogieTranslator took 627.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -164.8 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:00:45,530 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.18 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-11-15 23:00:45,530 INFO L168 Benchmark]: Boogie Preprocessor took 60.99 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-11-15 23:00:45,530 INFO L168 Benchmark]: RCFGBuilder took 683.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:00:45,530 INFO L168 Benchmark]: TraceAbstraction took 43006.46 ms. Allocated memory was 1.2 GB in the beginning and 4.4 GB in the end (delta: 3.3 GB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -25.3 MB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. [2019-11-15 23:00:45,531 INFO L168 Benchmark]: Witness Printer took 171.81 ms. Allocated memory is still 4.4 GB. Free memory was 1.1 GB in the beginning and 991.6 MB in the end (delta: 83.2 MB). Peak memory consumption was 83.2 MB. Max. memory is 11.5 GB. [2019-11-15 23:00:45,535 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.25 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 627.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -164.8 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 85.18 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. * Boogie Preprocessor took 60.99 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. * RCFGBuilder took 683.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 43006.46 ms. Allocated memory was 1.2 GB in the beginning and 4.4 GB in the end (delta: 3.3 GB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -25.3 MB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. * Witness Printer took 171.81 ms. Allocated memory is still 4.4 GB. Free memory was 1.1 GB in the beginning and 991.6 MB in the end (delta: 83.2 MB). Peak memory consumption was 83.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L698] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L699] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L700] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L702] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L704] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L705] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L706] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L707] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L708] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L709] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L710] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L711] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L712] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L713] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L714] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L715] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L716] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L717] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L718] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L720] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L721] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L722] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] 0 pthread_t t1615; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L789] FCALL, FORK 0 pthread_create(&t1615, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] 0 pthread_t t1616; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L791] FCALL, FORK 0 pthread_create(&t1616, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L746] 2 y$w_buff1 = y$w_buff0 [L747] 2 y$w_buff0 = 2 [L748] 2 y$w_buff1_used = y$w_buff0_used [L749] 2 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L751] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L752] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L753] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L754] 2 y$r_buff0_thd2 = (_Bool)1 [L757] 2 z = 1 [L760] 2 __unbuffered_p1_EAX = z [L763] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L726] 1 x = 1 [L729] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=1, z=1] [L732] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=1, z=1] [L732] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L733] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L734] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L734] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L766] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L767] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L767] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L768] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L770] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L735] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L735] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L736] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L739] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L793] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L798] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L799] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L800] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L804] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L805] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L806] 0 y$flush_delayed = weak$$choice2 [L807] 0 y$mem_tmp = y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L809] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L810] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L811] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L812] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L812] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L813] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L814] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L816] EXPR 0 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L816] 0 y = y$flush_delayed ? y$mem_tmp : y [L817] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 177 locations, 3 error locations. Result: UNSAFE, OverallTime: 42.8s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 18.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8163 SDtfs, 8760 SDslu, 18416 SDs, 0 SdLazy, 8354 SolverSat, 560 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 327 GetRequests, 83 SyntacticMatches, 22 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76147occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 18.1s AutomataMinimizationTime, 30 MinimizatonAttempts, 128086 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 2369 NumberOfCodeBlocks, 2369 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2243 ConstructedInterpolants, 0 QuantifiedInterpolants, 428180 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 PerfectInterpolantSequences, 0/0 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...