./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi004_rmo.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_05ce036a-6d0f-4637-bf17-b65fc9eb7f09/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_05ce036a-6d0f-4637-bf17-b65fc9eb7f09/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_05ce036a-6d0f-4637-bf17-b65fc9eb7f09/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_05ce036a-6d0f-4637-bf17-b65fc9eb7f09/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi004_rmo.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_05ce036a-6d0f-4637-bf17-b65fc9eb7f09/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_05ce036a-6d0f-4637-bf17-b65fc9eb7f09/bin-2019/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 a6f7774a15cefd0813adba8dfa8b75a7f19867db .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.23-635dfa2 [2018-12-01 19:15:22,727 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 19:15:22,728 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 19:15:22,734 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 19:15:22,735 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 19:15:22,735 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 19:15:22,736 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 19:15:22,736 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 19:15:22,737 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 19:15:22,738 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 19:15:22,738 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 19:15:22,738 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 19:15:22,739 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 19:15:22,739 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 19:15:22,739 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 19:15:22,740 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 19:15:22,740 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 19:15:22,741 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 19:15:22,742 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 19:15:22,743 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 19:15:22,743 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 19:15:22,744 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 19:15:22,745 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 19:15:22,745 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 19:15:22,745 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 19:15:22,745 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 19:15:22,746 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 19:15:22,746 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 19:15:22,747 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 19:15:22,747 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 19:15:22,747 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 19:15:22,748 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 19:15:22,748 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 19:15:22,748 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 19:15:22,748 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 19:15:22,749 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 19:15:22,749 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_05ce036a-6d0f-4637-bf17-b65fc9eb7f09/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-01 19:15:22,756 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 19:15:22,756 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 19:15:22,756 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-01 19:15:22,756 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-01 19:15:22,757 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 19:15:22,757 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 19:15:22,757 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 19:15:22,757 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 19:15:22,757 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 19:15:22,757 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 19:15:22,757 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 19:15:22,757 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 19:15:22,757 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-01 19:15:22,758 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-01 19:15:22,758 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-01 19:15:22,758 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 19:15:22,758 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 19:15:22,758 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 19:15:22,758 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-01 19:15:22,758 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 19:15:22,758 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 19:15:22,758 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-01 19:15:22,758 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-01 19:15:22,758 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-01 19:15:22,759 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 19:15:22,759 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-01 19:15:22,759 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-01 19:15:22,759 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 19:15:22,759 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-01 19:15:22,759 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-01 19:15:22,759 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_05ce036a-6d0f-4637-bf17-b65fc9eb7f09/bin-2019/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 -> a6f7774a15cefd0813adba8dfa8b75a7f19867db [2018-12-01 19:15:22,777 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 19:15:22,786 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 19:15:22,789 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 19:15:22,790 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 19:15:22,790 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 19:15:22,791 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_05ce036a-6d0f-4637-bf17-b65fc9eb7f09/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/rfi004_rmo.opt_false-unreach-call.i [2018-12-01 19:15:22,835 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_05ce036a-6d0f-4637-bf17-b65fc9eb7f09/bin-2019/uautomizer/data/dbd0d28e8/9e70fb1884fa4b498ab6d5662d00dddb/FLAGc608623d6 [2018-12-01 19:15:23,264 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 19:15:23,265 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_05ce036a-6d0f-4637-bf17-b65fc9eb7f09/sv-benchmarks/c/pthread-wmm/rfi004_rmo.opt_false-unreach-call.i [2018-12-01 19:15:23,275 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_05ce036a-6d0f-4637-bf17-b65fc9eb7f09/bin-2019/uautomizer/data/dbd0d28e8/9e70fb1884fa4b498ab6d5662d00dddb/FLAGc608623d6 [2018-12-01 19:15:23,284 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_05ce036a-6d0f-4637-bf17-b65fc9eb7f09/bin-2019/uautomizer/data/dbd0d28e8/9e70fb1884fa4b498ab6d5662d00dddb [2018-12-01 19:15:23,286 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 19:15:23,287 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 19:15:23,288 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 19:15:23,288 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 19:15:23,291 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 19:15:23,291 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 07:15:23" (1/1) ... [2018-12-01 19:15:23,293 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@159e01e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:15:23, skipping insertion in model container [2018-12-01 19:15:23,294 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 07:15:23" (1/1) ... [2018-12-01 19:15:23,299 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 19:15:23,328 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 19:15:23,530 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 19:15:23,537 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 19:15:23,613 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 19:15:23,644 INFO L195 MainTranslator]: Completed translation [2018-12-01 19:15:23,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:15:23 WrapperNode [2018-12-01 19:15:23,645 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 19:15:23,645 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 19:15:23,645 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 19:15:23,646 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 19:15:23,651 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:15:23" (1/1) ... [2018-12-01 19:15:23,664 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:15:23" (1/1) ... [2018-12-01 19:15:23,683 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 19:15:23,684 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 19:15:23,684 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 19:15:23,684 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 19:15:23,690 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:15:23" (1/1) ... [2018-12-01 19:15:23,690 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:15:23" (1/1) ... [2018-12-01 19:15:23,693 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:15:23" (1/1) ... [2018-12-01 19:15:23,693 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:15:23" (1/1) ... [2018-12-01 19:15:23,697 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:15:23" (1/1) ... [2018-12-01 19:15:23,699 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:15:23" (1/1) ... [2018-12-01 19:15:23,700 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:15:23" (1/1) ... [2018-12-01 19:15:23,702 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 19:15:23,702 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 19:15:23,702 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 19:15:23,702 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 19:15:23,703 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:15:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05ce036a-6d0f-4637-bf17-b65fc9eb7f09/bin-2019/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 [2018-12-01 19:15:23,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-01 19:15:23,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-01 19:15:23,733 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-01 19:15:23,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-01 19:15:23,733 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-01 19:15:23,733 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-01 19:15:23,733 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-01 19:15:23,734 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-01 19:15:23,734 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-01 19:15:23,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 19:15:23,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 19:15:23,734 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-01 19:15:24,008 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 19:15:24,009 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-01 19:15:24,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 07:15:24 BoogieIcfgContainer [2018-12-01 19:15:24,009 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 19:15:24,009 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-01 19:15:24,010 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-01 19:15:24,011 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-01 19:15:24,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 07:15:23" (1/3) ... [2018-12-01 19:15:24,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b404b1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 07:15:24, skipping insertion in model container [2018-12-01 19:15:24,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:15:23" (2/3) ... [2018-12-01 19:15:24,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b404b1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 07:15:24, skipping insertion in model container [2018-12-01 19:15:24,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 07:15:24" (3/3) ... [2018-12-01 19:15:24,013 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi004_rmo.opt_false-unreach-call.i [2018-12-01 19:15:24,036 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,036 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,036 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,037 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,037 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,037 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,037 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,037 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,037 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,038 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,038 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,038 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,038 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,038 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,038 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,039 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,039 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,039 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,039 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,039 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,039 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,040 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,040 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,040 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,040 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,040 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,040 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,041 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,041 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,041 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,041 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,041 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,041 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,041 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,042 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,042 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,042 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,042 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,042 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,042 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,043 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,043 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,043 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,043 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,043 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,043 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,043 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,044 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,044 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,044 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,044 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,044 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,044 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,044 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,045 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,045 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,045 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,045 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,045 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,045 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,046 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,046 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,046 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,046 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,046 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,046 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,046 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,047 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,047 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,047 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,047 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,047 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,047 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,048 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,048 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,048 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,048 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,048 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,048 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,048 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,049 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,049 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,049 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,049 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,049 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,049 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,050 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,050 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,050 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,050 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,050 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,050 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,050 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,051 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,051 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,051 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,051 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,051 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,052 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,052 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,052 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,052 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,052 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,052 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,052 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,053 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,053 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,053 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,053 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,053 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,053 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,054 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,054 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,054 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,054 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,054 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,054 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,054 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,055 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,055 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,055 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,055 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,055 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,055 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,055 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,056 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,056 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,056 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,056 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,056 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,056 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,056 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,057 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,057 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,057 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,057 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 19:15:24,061 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-01 19:15:24,062 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-01 19:15:24,068 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-01 19:15:24,078 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-01 19:15:24,092 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 19:15:24,093 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-01 19:15:24,093 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-01 19:15:24,093 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-01 19:15:24,093 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 19:15:24,093 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 19:15:24,093 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-01 19:15:24,093 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 19:15:24,093 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-01 19:15:24,099 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 132places, 164 transitions [2018-12-01 19:15:25,265 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27856 states. [2018-12-01 19:15:25,267 INFO L276 IsEmpty]: Start isEmpty. Operand 27856 states. [2018-12-01 19:15:25,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-01 19:15:25,272 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:15:25,273 INFO L402 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] [2018-12-01 19:15:25,274 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:15:25,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:15:25,278 INFO L82 PathProgramCache]: Analyzing trace with hash -31372928, now seen corresponding path program 1 times [2018-12-01 19:15:25,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:15:25,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:15:25,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:15:25,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:15:25,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:15:25,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:15:25,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:15:25,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:15:25,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 19:15:25,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 19:15:25,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 19:15:25,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 19:15:25,454 INFO L87 Difference]: Start difference. First operand 27856 states. Second operand 4 states. [2018-12-01 19:15:25,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:15:25,841 INFO L93 Difference]: Finished difference Result 47768 states and 183119 transitions. [2018-12-01 19:15:25,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 19:15:25,842 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-12-01 19:15:25,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:15:25,970 INFO L225 Difference]: With dead ends: 47768 [2018-12-01 19:15:25,970 INFO L226 Difference]: Without dead ends: 34608 [2018-12-01 19:15:25,971 INFO L631 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 [2018-12-01 19:15:26,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34608 states. [2018-12-01 19:15:26,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34608 to 21756. [2018-12-01 19:15:26,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21756 states. [2018-12-01 19:15:26,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21756 states to 21756 states and 83441 transitions. [2018-12-01 19:15:26,688 INFO L78 Accepts]: Start accepts. Automaton has 21756 states and 83441 transitions. Word has length 39 [2018-12-01 19:15:26,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:15:26,688 INFO L480 AbstractCegarLoop]: Abstraction has 21756 states and 83441 transitions. [2018-12-01 19:15:26,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 19:15:26,688 INFO L276 IsEmpty]: Start isEmpty. Operand 21756 states and 83441 transitions. [2018-12-01 19:15:26,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-01 19:15:26,694 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:15:26,695 INFO L402 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] [2018-12-01 19:15:26,695 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:15:26,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:15:26,696 INFO L82 PathProgramCache]: Analyzing trace with hash -954263015, now seen corresponding path program 1 times [2018-12-01 19:15:26,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:15:26,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:15:26,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:15:26,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:15:26,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:15:26,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:15:26,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:15:26,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:15:26,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 19:15:26,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 19:15:26,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 19:15:26,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 19:15:26,757 INFO L87 Difference]: Start difference. First operand 21756 states and 83441 transitions. Second operand 4 states. [2018-12-01 19:15:26,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:15:26,822 INFO L93 Difference]: Finished difference Result 7170 states and 23626 transitions. [2018-12-01 19:15:26,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 19:15:26,822 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-12-01 19:15:26,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:15:26,838 INFO L225 Difference]: With dead ends: 7170 [2018-12-01 19:15:26,838 INFO L226 Difference]: Without dead ends: 6324 [2018-12-01 19:15:26,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-01 19:15:26,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6324 states. [2018-12-01 19:15:26,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6324 to 6324. [2018-12-01 19:15:26,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6324 states. [2018-12-01 19:15:26,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6324 states to 6324 states and 20698 transitions. [2018-12-01 19:15:26,985 INFO L78 Accepts]: Start accepts. Automaton has 6324 states and 20698 transitions. Word has length 47 [2018-12-01 19:15:26,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:15:26,985 INFO L480 AbstractCegarLoop]: Abstraction has 6324 states and 20698 transitions. [2018-12-01 19:15:26,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 19:15:26,985 INFO L276 IsEmpty]: Start isEmpty. Operand 6324 states and 20698 transitions. [2018-12-01 19:15:26,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-01 19:15:26,986 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:15:26,986 INFO L402 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] [2018-12-01 19:15:26,986 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:15:26,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:15:26,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1367871073, now seen corresponding path program 1 times [2018-12-01 19:15:26,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:15:26,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:15:26,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:15:26,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:15:26,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:15:26,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:15:27,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:15:27,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:15:27,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 19:15:27,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 19:15:27,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 19:15:27,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 19:15:27,034 INFO L87 Difference]: Start difference. First operand 6324 states and 20698 transitions. Second operand 5 states. [2018-12-01 19:15:27,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:15:27,224 INFO L93 Difference]: Finished difference Result 12020 states and 38784 transitions. [2018-12-01 19:15:27,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 19:15:27,224 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-12-01 19:15:27,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:15:27,244 INFO L225 Difference]: With dead ends: 12020 [2018-12-01 19:15:27,244 INFO L226 Difference]: Without dead ends: 11945 [2018-12-01 19:15:27,245 INFO L631 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 [2018-12-01 19:15:27,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11945 states. [2018-12-01 19:15:27,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11945 to 8289. [2018-12-01 19:15:27,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8289 states. [2018-12-01 19:15:27,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8289 states to 8289 states and 26551 transitions. [2018-12-01 19:15:27,354 INFO L78 Accepts]: Start accepts. Automaton has 8289 states and 26551 transitions. Word has length 48 [2018-12-01 19:15:27,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:15:27,355 INFO L480 AbstractCegarLoop]: Abstraction has 8289 states and 26551 transitions. [2018-12-01 19:15:27,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 19:15:27,355 INFO L276 IsEmpty]: Start isEmpty. Operand 8289 states and 26551 transitions. [2018-12-01 19:15:27,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-01 19:15:27,356 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:15:27,356 INFO L402 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] [2018-12-01 19:15:27,357 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:15:27,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:15:27,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1372813561, now seen corresponding path program 1 times [2018-12-01 19:15:27,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:15:27,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:15:27,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:15:27,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:15:27,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:15:27,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:15:27,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:15:27,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:15:27,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 19:15:27,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 19:15:27,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 19:15:27,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 19:15:27,380 INFO L87 Difference]: Start difference. First operand 8289 states and 26551 transitions. Second operand 3 states. [2018-12-01 19:15:27,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:15:27,444 INFO L93 Difference]: Finished difference Result 10985 states and 34706 transitions. [2018-12-01 19:15:27,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 19:15:27,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-01 19:15:27,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:15:27,458 INFO L225 Difference]: With dead ends: 10985 [2018-12-01 19:15:27,458 INFO L226 Difference]: Without dead ends: 10981 [2018-12-01 19:15:27,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 19:15:27,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10981 states. [2018-12-01 19:15:27,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10981 to 8507. [2018-12-01 19:15:27,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8507 states. [2018-12-01 19:15:27,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8507 states to 8507 states and 26987 transitions. [2018-12-01 19:15:27,569 INFO L78 Accepts]: Start accepts. Automaton has 8507 states and 26987 transitions. Word has length 50 [2018-12-01 19:15:27,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:15:27,569 INFO L480 AbstractCegarLoop]: Abstraction has 8507 states and 26987 transitions. [2018-12-01 19:15:27,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 19:15:27,569 INFO L276 IsEmpty]: Start isEmpty. Operand 8507 states and 26987 transitions. [2018-12-01 19:15:27,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-01 19:15:27,570 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:15:27,570 INFO L402 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] [2018-12-01 19:15:27,570 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:15:27,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:15:27,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1505170194, now seen corresponding path program 1 times [2018-12-01 19:15:27,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:15:27,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:15:27,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:15:27,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:15:27,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:15:27,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:15:27,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:15:27,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:15:27,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 19:15:27,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 19:15:27,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 19:15:27,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-01 19:15:27,627 INFO L87 Difference]: Start difference. First operand 8507 states and 26987 transitions. Second operand 6 states. [2018-12-01 19:15:27,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:15:27,877 INFO L93 Difference]: Finished difference Result 11923 states and 37198 transitions. [2018-12-01 19:15:27,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-01 19:15:27,878 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-12-01 19:15:27,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:15:27,892 INFO L225 Difference]: With dead ends: 11923 [2018-12-01 19:15:27,893 INFO L226 Difference]: Without dead ends: 11826 [2018-12-01 19:15:27,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-12-01 19:15:27,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11826 states. [2018-12-01 19:15:28,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11826 to 9281. [2018-12-01 19:15:28,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9281 states. [2018-12-01 19:15:28,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9281 states to 9281 states and 29431 transitions. [2018-12-01 19:15:28,043 INFO L78 Accepts]: Start accepts. Automaton has 9281 states and 29431 transitions. Word has length 54 [2018-12-01 19:15:28,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:15:28,043 INFO L480 AbstractCegarLoop]: Abstraction has 9281 states and 29431 transitions. [2018-12-01 19:15:28,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 19:15:28,044 INFO L276 IsEmpty]: Start isEmpty. Operand 9281 states and 29431 transitions. [2018-12-01 19:15:28,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-01 19:15:28,047 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:15:28,048 INFO L402 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] [2018-12-01 19:15:28,048 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:15:28,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:15:28,048 INFO L82 PathProgramCache]: Analyzing trace with hash 2067258406, now seen corresponding path program 1 times [2018-12-01 19:15:28,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:15:28,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:15:28,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:15:28,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:15:28,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:15:28,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:15:28,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:15:28,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:15:28,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 19:15:28,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 19:15:28,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 19:15:28,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 19:15:28,086 INFO L87 Difference]: Start difference. First operand 9281 states and 29431 transitions. Second operand 4 states. [2018-12-01 19:15:28,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:15:28,195 INFO L93 Difference]: Finished difference Result 10900 states and 34382 transitions. [2018-12-01 19:15:28,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 19:15:28,195 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-01 19:15:28,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:15:28,207 INFO L225 Difference]: With dead ends: 10900 [2018-12-01 19:15:28,207 INFO L226 Difference]: Without dead ends: 10900 [2018-12-01 19:15:28,208 INFO L631 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 [2018-12-01 19:15:28,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10900 states. [2018-12-01 19:15:28,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10900 to 9932. [2018-12-01 19:15:28,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9932 states. [2018-12-01 19:15:28,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9932 states to 9932 states and 31408 transitions. [2018-12-01 19:15:28,316 INFO L78 Accepts]: Start accepts. Automaton has 9932 states and 31408 transitions. Word has length 64 [2018-12-01 19:15:28,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:15:28,316 INFO L480 AbstractCegarLoop]: Abstraction has 9932 states and 31408 transitions. [2018-12-01 19:15:28,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 19:15:28,317 INFO L276 IsEmpty]: Start isEmpty. Operand 9932 states and 31408 transitions. [2018-12-01 19:15:28,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-01 19:15:28,321 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:15:28,321 INFO L402 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] [2018-12-01 19:15:28,321 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:15:28,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:15:28,321 INFO L82 PathProgramCache]: Analyzing trace with hash -484898555, now seen corresponding path program 1 times [2018-12-01 19:15:28,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:15:28,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:15:28,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:15:28,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:15:28,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:15:28,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:15:28,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:15:28,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:15:28,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 19:15:28,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 19:15:28,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 19:15:28,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-01 19:15:28,363 INFO L87 Difference]: Start difference. First operand 9932 states and 31408 transitions. Second operand 5 states. [2018-12-01 19:15:28,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:15:28,394 INFO L93 Difference]: Finished difference Result 2984 states and 7669 transitions. [2018-12-01 19:15:28,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 19:15:28,394 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2018-12-01 19:15:28,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:15:28,397 INFO L225 Difference]: With dead ends: 2984 [2018-12-01 19:15:28,397 INFO L226 Difference]: Without dead ends: 2432 [2018-12-01 19:15:28,397 INFO L631 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 [2018-12-01 19:15:28,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2432 states. [2018-12-01 19:15:28,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2432 to 2314. [2018-12-01 19:15:28,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2314 states. [2018-12-01 19:15:28,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2314 states to 2314 states and 5795 transitions. [2018-12-01 19:15:28,417 INFO L78 Accepts]: Start accepts. Automaton has 2314 states and 5795 transitions. Word has length 64 [2018-12-01 19:15:28,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:15:28,417 INFO L480 AbstractCegarLoop]: Abstraction has 2314 states and 5795 transitions. [2018-12-01 19:15:28,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 19:15:28,417 INFO L276 IsEmpty]: Start isEmpty. Operand 2314 states and 5795 transitions. [2018-12-01 19:15:28,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-01 19:15:28,419 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:15:28,419 INFO L402 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] [2018-12-01 19:15:28,419 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:15:28,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:15:28,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1114410340, now seen corresponding path program 1 times [2018-12-01 19:15:28,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:15:28,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:15:28,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:15:28,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:15:28,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:15:28,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:15:28,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:15:28,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:15:28,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 19:15:28,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 19:15:28,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 19:15:28,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-01 19:15:28,473 INFO L87 Difference]: Start difference. First operand 2314 states and 5795 transitions. Second operand 5 states. [2018-12-01 19:15:28,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:15:28,611 INFO L93 Difference]: Finished difference Result 3749 states and 9029 transitions. [2018-12-01 19:15:28,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 19:15:28,611 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2018-12-01 19:15:28,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:15:28,614 INFO L225 Difference]: With dead ends: 3749 [2018-12-01 19:15:28,614 INFO L226 Difference]: Without dead ends: 3749 [2018-12-01 19:15:28,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-12-01 19:15:28,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3749 states. [2018-12-01 19:15:28,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3749 to 2820. [2018-12-01 19:15:28,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2820 states. [2018-12-01 19:15:28,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2820 states to 2820 states and 6873 transitions. [2018-12-01 19:15:28,639 INFO L78 Accepts]: Start accepts. Automaton has 2820 states and 6873 transitions. Word has length 83 [2018-12-01 19:15:28,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:15:28,639 INFO L480 AbstractCegarLoop]: Abstraction has 2820 states and 6873 transitions. [2018-12-01 19:15:28,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 19:15:28,639 INFO L276 IsEmpty]: Start isEmpty. Operand 2820 states and 6873 transitions. [2018-12-01 19:15:28,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-01 19:15:28,641 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:15:28,641 INFO L402 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] [2018-12-01 19:15:28,641 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:15:28,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:15:28,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1047403587, now seen corresponding path program 1 times [2018-12-01 19:15:28,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:15:28,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:15:28,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:15:28,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:15:28,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:15:28,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:15:28,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:15:28,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:15:28,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 19:15:28,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 19:15:28,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 19:15:28,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 19:15:28,686 INFO L87 Difference]: Start difference. First operand 2820 states and 6873 transitions. Second operand 4 states. [2018-12-01 19:15:28,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:15:28,788 INFO L93 Difference]: Finished difference Result 3853 states and 9212 transitions. [2018-12-01 19:15:28,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 19:15:28,788 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2018-12-01 19:15:28,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:15:28,791 INFO L225 Difference]: With dead ends: 3853 [2018-12-01 19:15:28,791 INFO L226 Difference]: Without dead ends: 3853 [2018-12-01 19:15:28,791 INFO L631 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 [2018-12-01 19:15:28,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3853 states. [2018-12-01 19:15:28,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3853 to 2909. [2018-12-01 19:15:28,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2909 states. [2018-12-01 19:15:28,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2909 states to 2909 states and 7104 transitions. [2018-12-01 19:15:28,814 INFO L78 Accepts]: Start accepts. Automaton has 2909 states and 7104 transitions. Word has length 83 [2018-12-01 19:15:28,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:15:28,814 INFO L480 AbstractCegarLoop]: Abstraction has 2909 states and 7104 transitions. [2018-12-01 19:15:28,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 19:15:28,814 INFO L276 IsEmpty]: Start isEmpty. Operand 2909 states and 7104 transitions. [2018-12-01 19:15:28,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-01 19:15:28,817 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:15:28,817 INFO L402 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] [2018-12-01 19:15:28,817 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:15:28,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:15:28,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1302140132, now seen corresponding path program 1 times [2018-12-01 19:15:28,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:15:28,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:15:28,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:15:28,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:15:28,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:15:28,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:15:28,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:15:28,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:15:28,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 19:15:28,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 19:15:28,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 19:15:28,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 19:15:28,843 INFO L87 Difference]: Start difference. First operand 2909 states and 7104 transitions. Second operand 3 states. [2018-12-01 19:15:28,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:15:28,942 INFO L93 Difference]: Finished difference Result 3036 states and 7362 transitions. [2018-12-01 19:15:28,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 19:15:28,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-12-01 19:15:28,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:15:28,944 INFO L225 Difference]: With dead ends: 3036 [2018-12-01 19:15:28,944 INFO L226 Difference]: Without dead ends: 3036 [2018-12-01 19:15:28,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 19:15:28,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3036 states. [2018-12-01 19:15:28,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3036 to 2967. [2018-12-01 19:15:28,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2967 states. [2018-12-01 19:15:28,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2967 states to 2967 states and 7206 transitions. [2018-12-01 19:15:28,996 INFO L78 Accepts]: Start accepts. Automaton has 2967 states and 7206 transitions. Word has length 83 [2018-12-01 19:15:28,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:15:28,996 INFO L480 AbstractCegarLoop]: Abstraction has 2967 states and 7206 transitions. [2018-12-01 19:15:28,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 19:15:28,997 INFO L276 IsEmpty]: Start isEmpty. Operand 2967 states and 7206 transitions. [2018-12-01 19:15:28,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-01 19:15:28,999 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:15:28,999 INFO L402 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] [2018-12-01 19:15:28,999 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:15:28,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:15:28,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1380210314, now seen corresponding path program 2 times [2018-12-01 19:15:29,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:15:29,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:15:29,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:15:29,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:15:29,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:15:29,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:15:29,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:15:29,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:15:29,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 19:15:29,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 19:15:29,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 19:15:29,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 19:15:29,038 INFO L87 Difference]: Start difference. First operand 2967 states and 7206 transitions. Second operand 4 states. [2018-12-01 19:15:29,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:15:29,115 INFO L93 Difference]: Finished difference Result 3175 states and 7742 transitions. [2018-12-01 19:15:29,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 19:15:29,115 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2018-12-01 19:15:29,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:15:29,118 INFO L225 Difference]: With dead ends: 3175 [2018-12-01 19:15:29,118 INFO L226 Difference]: Without dead ends: 3175 [2018-12-01 19:15:29,119 INFO L631 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 [2018-12-01 19:15:29,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3175 states. [2018-12-01 19:15:29,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3175 to 3031. [2018-12-01 19:15:29,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3031 states. [2018-12-01 19:15:29,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3031 states to 3031 states and 7382 transitions. [2018-12-01 19:15:29,148 INFO L78 Accepts]: Start accepts. Automaton has 3031 states and 7382 transitions. Word has length 83 [2018-12-01 19:15:29,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:15:29,149 INFO L480 AbstractCegarLoop]: Abstraction has 3031 states and 7382 transitions. [2018-12-01 19:15:29,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 19:15:29,149 INFO L276 IsEmpty]: Start isEmpty. Operand 3031 states and 7382 transitions. [2018-12-01 19:15:29,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-01 19:15:29,151 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:15:29,151 INFO L402 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] [2018-12-01 19:15:29,151 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:15:29,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:15:29,151 INFO L82 PathProgramCache]: Analyzing trace with hash -427244149, now seen corresponding path program 1 times [2018-12-01 19:15:29,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:15:29,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:15:29,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:15:29,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 19:15:29,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:15:29,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:15:29,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:15:29,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:15:29,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 19:15:29,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 19:15:29,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 19:15:29,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-01 19:15:29,219 INFO L87 Difference]: Start difference. First operand 3031 states and 7382 transitions. Second operand 6 states. [2018-12-01 19:15:29,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:15:29,387 INFO L93 Difference]: Finished difference Result 4273 states and 10326 transitions. [2018-12-01 19:15:29,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 19:15:29,388 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-12-01 19:15:29,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:15:29,390 INFO L225 Difference]: With dead ends: 4273 [2018-12-01 19:15:29,391 INFO L226 Difference]: Without dead ends: 4241 [2018-12-01 19:15:29,391 INFO L631 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 [2018-12-01 19:15:29,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4241 states. [2018-12-01 19:15:29,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4241 to 3809. [2018-12-01 19:15:29,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3809 states. [2018-12-01 19:15:29,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3809 states to 3809 states and 9294 transitions. [2018-12-01 19:15:29,419 INFO L78 Accepts]: Start accepts. Automaton has 3809 states and 9294 transitions. Word has length 83 [2018-12-01 19:15:29,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:15:29,419 INFO L480 AbstractCegarLoop]: Abstraction has 3809 states and 9294 transitions. [2018-12-01 19:15:29,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 19:15:29,419 INFO L276 IsEmpty]: Start isEmpty. Operand 3809 states and 9294 transitions. [2018-12-01 19:15:29,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-01 19:15:29,422 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:15:29,422 INFO L402 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] [2018-12-01 19:15:29,422 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:15:29,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:15:29,422 INFO L82 PathProgramCache]: Analyzing trace with hash 2070771788, now seen corresponding path program 1 times [2018-12-01 19:15:29,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:15:29,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:15:29,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:15:29,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:15:29,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:15:29,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:15:29,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:15:29,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:15:29,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 19:15:29,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 19:15:29,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 19:15:29,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-01 19:15:29,488 INFO L87 Difference]: Start difference. First operand 3809 states and 9294 transitions. Second operand 7 states. [2018-12-01 19:15:29,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:15:29,817 INFO L93 Difference]: Finished difference Result 6928 states and 17059 transitions. [2018-12-01 19:15:29,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-01 19:15:29,817 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2018-12-01 19:15:29,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:15:29,822 INFO L225 Difference]: With dead ends: 6928 [2018-12-01 19:15:29,822 INFO L226 Difference]: Without dead ends: 6928 [2018-12-01 19:15:29,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-12-01 19:15:29,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6928 states. [2018-12-01 19:15:29,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6928 to 4575. [2018-12-01 19:15:29,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4575 states. [2018-12-01 19:15:29,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4575 states to 4575 states and 11265 transitions. [2018-12-01 19:15:29,863 INFO L78 Accepts]: Start accepts. Automaton has 4575 states and 11265 transitions. Word has length 83 [2018-12-01 19:15:29,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:15:29,863 INFO L480 AbstractCegarLoop]: Abstraction has 4575 states and 11265 transitions. [2018-12-01 19:15:29,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 19:15:29,863 INFO L276 IsEmpty]: Start isEmpty. Operand 4575 states and 11265 transitions. [2018-12-01 19:15:29,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-01 19:15:29,867 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:15:29,867 INFO L402 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] [2018-12-01 19:15:29,867 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:15:29,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:15:29,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1336691827, now seen corresponding path program 1 times [2018-12-01 19:15:29,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:15:29,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:15:29,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:15:29,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:15:29,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:15:29,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:15:29,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:15:29,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:15:29,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 19:15:29,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 19:15:29,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 19:15:29,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-01 19:15:29,935 INFO L87 Difference]: Start difference. First operand 4575 states and 11265 transitions. Second operand 6 states. [2018-12-01 19:15:30,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:15:30,179 INFO L93 Difference]: Finished difference Result 4993 states and 12235 transitions. [2018-12-01 19:15:30,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 19:15:30,179 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-12-01 19:15:30,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:15:30,183 INFO L225 Difference]: With dead ends: 4993 [2018-12-01 19:15:30,183 INFO L226 Difference]: Without dead ends: 4993 [2018-12-01 19:15:30,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-01 19:15:30,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4993 states. [2018-12-01 19:15:30,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4993 to 3961. [2018-12-01 19:15:30,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3961 states. [2018-12-01 19:15:30,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3961 states to 3961 states and 9624 transitions. [2018-12-01 19:15:30,213 INFO L78 Accepts]: Start accepts. Automaton has 3961 states and 9624 transitions. Word has length 83 [2018-12-01 19:15:30,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:15:30,213 INFO L480 AbstractCegarLoop]: Abstraction has 3961 states and 9624 transitions. [2018-12-01 19:15:30,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 19:15:30,213 INFO L276 IsEmpty]: Start isEmpty. Operand 3961 states and 9624 transitions. [2018-12-01 19:15:30,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-01 19:15:30,216 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:15:30,216 INFO L402 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] [2018-12-01 19:15:30,216 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:15:30,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:15:30,217 INFO L82 PathProgramCache]: Analyzing trace with hash -858977808, now seen corresponding path program 1 times [2018-12-01 19:15:30,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:15:30,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:15:30,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:15:30,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:15:30,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:15:30,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:15:30,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:15:30,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:15:30,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 19:15:30,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 19:15:30,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 19:15:30,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-01 19:15:30,266 INFO L87 Difference]: Start difference. First operand 3961 states and 9624 transitions. Second operand 6 states. [2018-12-01 19:15:30,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:15:30,393 INFO L93 Difference]: Finished difference Result 4235 states and 10155 transitions. [2018-12-01 19:15:30,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 19:15:30,393 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-12-01 19:15:30,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:15:30,396 INFO L225 Difference]: With dead ends: 4235 [2018-12-01 19:15:30,396 INFO L226 Difference]: Without dead ends: 4235 [2018-12-01 19:15:30,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-01 19:15:30,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4235 states. [2018-12-01 19:15:30,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4235 to 3751. [2018-12-01 19:15:30,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3751 states. [2018-12-01 19:15:30,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3751 states to 3751 states and 9066 transitions. [2018-12-01 19:15:30,427 INFO L78 Accepts]: Start accepts. Automaton has 3751 states and 9066 transitions. Word has length 83 [2018-12-01 19:15:30,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:15:30,428 INFO L480 AbstractCegarLoop]: Abstraction has 3751 states and 9066 transitions. [2018-12-01 19:15:30,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 19:15:30,428 INFO L276 IsEmpty]: Start isEmpty. Operand 3751 states and 9066 transitions. [2018-12-01 19:15:30,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-01 19:15:30,432 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:15:30,432 INFO L402 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] [2018-12-01 19:15:30,432 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:15:30,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:15:30,433 INFO L82 PathProgramCache]: Analyzing trace with hash 510429518, now seen corresponding path program 1 times [2018-12-01 19:15:30,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:15:30,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:15:30,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:15:30,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:15:30,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:15:30,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:15:30,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:15:30,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:15:30,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 19:15:30,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 19:15:30,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 19:15:30,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-01 19:15:30,494 INFO L87 Difference]: Start difference. First operand 3751 states and 9066 transitions. Second operand 6 states. [2018-12-01 19:15:30,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:15:30,588 INFO L93 Difference]: Finished difference Result 3447 states and 8082 transitions. [2018-12-01 19:15:30,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 19:15:30,589 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-12-01 19:15:30,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:15:30,591 INFO L225 Difference]: With dead ends: 3447 [2018-12-01 19:15:30,592 INFO L226 Difference]: Without dead ends: 3447 [2018-12-01 19:15:30,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-01 19:15:30,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3447 states. [2018-12-01 19:15:30,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3447 to 2297. [2018-12-01 19:15:30,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2297 states. [2018-12-01 19:15:30,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2297 states to 2297 states and 5377 transitions. [2018-12-01 19:15:30,619 INFO L78 Accepts]: Start accepts. Automaton has 2297 states and 5377 transitions. Word has length 83 [2018-12-01 19:15:30,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:15:30,619 INFO L480 AbstractCegarLoop]: Abstraction has 2297 states and 5377 transitions. [2018-12-01 19:15:30,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 19:15:30,619 INFO L276 IsEmpty]: Start isEmpty. Operand 2297 states and 5377 transitions. [2018-12-01 19:15:30,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-01 19:15:30,622 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:15:30,622 INFO L402 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] [2018-12-01 19:15:30,622 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:15:30,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:15:30,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1763148420, now seen corresponding path program 1 times [2018-12-01 19:15:30,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:15:30,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:15:30,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:15:30,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:15:30,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:15:30,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:15:30,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:15:30,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:15:30,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 19:15:30,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 19:15:30,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 19:15:30,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-01 19:15:30,698 INFO L87 Difference]: Start difference. First operand 2297 states and 5377 transitions. Second operand 6 states. [2018-12-01 19:15:30,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:15:30,807 INFO L93 Difference]: Finished difference Result 2790 states and 6356 transitions. [2018-12-01 19:15:30,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 19:15:30,808 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2018-12-01 19:15:30,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:15:30,809 INFO L225 Difference]: With dead ends: 2790 [2018-12-01 19:15:30,810 INFO L226 Difference]: Without dead ends: 2732 [2018-12-01 19:15:30,810 INFO L631 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 [2018-12-01 19:15:30,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2732 states. [2018-12-01 19:15:30,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2732 to 2346. [2018-12-01 19:15:30,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2346 states. [2018-12-01 19:15:30,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2346 states to 2346 states and 5388 transitions. [2018-12-01 19:15:30,828 INFO L78 Accepts]: Start accepts. Automaton has 2346 states and 5388 transitions. Word has length 85 [2018-12-01 19:15:30,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:15:30,828 INFO L480 AbstractCegarLoop]: Abstraction has 2346 states and 5388 transitions. [2018-12-01 19:15:30,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 19:15:30,828 INFO L276 IsEmpty]: Start isEmpty. Operand 2346 states and 5388 transitions. [2018-12-01 19:15:30,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-01 19:15:30,830 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:15:30,830 INFO L402 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] [2018-12-01 19:15:30,831 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:15:30,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:15:30,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1508411875, now seen corresponding path program 1 times [2018-12-01 19:15:30,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:15:30,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:15:30,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:15:30,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:15:30,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:15:30,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:15:30,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:15:30,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:15:30,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 19:15:30,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 19:15:30,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 19:15:30,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-01 19:15:30,894 INFO L87 Difference]: Start difference. First operand 2346 states and 5388 transitions. Second operand 6 states. [2018-12-01 19:15:31,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:15:31,025 INFO L93 Difference]: Finished difference Result 2549 states and 5792 transitions. [2018-12-01 19:15:31,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-01 19:15:31,026 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2018-12-01 19:15:31,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:15:31,028 INFO L225 Difference]: With dead ends: 2549 [2018-12-01 19:15:31,028 INFO L226 Difference]: Without dead ends: 2549 [2018-12-01 19:15:31,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-01 19:15:31,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2549 states. [2018-12-01 19:15:31,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2549 to 2370. [2018-12-01 19:15:31,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2370 states. [2018-12-01 19:15:31,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2370 states to 2370 states and 5407 transitions. [2018-12-01 19:15:31,068 INFO L78 Accepts]: Start accepts. Automaton has 2370 states and 5407 transitions. Word has length 85 [2018-12-01 19:15:31,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:15:31,069 INFO L480 AbstractCegarLoop]: Abstraction has 2370 states and 5407 transitions. [2018-12-01 19:15:31,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 19:15:31,069 INFO L276 IsEmpty]: Start isEmpty. Operand 2370 states and 5407 transitions. [2018-12-01 19:15:31,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-01 19:15:31,071 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:15:31,071 INFO L402 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] [2018-12-01 19:15:31,071 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:15:31,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:15:31,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1441405122, now seen corresponding path program 1 times [2018-12-01 19:15:31,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:15:31,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:15:31,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:15:31,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:15:31,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:15:31,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:15:31,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:15:31,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:15:31,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 19:15:31,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 19:15:31,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 19:15:31,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-01 19:15:31,166 INFO L87 Difference]: Start difference. First operand 2370 states and 5407 transitions. Second operand 7 states. [2018-12-01 19:15:31,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:15:31,292 INFO L93 Difference]: Finished difference Result 2862 states and 6512 transitions. [2018-12-01 19:15:31,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-01 19:15:31,293 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2018-12-01 19:15:31,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:15:31,294 INFO L225 Difference]: With dead ends: 2862 [2018-12-01 19:15:31,294 INFO L226 Difference]: Without dead ends: 2862 [2018-12-01 19:15:31,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-12-01 19:15:31,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2862 states. [2018-12-01 19:15:31,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2862 to 2846. [2018-12-01 19:15:31,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2846 states. [2018-12-01 19:15:31,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2846 states to 2846 states and 6472 transitions. [2018-12-01 19:15:31,315 INFO L78 Accepts]: Start accepts. Automaton has 2846 states and 6472 transitions. Word has length 85 [2018-12-01 19:15:31,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:15:31,315 INFO L480 AbstractCegarLoop]: Abstraction has 2846 states and 6472 transitions. [2018-12-01 19:15:31,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 19:15:31,315 INFO L276 IsEmpty]: Start isEmpty. Operand 2846 states and 6472 transitions. [2018-12-01 19:15:31,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-01 19:15:31,317 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:15:31,317 INFO L402 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] [2018-12-01 19:15:31,317 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:15:31,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:15:31,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1966058493, now seen corresponding path program 1 times [2018-12-01 19:15:31,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:15:31,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:15:31,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:15:31,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:15:31,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:15:31,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:15:31,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:15:31,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:15:31,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-01 19:15:31,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-01 19:15:31,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-01 19:15:31,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-01 19:15:31,397 INFO L87 Difference]: Start difference. First operand 2846 states and 6472 transitions. Second operand 9 states. [2018-12-01 19:15:31,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:15:31,543 INFO L93 Difference]: Finished difference Result 7301 states and 16765 transitions. [2018-12-01 19:15:31,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-01 19:15:31,543 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2018-12-01 19:15:31,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:15:31,545 INFO L225 Difference]: With dead ends: 7301 [2018-12-01 19:15:31,545 INFO L226 Difference]: Without dead ends: 2203 [2018-12-01 19:15:31,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2018-12-01 19:15:31,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2203 states. [2018-12-01 19:15:31,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2203 to 2203. [2018-12-01 19:15:31,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2203 states. [2018-12-01 19:15:31,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2203 states to 2203 states and 5047 transitions. [2018-12-01 19:15:31,558 INFO L78 Accepts]: Start accepts. Automaton has 2203 states and 5047 transitions. Word has length 85 [2018-12-01 19:15:31,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:15:31,558 INFO L480 AbstractCegarLoop]: Abstraction has 2203 states and 5047 transitions. [2018-12-01 19:15:31,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-01 19:15:31,558 INFO L276 IsEmpty]: Start isEmpty. Operand 2203 states and 5047 transitions. [2018-12-01 19:15:31,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-01 19:15:31,559 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:15:31,559 INFO L402 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] [2018-12-01 19:15:31,559 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:15:31,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:15:31,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1005620617, now seen corresponding path program 1 times [2018-12-01 19:15:31,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:15:31,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:15:31,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:15:31,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:15:31,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:15:31,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:15:31,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:15:31,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:15:31,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 19:15:31,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 19:15:31,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 19:15:31,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-01 19:15:31,650 INFO L87 Difference]: Start difference. First operand 2203 states and 5047 transitions. Second operand 7 states. [2018-12-01 19:15:31,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:15:31,842 INFO L93 Difference]: Finished difference Result 2312 states and 5270 transitions. [2018-12-01 19:15:31,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 19:15:31,842 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2018-12-01 19:15:31,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:15:31,844 INFO L225 Difference]: With dead ends: 2312 [2018-12-01 19:15:31,844 INFO L226 Difference]: Without dead ends: 2312 [2018-12-01 19:15:31,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-01 19:15:31,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2312 states. [2018-12-01 19:15:31,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2312 to 2099. [2018-12-01 19:15:31,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2099 states. [2018-12-01 19:15:31,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2099 states to 2099 states and 4798 transitions. [2018-12-01 19:15:31,863 INFO L78 Accepts]: Start accepts. Automaton has 2099 states and 4798 transitions. Word has length 85 [2018-12-01 19:15:31,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:15:31,863 INFO L480 AbstractCegarLoop]: Abstraction has 2099 states and 4798 transitions. [2018-12-01 19:15:31,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 19:15:31,863 INFO L276 IsEmpty]: Start isEmpty. Operand 2099 states and 4798 transitions. [2018-12-01 19:15:31,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-01 19:15:31,865 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:15:31,865 INFO L402 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] [2018-12-01 19:15:31,865 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:15:31,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:15:31,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1464778360, now seen corresponding path program 2 times [2018-12-01 19:15:31,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:15:31,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:15:31,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:15:31,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:15:31,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:15:31,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:15:31,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:15:31,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:15:31,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 19:15:31,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 19:15:31,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 19:15:31,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-01 19:15:31,917 INFO L87 Difference]: Start difference. First operand 2099 states and 4798 transitions. Second operand 5 states. [2018-12-01 19:15:31,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:15:31,940 INFO L93 Difference]: Finished difference Result 2099 states and 4782 transitions. [2018-12-01 19:15:31,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 19:15:31,941 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2018-12-01 19:15:31,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:15:31,942 INFO L225 Difference]: With dead ends: 2099 [2018-12-01 19:15:31,942 INFO L226 Difference]: Without dead ends: 2099 [2018-12-01 19:15:31,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-01 19:15:31,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2099 states. [2018-12-01 19:15:31,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2099 to 1693. [2018-12-01 19:15:31,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1693 states. [2018-12-01 19:15:31,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1693 states to 1693 states and 3855 transitions. [2018-12-01 19:15:31,956 INFO L78 Accepts]: Start accepts. Automaton has 1693 states and 3855 transitions. Word has length 85 [2018-12-01 19:15:31,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:15:31,956 INFO L480 AbstractCegarLoop]: Abstraction has 1693 states and 3855 transitions. [2018-12-01 19:15:31,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 19:15:31,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1693 states and 3855 transitions. [2018-12-01 19:15:31,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-01 19:15:31,958 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:15:31,958 INFO L402 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] [2018-12-01 19:15:31,959 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:15:31,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:15:31,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1942685255, now seen corresponding path program 2 times [2018-12-01 19:15:31,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:15:31,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:15:31,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:15:31,960 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 19:15:31,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:15:31,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:15:32,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:15:32,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:15:32,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-01 19:15:32,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-01 19:15:32,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-01 19:15:32,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-01 19:15:32,068 INFO L87 Difference]: Start difference. First operand 1693 states and 3855 transitions. Second operand 11 states. [2018-12-01 19:15:32,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:15:32,747 INFO L93 Difference]: Finished difference Result 3268 states and 7492 transitions. [2018-12-01 19:15:32,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-01 19:15:32,748 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 85 [2018-12-01 19:15:32,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:15:32,750 INFO L225 Difference]: With dead ends: 3268 [2018-12-01 19:15:32,750 INFO L226 Difference]: Without dead ends: 1920 [2018-12-01 19:15:32,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2018-12-01 19:15:32,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1920 states. [2018-12-01 19:15:32,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1920 to 1726. [2018-12-01 19:15:32,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1726 states. [2018-12-01 19:15:32,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 3878 transitions. [2018-12-01 19:15:32,771 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 3878 transitions. Word has length 85 [2018-12-01 19:15:32,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:15:32,772 INFO L480 AbstractCegarLoop]: Abstraction has 1726 states and 3878 transitions. [2018-12-01 19:15:32,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-01 19:15:32,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 3878 transitions. [2018-12-01 19:15:32,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-01 19:15:32,774 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:15:32,774 INFO L402 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] [2018-12-01 19:15:32,774 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:15:32,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:15:32,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1542877223, now seen corresponding path program 3 times [2018-12-01 19:15:32,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:15:32,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:15:32,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:15:32,776 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 19:15:32,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:15:32,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:15:32,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 19:15:32,823 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-01 19:15:32,901 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-01 19:15:32,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.12 07:15:32 BasicIcfg [2018-12-01 19:15:32,903 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-01 19:15:32,903 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 19:15:32,903 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 19:15:32,903 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 19:15:32,904 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 07:15:24" (3/4) ... [2018-12-01 19:15:32,906 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-01 19:15:32,995 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_05ce036a-6d0f-4637-bf17-b65fc9eb7f09/bin-2019/uautomizer/witness.graphml [2018-12-01 19:15:32,995 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 19:15:32,996 INFO L168 Benchmark]: Toolchain (without parser) took 9709.65 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 766.5 MB). Free memory was 951.8 MB in the beginning and 1.0 GB in the end (delta: -60.9 MB). Peak memory consumption was 705.6 MB. Max. memory is 11.5 GB. [2018-12-01 19:15:32,997 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 19:15:32,997 INFO L168 Benchmark]: CACSL2BoogieTranslator took 357.56 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 951.8 MB in the beginning and 1.1 GB in the end (delta: -141.5 MB). Peak memory consumption was 35.2 MB. Max. memory is 11.5 GB. [2018-12-01 19:15:32,997 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-01 19:15:32,997 INFO L168 Benchmark]: Boogie Preprocessor took 18.58 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 19:15:32,997 INFO L168 Benchmark]: RCFGBuilder took 306.79 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 11.5 GB. [2018-12-01 19:15:32,997 INFO L168 Benchmark]: TraceAbstraction took 8893.34 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 651.2 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 2.1 MB). Peak memory consumption was 653.2 MB. Max. memory is 11.5 GB. [2018-12-01 19:15:32,998 INFO L168 Benchmark]: Witness Printer took 92.28 ms. Allocated memory is still 1.8 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 31.4 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. [2018-12-01 19:15:32,999 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 357.56 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 951.8 MB in the beginning and 1.1 GB in the end (delta: -141.5 MB). Peak memory consumption was 35.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.58 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 306.79 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8893.34 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 651.2 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 2.1 MB). Peak memory consumption was 653.2 MB. Max. memory is 11.5 GB. * Witness Printer took 92.28 ms. Allocated memory is still 1.8 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 31.4 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L678] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L679] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L680] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L682] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L684] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L685] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L686] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L687] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L688] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L689] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L690] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L691] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L692] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L693] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L694] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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}] [L695] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L696] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L697] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L698] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L700] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L701] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L702] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L778] -1 pthread_t t1661; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L779] FCALL, FORK -1 pthread_create(&t1661, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L780] -1 pthread_t t1662; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L781] FCALL, FORK -1 pthread_create(&t1662, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L736] 0 y$w_buff1 = y$w_buff0 [L737] 0 y$w_buff0 = 1 [L738] 0 y$w_buff1_used = y$w_buff0_used [L739] 0 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L741] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L742] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L743] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L744] 0 y$r_buff0_thd2 = (_Bool)1 [L747] 0 z = 1 [L750] 0 __unbuffered_p1_EAX = z [L753] 0 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] EXPR 0 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_p0_EAX=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L706] 1 x = 1 [L711] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L712] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L713] 1 y$flush_delayed = weak$$choice2 [L714] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L715] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 0 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L757] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L715] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L716] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L716] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L717] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L717] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L758] EXPR 0 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_p0_EAX=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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L758] 0 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 [L759] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 0 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L760] EXPR 0 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_p0_EAX=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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] 0 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 [L763] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L718] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L718] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L719] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L719] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L720] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L720] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L721] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L721] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L722] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L723] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L723] 1 y = y$flush_delayed ? y$mem_tmp : y [L724] 1 y$flush_delayed = (_Bool)0 [L729] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L783] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __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=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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR -1 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_p0_EAX=0, __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=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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __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=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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR -1 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_p0_EAX=0, __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=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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L788] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __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=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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L788] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L789] EXPR -1 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_p0_EAX=0, __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=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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L789] -1 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 [L790] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __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=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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L790] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L791] EXPR -1 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_p0_EAX=0, __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=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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] -1 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 [L794] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __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=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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __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=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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __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=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=1, 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, 200 locations, 3 error locations. UNSAFE Result, 8.8s OverallTime, 24 OverallIterations, 1 TraceHistogramMax, 4.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5385 SDtfs, 5970 SDslu, 12545 SDs, 0 SdLazy, 3886 SolverSat, 202 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 204 GetRequests, 53 SyntacticMatches, 15 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27856occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 23 MinimizatonAttempts, 31544 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1793 NumberOfCodeBlocks, 1793 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1685 ConstructedInterpolants, 0 QuantifiedInterpolants, 326141 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...