./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix000_power.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ea192c6a-b426-4e33-a229-635547cb42a4/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ea192c6a-b426-4e33-a229-635547cb42a4/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ea192c6a-b426-4e33-a229-635547cb42a4/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ea192c6a-b426-4e33-a229-635547cb42a4/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix000_power.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ea192c6a-b426-4e33-a229-635547cb42a4/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ea192c6a-b426-4e33-a229-635547cb42a4/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 a94e9616eeec95d33f3b637918a945a848d3e6f6 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-0cd3be1 [2018-11-28 13:18:01,558 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 13:18:01,559 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 13:18:01,567 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 13:18:01,568 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 13:18:01,568 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 13:18:01,569 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 13:18:01,570 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 13:18:01,571 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 13:18:01,572 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 13:18:01,572 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 13:18:01,572 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 13:18:01,573 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 13:18:01,574 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 13:18:01,574 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 13:18:01,575 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 13:18:01,575 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 13:18:01,577 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 13:18:01,578 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 13:18:01,579 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 13:18:01,580 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 13:18:01,581 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 13:18:01,582 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 13:18:01,582 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 13:18:01,582 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 13:18:01,583 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 13:18:01,584 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 13:18:01,584 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 13:18:01,585 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 13:18:01,585 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 13:18:01,586 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 13:18:01,586 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 13:18:01,586 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 13:18:01,586 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 13:18:01,587 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 13:18:01,587 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 13:18:01,588 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ea192c6a-b426-4e33-a229-635547cb42a4/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 13:18:01,597 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 13:18:01,597 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 13:18:01,598 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 13:18:01,598 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 13:18:01,598 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 13:18:01,598 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 13:18:01,598 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 13:18:01,599 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 13:18:01,599 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 13:18:01,599 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 13:18:01,599 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 13:18:01,599 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 13:18:01,599 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 13:18:01,599 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 13:18:01,599 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 13:18:01,600 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 13:18:01,600 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 13:18:01,600 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 13:18:01,600 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 13:18:01,600 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 13:18:01,600 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 13:18:01,600 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 13:18:01,600 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 13:18:01,601 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 13:18:01,601 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 13:18:01,601 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 13:18:01,601 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 13:18:01,601 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 13:18:01,601 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 13:18:01,601 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 13:18:01,602 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_ea192c6a-b426-4e33-a229-635547cb42a4/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 -> a94e9616eeec95d33f3b637918a945a848d3e6f6 [2018-11-28 13:18:01,623 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 13:18:01,631 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 13:18:01,633 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 13:18:01,633 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 13:18:01,634 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 13:18:01,634 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ea192c6a-b426-4e33-a229-635547cb42a4/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix000_power.oepc_false-unreach-call.i [2018-11-28 13:18:01,671 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ea192c6a-b426-4e33-a229-635547cb42a4/bin-2019/uautomizer/data/a179d1975/7a0c73ebf9454d27b09ad996a84566d9/FLAG86a0143fe [2018-11-28 13:18:02,017 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 13:18:02,017 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ea192c6a-b426-4e33-a229-635547cb42a4/sv-benchmarks/c/pthread-wmm/mix000_power.oepc_false-unreach-call.i [2018-11-28 13:18:02,024 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ea192c6a-b426-4e33-a229-635547cb42a4/bin-2019/uautomizer/data/a179d1975/7a0c73ebf9454d27b09ad996a84566d9/FLAG86a0143fe [2018-11-28 13:18:02,034 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ea192c6a-b426-4e33-a229-635547cb42a4/bin-2019/uautomizer/data/a179d1975/7a0c73ebf9454d27b09ad996a84566d9 [2018-11-28 13:18:02,036 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 13:18:02,037 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 13:18:02,038 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 13:18:02,038 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 13:18:02,041 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 13:18:02,041 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:18:02" (1/1) ... [2018-11-28 13:18:02,043 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4113b024 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:18:02, skipping insertion in model container [2018-11-28 13:18:02,044 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:18:02" (1/1) ... [2018-11-28 13:18:02,048 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 13:18:02,076 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 13:18:02,296 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:18:02,304 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 13:18:02,397 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:18:02,429 INFO L195 MainTranslator]: Completed translation [2018-11-28 13:18:02,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:18:02 WrapperNode [2018-11-28 13:18:02,429 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 13:18:02,429 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 13:18:02,429 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 13:18:02,429 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 13:18:02,434 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:18:02" (1/1) ... [2018-11-28 13:18:02,448 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:18:02" (1/1) ... [2018-11-28 13:18:02,471 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 13:18:02,472 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 13:18:02,472 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 13:18:02,472 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 13:18:02,480 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:18:02" (1/1) ... [2018-11-28 13:18:02,480 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:18:02" (1/1) ... [2018-11-28 13:18:02,484 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:18:02" (1/1) ... [2018-11-28 13:18:02,485 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:18:02" (1/1) ... [2018-11-28 13:18:02,493 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:18:02" (1/1) ... [2018-11-28 13:18:02,496 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:18:02" (1/1) ... [2018-11-28 13:18:02,499 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:18:02" (1/1) ... [2018-11-28 13:18:02,502 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 13:18:02,503 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 13:18:02,503 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 13:18:02,503 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 13:18:02,504 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:18:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ea192c6a-b426-4e33-a229-635547cb42a4/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-11-28 13:18:02,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 13:18:02,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 13:18:02,556 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-11-28 13:18:02,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 13:18:02,556 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-11-28 13:18:02,556 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-11-28 13:18:02,556 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-11-28 13:18:02,556 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-11-28 13:18:02,556 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-11-28 13:18:02,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 13:18:02,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 13:18:02,559 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-11-28 13:18:03,158 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 13:18:03,158 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 13:18:03,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:18:03 BoogieIcfgContainer [2018-11-28 13:18:03,159 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 13:18:03,159 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 13:18:03,159 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 13:18:03,161 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 13:18:03,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 01:18:02" (1/3) ... [2018-11-28 13:18:03,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bcc0d45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:18:03, skipping insertion in model container [2018-11-28 13:18:03,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:18:02" (2/3) ... [2018-11-28 13:18:03,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bcc0d45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:18:03, skipping insertion in model container [2018-11-28 13:18:03,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:18:03" (3/3) ... [2018-11-28 13:18:03,163 INFO L112 eAbstractionObserver]: Analyzing ICFG mix000_power.oepc_false-unreach-call.i [2018-11-28 13:18:03,193 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,193 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,194 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,194 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,194 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,194 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,194 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,194 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,194 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,194 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,195 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,195 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,195 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,195 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,195 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,195 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,195 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,195 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,195 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,195 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,196 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,196 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,196 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,196 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,196 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,196 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,196 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,196 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,196 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,196 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,196 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,197 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,197 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,197 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,197 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,197 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,197 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,197 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,197 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,197 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,197 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,197 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,198 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,198 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,198 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,198 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,198 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,198 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,198 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,198 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,198 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,198 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,199 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,199 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,199 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,199 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,199 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,199 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,199 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,199 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,199 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,199 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,199 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,200 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,200 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,200 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,200 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,200 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,200 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,200 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,200 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,200 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,200 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,200 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,201 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,201 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,201 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,201 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,201 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,201 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,202 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,202 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,202 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,202 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,202 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,203 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,203 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,203 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,203 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,203 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,204 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,204 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,204 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,204 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,204 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,204 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,205 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,205 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,205 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,205 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,205 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,205 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,206 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,206 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,206 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,206 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,206 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,207 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,207 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,207 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,207 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,208 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,208 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,208 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,208 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,208 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,208 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,209 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,209 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,209 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,209 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,209 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,210 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,210 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,210 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,210 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,211 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,211 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,211 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,211 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,211 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,211 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,212 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,212 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,212 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,212 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,212 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,212 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,213 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,213 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,213 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,213 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,213 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,214 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,214 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,214 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,214 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,214 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,214 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,215 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,215 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,215 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,215 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,215 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,215 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,215 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,216 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,216 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,216 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,216 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,216 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,216 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,217 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,217 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,217 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,217 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,217 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,217 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,217 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,217 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,218 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,218 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,218 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,218 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,218 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,218 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,218 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,219 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,219 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,219 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,219 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,219 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,219 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,219 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,219 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,220 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,220 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,220 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,220 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,220 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,220 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,220 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,220 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,221 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,221 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,221 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,221 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,221 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,221 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,221 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,222 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,222 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,222 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,222 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,222 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,222 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,222 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,223 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,223 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,223 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,223 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,223 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,223 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,223 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,224 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,224 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,224 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,224 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,224 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,224 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,224 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,224 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,225 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,225 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,225 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,225 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,225 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,225 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,226 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,226 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,226 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,226 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,226 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,226 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,226 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,227 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,227 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,227 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,227 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,227 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,227 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,228 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,228 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet62.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,228 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet62.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,228 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,228 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,228 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet62.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,228 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet62.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:18:03,234 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-11-28 13:18:03,234 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 13:18:03,239 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-28 13:18:03,248 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-28 13:18:03,265 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 13:18:03,265 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 13:18:03,265 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 13:18:03,265 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 13:18:03,266 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 13:18:03,266 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 13:18:03,266 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 13:18:03,266 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 13:18:03,266 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 13:18:03,275 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 186places, 245 transitions [2018-11-28 13:18:11,325 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 104360 states. [2018-11-28 13:18:11,326 INFO L276 IsEmpty]: Start isEmpty. Operand 104360 states. [2018-11-28 13:18:11,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-28 13:18:11,331 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:18:11,332 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] [2018-11-28 13:18:11,333 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:18:11,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:18:11,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1413658612, now seen corresponding path program 1 times [2018-11-28 13:18:11,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:18:11,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:18:11,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:18:11,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:18:11,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:18:11,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:18:11,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:18:11,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:18:11,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:18:11,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:18:11,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:18:11,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:18:11,527 INFO L87 Difference]: Start difference. First operand 104360 states. Second operand 4 states. [2018-11-28 13:18:12,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:18:12,999 INFO L93 Difference]: Finished difference Result 192000 states and 772893 transitions. [2018-11-28 13:18:12,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:18:13,000 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-11-28 13:18:13,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:18:13,489 INFO L225 Difference]: With dead ends: 192000 [2018-11-28 13:18:13,489 INFO L226 Difference]: Without dead ends: 135832 [2018-11-28 13:18:13,490 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-11-28 13:18:14,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135832 states. [2018-11-28 13:18:16,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135832 to 77068. [2018-11-28 13:18:16,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77068 states. [2018-11-28 13:18:16,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77068 states to 77068 states and 313611 transitions. [2018-11-28 13:18:16,551 INFO L78 Accepts]: Start accepts. Automaton has 77068 states and 313611 transitions. Word has length 35 [2018-11-28 13:18:16,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:18:16,551 INFO L480 AbstractCegarLoop]: Abstraction has 77068 states and 313611 transitions. [2018-11-28 13:18:16,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:18:16,552 INFO L276 IsEmpty]: Start isEmpty. Operand 77068 states and 313611 transitions. [2018-11-28 13:18:16,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-28 13:18:16,559 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:18:16,560 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-11-28 13:18:16,560 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:18:16,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:18:16,561 INFO L82 PathProgramCache]: Analyzing trace with hash 512759921, now seen corresponding path program 1 times [2018-11-28 13:18:16,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:18:16,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:18:16,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:18:16,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:18:16,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:18:18,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:18:18,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:18:18,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:18:18,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:18:18,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:18:18,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:18:18,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:18:18,382 INFO L87 Difference]: Start difference. First operand 77068 states and 313611 transitions. Second operand 5 states. [2018-11-28 13:18:19,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:18:19,588 INFO L93 Difference]: Finished difference Result 195844 states and 748303 transitions. [2018-11-28 13:18:19,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:18:19,589 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-11-28 13:18:19,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:18:20,008 INFO L225 Difference]: With dead ends: 195844 [2018-11-28 13:18:20,009 INFO L226 Difference]: Without dead ends: 195292 [2018-11-28 13:18:20,009 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-11-28 13:18:21,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195292 states. [2018-11-28 13:18:23,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195292 to 123067. [2018-11-28 13:18:23,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123067 states. [2018-11-28 13:18:24,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123067 states to 123067 states and 470493 transitions. [2018-11-28 13:18:24,060 INFO L78 Accepts]: Start accepts. Automaton has 123067 states and 470493 transitions. Word has length 47 [2018-11-28 13:18:24,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:18:24,062 INFO L480 AbstractCegarLoop]: Abstraction has 123067 states and 470493 transitions. [2018-11-28 13:18:24,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:18:24,062 INFO L276 IsEmpty]: Start isEmpty. Operand 123067 states and 470493 transitions. [2018-11-28 13:18:24,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-28 13:18:24,066 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:18:24,066 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-11-28 13:18:24,066 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:18:24,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:18:24,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1044252158, now seen corresponding path program 1 times [2018-11-28 13:18:24,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:18:24,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:18:24,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:18:24,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:18:24,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:18:24,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:18:24,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:18:24,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:18:24,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:18:24,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:18:24,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:18:24,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:18:24,145 INFO L87 Difference]: Start difference. First operand 123067 states and 470493 transitions. Second operand 5 states. [2018-11-28 13:18:25,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:18:25,347 INFO L93 Difference]: Finished difference Result 253868 states and 961457 transitions. [2018-11-28 13:18:25,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:18:25,347 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-11-28 13:18:25,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:18:25,897 INFO L225 Difference]: With dead ends: 253868 [2018-11-28 13:18:25,897 INFO L226 Difference]: Without dead ends: 253356 [2018-11-28 13:18:25,898 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-11-28 13:18:31,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253356 states. [2018-11-28 13:18:32,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253356 to 135934. [2018-11-28 13:18:32,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135934 states. [2018-11-28 13:18:33,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135934 states to 135934 states and 515687 transitions. [2018-11-28 13:18:33,554 INFO L78 Accepts]: Start accepts. Automaton has 135934 states and 515687 transitions. Word has length 48 [2018-11-28 13:18:33,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:18:33,554 INFO L480 AbstractCegarLoop]: Abstraction has 135934 states and 515687 transitions. [2018-11-28 13:18:33,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:18:33,554 INFO L276 IsEmpty]: Start isEmpty. Operand 135934 states and 515687 transitions. [2018-11-28 13:18:33,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-28 13:18:33,562 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:18:33,562 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-11-28 13:18:33,562 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:18:33,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:18:33,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1766694552, now seen corresponding path program 1 times [2018-11-28 13:18:33,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:18:33,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:18:33,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:18:33,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:18:33,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:18:33,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:18:33,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:18:33,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:18:33,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:18:33,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:18:33,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:18:33,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:18:33,617 INFO L87 Difference]: Start difference. First operand 135934 states and 515687 transitions. Second operand 3 states. [2018-11-28 13:18:34,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:18:34,552 INFO L93 Difference]: Finished difference Result 234162 states and 866041 transitions. [2018-11-28 13:18:34,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:18:34,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-11-28 13:18:34,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:18:35,070 INFO L225 Difference]: With dead ends: 234162 [2018-11-28 13:18:35,070 INFO L226 Difference]: Without dead ends: 234162 [2018-11-28 13:18:35,070 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-11-28 13:18:37,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234162 states. [2018-11-28 13:18:39,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234162 to 207903. [2018-11-28 13:18:39,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207903 states. [2018-11-28 13:18:40,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207903 states to 207903 states and 772292 transitions. [2018-11-28 13:18:40,498 INFO L78 Accepts]: Start accepts. Automaton has 207903 states and 772292 transitions. Word has length 50 [2018-11-28 13:18:40,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:18:40,498 INFO L480 AbstractCegarLoop]: Abstraction has 207903 states and 772292 transitions. [2018-11-28 13:18:40,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:18:40,498 INFO L276 IsEmpty]: Start isEmpty. Operand 207903 states and 772292 transitions. [2018-11-28 13:18:40,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-28 13:18:40,515 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:18:40,515 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-11-28 13:18:40,515 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:18:40,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:18:40,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1751055411, now seen corresponding path program 1 times [2018-11-28 13:18:40,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:18:40,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:18:40,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:18:40,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:18:40,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:18:40,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:18:40,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:18:40,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:18:40,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:18:40,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:18:40,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:18:40,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:18:40,581 INFO L87 Difference]: Start difference. First operand 207903 states and 772292 transitions. Second operand 6 states. [2018-11-28 13:18:43,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:18:43,441 INFO L93 Difference]: Finished difference Result 402833 states and 1473119 transitions. [2018-11-28 13:18:43,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 13:18:43,442 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-11-28 13:18:43,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:18:44,312 INFO L225 Difference]: With dead ends: 402833 [2018-11-28 13:18:44,313 INFO L226 Difference]: Without dead ends: 402257 [2018-11-28 13:18:44,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-11-28 13:18:47,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402257 states. [2018-11-28 13:18:55,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402257 to 208069. [2018-11-28 13:18:55,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208069 states. [2018-11-28 13:18:56,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208069 states to 208069 states and 773298 transitions. [2018-11-28 13:18:56,278 INFO L78 Accepts]: Start accepts. Automaton has 208069 states and 773298 transitions. Word has length 54 [2018-11-28 13:18:56,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:18:56,278 INFO L480 AbstractCegarLoop]: Abstraction has 208069 states and 773298 transitions. [2018-11-28 13:18:56,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:18:56,278 INFO L276 IsEmpty]: Start isEmpty. Operand 208069 states and 773298 transitions. [2018-11-28 13:18:56,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-28 13:18:56,292 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:18:56,292 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-11-28 13:18:56,292 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:18:56,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:18:56,293 INFO L82 PathProgramCache]: Analyzing trace with hash 8397738, now seen corresponding path program 1 times [2018-11-28 13:18:56,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:18:56,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:18:56,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:18:56,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:18:56,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:18:56,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:18:56,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:18:56,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:18:56,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:18:56,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:18:56,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:18:56,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:18:56,382 INFO L87 Difference]: Start difference. First operand 208069 states and 773298 transitions. Second operand 7 states. [2018-11-28 13:18:58,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:18:58,290 INFO L93 Difference]: Finished difference Result 325852 states and 1170129 transitions. [2018-11-28 13:18:58,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 13:18:58,290 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2018-11-28 13:18:58,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:18:59,831 INFO L225 Difference]: With dead ends: 325852 [2018-11-28 13:18:59,831 INFO L226 Difference]: Without dead ends: 325852 [2018-11-28 13:18:59,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-28 13:19:02,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325852 states. [2018-11-28 13:19:09,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325852 to 256642. [2018-11-28 13:19:09,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256642 states. [2018-11-28 13:19:10,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256642 states to 256642 states and 939283 transitions. [2018-11-28 13:19:10,673 INFO L78 Accepts]: Start accepts. Automaton has 256642 states and 939283 transitions. Word has length 54 [2018-11-28 13:19:10,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:19:10,673 INFO L480 AbstractCegarLoop]: Abstraction has 256642 states and 939283 transitions. [2018-11-28 13:19:10,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:19:10,674 INFO L276 IsEmpty]: Start isEmpty. Operand 256642 states and 939283 transitions. [2018-11-28 13:19:10,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-28 13:19:10,690 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:19:10,690 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-11-28 13:19:10,690 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:19:10,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:10,690 INFO L82 PathProgramCache]: Analyzing trace with hash 895901419, now seen corresponding path program 1 times [2018-11-28 13:19:10,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:19:10,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:19:10,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:10,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:19:10,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:10,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:19:10,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:19:10,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:19:10,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:19:10,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:19:10,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:19:10,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:19:10,739 INFO L87 Difference]: Start difference. First operand 256642 states and 939283 transitions. Second operand 4 states. [2018-11-28 13:19:10,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:19:10,841 INFO L93 Difference]: Finished difference Result 40004 states and 128000 transitions. [2018-11-28 13:19:10,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:19:10,841 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-11-28 13:19:10,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:19:10,880 INFO L225 Difference]: With dead ends: 40004 [2018-11-28 13:19:10,880 INFO L226 Difference]: Without dead ends: 32121 [2018-11-28 13:19:10,880 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-11-28 13:19:10,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32121 states. [2018-11-28 13:19:11,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32121 to 31856. [2018-11-28 13:19:11,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31856 states. [2018-11-28 13:19:11,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31856 states to 31856 states and 99339 transitions. [2018-11-28 13:19:11,210 INFO L78 Accepts]: Start accepts. Automaton has 31856 states and 99339 transitions. Word has length 54 [2018-11-28 13:19:11,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:19:11,210 INFO L480 AbstractCegarLoop]: Abstraction has 31856 states and 99339 transitions. [2018-11-28 13:19:11,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:19:11,210 INFO L276 IsEmpty]: Start isEmpty. Operand 31856 states and 99339 transitions. [2018-11-28 13:19:11,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-28 13:19:11,213 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:19:11,213 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] [2018-11-28 13:19:11,214 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:19:11,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:11,214 INFO L82 PathProgramCache]: Analyzing trace with hash 642841615, now seen corresponding path program 1 times [2018-11-28 13:19:11,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:19:11,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:19:11,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:11,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:19:11,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:11,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:19:11,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:19:11,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:19:11,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:19:11,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:19:11,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:19:11,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:19:11,261 INFO L87 Difference]: Start difference. First operand 31856 states and 99339 transitions. Second operand 4 states. [2018-11-28 13:19:11,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:19:11,477 INFO L93 Difference]: Finished difference Result 37101 states and 115387 transitions. [2018-11-28 13:19:11,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:19:11,478 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2018-11-28 13:19:11,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:19:11,518 INFO L225 Difference]: With dead ends: 37101 [2018-11-28 13:19:11,518 INFO L226 Difference]: Without dead ends: 37101 [2018-11-28 13:19:11,518 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-11-28 13:19:11,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37101 states. [2018-11-28 13:19:11,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37101 to 36125. [2018-11-28 13:19:11,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36125 states. [2018-11-28 13:19:11,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36125 states to 36125 states and 112472 transitions. [2018-11-28 13:19:11,896 INFO L78 Accepts]: Start accepts. Automaton has 36125 states and 112472 transitions. Word has length 62 [2018-11-28 13:19:11,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:19:11,896 INFO L480 AbstractCegarLoop]: Abstraction has 36125 states and 112472 transitions. [2018-11-28 13:19:11,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:19:11,896 INFO L276 IsEmpty]: Start isEmpty. Operand 36125 states and 112472 transitions. [2018-11-28 13:19:11,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-28 13:19:11,899 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:19:11,900 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] [2018-11-28 13:19:11,900 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:19:11,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:11,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1909315346, now seen corresponding path program 1 times [2018-11-28 13:19:11,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:19:11,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:19:11,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:11,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:19:11,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:11,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:19:11,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:19:11,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:19:11,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:19:11,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:19:11,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:19:11,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:19:11,966 INFO L87 Difference]: Start difference. First operand 36125 states and 112472 transitions. Second operand 6 states. [2018-11-28 13:19:12,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:19:12,463 INFO L93 Difference]: Finished difference Result 74227 states and 229198 transitions. [2018-11-28 13:19:12,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 13:19:12,463 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2018-11-28 13:19:12,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:19:13,127 INFO L225 Difference]: With dead ends: 74227 [2018-11-28 13:19:13,128 INFO L226 Difference]: Without dead ends: 74156 [2018-11-28 13:19:13,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-11-28 13:19:13,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74156 states. [2018-11-28 13:19:13,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74156 to 44213. [2018-11-28 13:19:13,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44213 states. [2018-11-28 13:19:13,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44213 states to 44213 states and 135208 transitions. [2018-11-28 13:19:13,677 INFO L78 Accepts]: Start accepts. Automaton has 44213 states and 135208 transitions. Word has length 62 [2018-11-28 13:19:13,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:19:13,677 INFO L480 AbstractCegarLoop]: Abstraction has 44213 states and 135208 transitions. [2018-11-28 13:19:13,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:19:13,677 INFO L276 IsEmpty]: Start isEmpty. Operand 44213 states and 135208 transitions. [2018-11-28 13:19:13,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-28 13:19:13,683 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:19:13,683 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] [2018-11-28 13:19:13,683 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:19:13,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:13,683 INFO L82 PathProgramCache]: Analyzing trace with hash -941424289, now seen corresponding path program 1 times [2018-11-28 13:19:13,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:19:13,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:19:13,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:13,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:19:13,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:13,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:19:13,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:19:13,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:19:13,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:19:13,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:19:13,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:19:13,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:19:13,722 INFO L87 Difference]: Start difference. First operand 44213 states and 135208 transitions. Second operand 3 states. [2018-11-28 13:19:13,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:19:13,905 INFO L93 Difference]: Finished difference Result 55070 states and 166417 transitions. [2018-11-28 13:19:13,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:19:13,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-11-28 13:19:13,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:19:13,979 INFO L225 Difference]: With dead ends: 55070 [2018-11-28 13:19:13,979 INFO L226 Difference]: Without dead ends: 55070 [2018-11-28 13:19:13,979 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-11-28 13:19:14,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55070 states. [2018-11-28 13:19:14,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55070 to 45329. [2018-11-28 13:19:14,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45329 states. [2018-11-28 13:19:14,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45329 states to 45329 states and 135858 transitions. [2018-11-28 13:19:14,497 INFO L78 Accepts]: Start accepts. Automaton has 45329 states and 135858 transitions. Word has length 68 [2018-11-28 13:19:14,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:19:14,497 INFO L480 AbstractCegarLoop]: Abstraction has 45329 states and 135858 transitions. [2018-11-28 13:19:14,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:19:14,497 INFO L276 IsEmpty]: Start isEmpty. Operand 45329 states and 135858 transitions. [2018-11-28 13:19:14,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-28 13:19:14,506 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:19:14,507 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] [2018-11-28 13:19:14,507 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:19:14,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:14,507 INFO L82 PathProgramCache]: Analyzing trace with hash 53745586, now seen corresponding path program 1 times [2018-11-28 13:19:14,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:19:14,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:19:14,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:14,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:19:14,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:14,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:19:14,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:19:14,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:19:14,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:19:14,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:19:14,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:19:14,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:19:14,584 INFO L87 Difference]: Start difference. First operand 45329 states and 135858 transitions. Second operand 5 states. [2018-11-28 13:19:14,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:19:14,871 INFO L93 Difference]: Finished difference Result 51158 states and 153082 transitions. [2018-11-28 13:19:14,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:19:14,871 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2018-11-28 13:19:14,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:19:14,929 INFO L225 Difference]: With dead ends: 51158 [2018-11-28 13:19:14,929 INFO L226 Difference]: Without dead ends: 51158 [2018-11-28 13:19:14,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:19:15,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51158 states. [2018-11-28 13:19:15,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51158 to 45794. [2018-11-28 13:19:15,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45794 states. [2018-11-28 13:19:15,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45794 states to 45794 states and 137141 transitions. [2018-11-28 13:19:15,933 INFO L78 Accepts]: Start accepts. Automaton has 45794 states and 137141 transitions. Word has length 74 [2018-11-28 13:19:15,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:19:15,933 INFO L480 AbstractCegarLoop]: Abstraction has 45794 states and 137141 transitions. [2018-11-28 13:19:15,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:19:15,934 INFO L276 IsEmpty]: Start isEmpty. Operand 45794 states and 137141 transitions. [2018-11-28 13:19:15,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-28 13:19:15,943 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:19:15,943 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] [2018-11-28 13:19:15,943 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:19:15,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:15,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1796555921, now seen corresponding path program 1 times [2018-11-28 13:19:15,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:19:15,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:19:15,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:15,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:19:15,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:15,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:19:15,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:19:15,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:19:15,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:19:15,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:19:15,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:19:15,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:19:16,000 INFO L87 Difference]: Start difference. First operand 45794 states and 137141 transitions. Second operand 7 states. [2018-11-28 13:19:16,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:19:16,539 INFO L93 Difference]: Finished difference Result 54436 states and 163097 transitions. [2018-11-28 13:19:16,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 13:19:16,539 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2018-11-28 13:19:16,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:19:16,602 INFO L225 Difference]: With dead ends: 54436 [2018-11-28 13:19:16,602 INFO L226 Difference]: Without dead ends: 54349 [2018-11-28 13:19:16,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-11-28 13:19:16,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54349 states. [2018-11-28 13:19:17,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54349 to 42854. [2018-11-28 13:19:17,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42854 states. [2018-11-28 13:19:17,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42854 states to 42854 states and 129588 transitions. [2018-11-28 13:19:17,089 INFO L78 Accepts]: Start accepts. Automaton has 42854 states and 129588 transitions. Word has length 74 [2018-11-28 13:19:17,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:19:17,089 INFO L480 AbstractCegarLoop]: Abstraction has 42854 states and 129588 transitions. [2018-11-28 13:19:17,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:19:17,089 INFO L276 IsEmpty]: Start isEmpty. Operand 42854 states and 129588 transitions. [2018-11-28 13:19:17,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-28 13:19:17,098 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:19:17,098 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] [2018-11-28 13:19:17,098 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:19:17,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:17,098 INFO L82 PathProgramCache]: Analyzing trace with hash -744614695, now seen corresponding path program 1 times [2018-11-28 13:19:17,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:19:17,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:19:17,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:17,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:19:17,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:17,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:19:17,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:19:17,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:19:17,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:19:17,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:19:17,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:19:17,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:19:17,130 INFO L87 Difference]: Start difference. First operand 42854 states and 129588 transitions. Second operand 4 states. [2018-11-28 13:19:17,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:19:17,574 INFO L93 Difference]: Finished difference Result 56907 states and 168235 transitions. [2018-11-28 13:19:17,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:19:17,575 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2018-11-28 13:19:17,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:19:17,636 INFO L225 Difference]: With dead ends: 56907 [2018-11-28 13:19:17,636 INFO L226 Difference]: Without dead ends: 56907 [2018-11-28 13:19:17,637 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-11-28 13:19:17,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56907 states. [2018-11-28 13:19:18,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56907 to 51423. [2018-11-28 13:19:18,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51423 states. [2018-11-28 13:19:18,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51423 states to 51423 states and 153222 transitions. [2018-11-28 13:19:18,431 INFO L78 Accepts]: Start accepts. Automaton has 51423 states and 153222 transitions. Word has length 76 [2018-11-28 13:19:18,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:19:18,431 INFO L480 AbstractCegarLoop]: Abstraction has 51423 states and 153222 transitions. [2018-11-28 13:19:18,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:19:18,431 INFO L276 IsEmpty]: Start isEmpty. Operand 51423 states and 153222 transitions. [2018-11-28 13:19:18,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-28 13:19:18,442 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:19:18,442 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] [2018-11-28 13:19:18,443 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:19:18,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:18,443 INFO L82 PathProgramCache]: Analyzing trace with hash 608695002, now seen corresponding path program 1 times [2018-11-28 13:19:18,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:19:18,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:19:18,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:18,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:19:18,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:18,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:19:18,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:19:18,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:19:18,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:19:18,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:19:18,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:19:18,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:19:18,536 INFO L87 Difference]: Start difference. First operand 51423 states and 153222 transitions. Second operand 7 states. [2018-11-28 13:19:19,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:19:19,445 INFO L93 Difference]: Finished difference Result 106618 states and 315348 transitions. [2018-11-28 13:19:19,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-28 13:19:19,445 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 76 [2018-11-28 13:19:19,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:19:19,578 INFO L225 Difference]: With dead ends: 106618 [2018-11-28 13:19:19,578 INFO L226 Difference]: Without dead ends: 106554 [2018-11-28 13:19:19,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2018-11-28 13:19:19,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106554 states. [2018-11-28 13:19:20,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106554 to 56647. [2018-11-28 13:19:20,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56647 states. [2018-11-28 13:19:20,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56647 states to 56647 states and 166937 transitions. [2018-11-28 13:19:20,628 INFO L78 Accepts]: Start accepts. Automaton has 56647 states and 166937 transitions. Word has length 76 [2018-11-28 13:19:20,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:19:20,628 INFO L480 AbstractCegarLoop]: Abstraction has 56647 states and 166937 transitions. [2018-11-28 13:19:20,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:19:20,628 INFO L276 IsEmpty]: Start isEmpty. Operand 56647 states and 166937 transitions. [2018-11-28 13:19:20,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-28 13:19:20,649 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:19:20,649 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] [2018-11-28 13:19:20,649 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:19:20,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:20,650 INFO L82 PathProgramCache]: Analyzing trace with hash 153257945, now seen corresponding path program 1 times [2018-11-28 13:19:20,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:19:20,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:19:20,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:20,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:19:20,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:20,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:19:20,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:19:20,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:19:20,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:19:20,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:19:20,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:19:20,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:19:20,703 INFO L87 Difference]: Start difference. First operand 56647 states and 166937 transitions. Second operand 4 states. [2018-11-28 13:19:21,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:19:21,003 INFO L93 Difference]: Finished difference Result 62874 states and 184413 transitions. [2018-11-28 13:19:21,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:19:21,003 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2018-11-28 13:19:21,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:19:21,073 INFO L225 Difference]: With dead ends: 62874 [2018-11-28 13:19:21,074 INFO L226 Difference]: Without dead ends: 62874 [2018-11-28 13:19:21,074 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-11-28 13:19:21,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62874 states. [2018-11-28 13:19:21,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62874 to 61596. [2018-11-28 13:19:21,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61596 states. [2018-11-28 13:19:21,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61596 states to 61596 states and 180682 transitions. [2018-11-28 13:19:21,742 INFO L78 Accepts]: Start accepts. Automaton has 61596 states and 180682 transitions. Word has length 82 [2018-11-28 13:19:21,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:19:21,743 INFO L480 AbstractCegarLoop]: Abstraction has 61596 states and 180682 transitions. [2018-11-28 13:19:21,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:19:21,743 INFO L276 IsEmpty]: Start isEmpty. Operand 61596 states and 180682 transitions. [2018-11-28 13:19:21,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-28 13:19:21,768 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:19:21,769 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] [2018-11-28 13:19:21,769 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:19:21,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:21,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1923951398, now seen corresponding path program 1 times [2018-11-28 13:19:21,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:19:21,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:19:21,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:21,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:19:21,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:21,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:19:21,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:19:21,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:19:21,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:19:21,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:19:21,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:19:21,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:19:21,809 INFO L87 Difference]: Start difference. First operand 61596 states and 180682 transitions. Second operand 3 states. [2018-11-28 13:19:22,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:19:22,102 INFO L93 Difference]: Finished difference Result 73882 states and 212774 transitions. [2018-11-28 13:19:22,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:19:22,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2018-11-28 13:19:22,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:19:22,183 INFO L225 Difference]: With dead ends: 73882 [2018-11-28 13:19:22,184 INFO L226 Difference]: Without dead ends: 73882 [2018-11-28 13:19:22,184 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-11-28 13:19:22,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73882 states. [2018-11-28 13:19:22,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73882 to 69194. [2018-11-28 13:19:22,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69194 states. [2018-11-28 13:19:23,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69194 states to 69194 states and 200395 transitions. [2018-11-28 13:19:23,002 INFO L78 Accepts]: Start accepts. Automaton has 69194 states and 200395 transitions. Word has length 82 [2018-11-28 13:19:23,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:19:23,002 INFO L480 AbstractCegarLoop]: Abstraction has 69194 states and 200395 transitions. [2018-11-28 13:19:23,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:19:23,002 INFO L276 IsEmpty]: Start isEmpty. Operand 69194 states and 200395 transitions. [2018-11-28 13:19:23,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-28 13:19:23,026 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:19:23,026 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-11-28 13:19:23,026 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:19:23,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:23,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1319576706, now seen corresponding path program 1 times [2018-11-28 13:19:23,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:19:23,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:19:23,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:23,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:19:23,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:23,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:19:23,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:19:23,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:19:23,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:19:23,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:19:23,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:19:23,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:19:23,077 INFO L87 Difference]: Start difference. First operand 69194 states and 200395 transitions. Second operand 4 states. [2018-11-28 13:19:23,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:19:23,394 INFO L93 Difference]: Finished difference Result 75677 states and 216537 transitions. [2018-11-28 13:19:23,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:19:23,395 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2018-11-28 13:19:23,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:19:23,493 INFO L225 Difference]: With dead ends: 75677 [2018-11-28 13:19:23,494 INFO L226 Difference]: Without dead ends: 75677 [2018-11-28 13:19:23,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:19:23,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75677 states. [2018-11-28 13:19:24,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75677 to 70724. [2018-11-28 13:19:24,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70724 states. [2018-11-28 13:19:24,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70724 states to 70724 states and 202400 transitions. [2018-11-28 13:19:24,251 INFO L78 Accepts]: Start accepts. Automaton has 70724 states and 202400 transitions. Word has length 83 [2018-11-28 13:19:24,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:19:24,252 INFO L480 AbstractCegarLoop]: Abstraction has 70724 states and 202400 transitions. [2018-11-28 13:19:24,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:19:24,252 INFO L276 IsEmpty]: Start isEmpty. Operand 70724 states and 202400 transitions. [2018-11-28 13:19:24,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-28 13:19:24,276 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:19:24,276 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-11-28 13:19:24,276 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:19:24,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:24,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1201211927, now seen corresponding path program 1 times [2018-11-28 13:19:24,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:19:24,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:19:24,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:24,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:19:24,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:24,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:19:24,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:19:24,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:19:24,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:19:24,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:19:24,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:19:24,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:19:24,341 INFO L87 Difference]: Start difference. First operand 70724 states and 202400 transitions. Second operand 4 states. [2018-11-28 13:19:24,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:19:24,566 INFO L93 Difference]: Finished difference Result 76557 states and 218374 transitions. [2018-11-28 13:19:24,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:19:24,567 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2018-11-28 13:19:24,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:19:24,655 INFO L225 Difference]: With dead ends: 76557 [2018-11-28 13:19:24,656 INFO L226 Difference]: Without dead ends: 76557 [2018-11-28 13:19:24,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:19:24,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76557 states. [2018-11-28 13:19:25,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76557 to 71702. [2018-11-28 13:19:25,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71702 states. [2018-11-28 13:19:25,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71702 states to 71702 states and 205099 transitions. [2018-11-28 13:19:25,531 INFO L78 Accepts]: Start accepts. Automaton has 71702 states and 205099 transitions. Word has length 83 [2018-11-28 13:19:25,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:19:25,531 INFO L480 AbstractCegarLoop]: Abstraction has 71702 states and 205099 transitions. [2018-11-28 13:19:25,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:19:25,531 INFO L276 IsEmpty]: Start isEmpty. Operand 71702 states and 205099 transitions. [2018-11-28 13:19:25,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-28 13:19:25,555 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:19:25,555 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-11-28 13:19:25,555 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:19:25,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:25,555 INFO L82 PathProgramCache]: Analyzing trace with hash -2103727433, now seen corresponding path program 1 times [2018-11-28 13:19:25,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:19:25,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:19:25,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:25,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:19:25,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:25,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:19:25,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:19:25,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:19:25,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 13:19:25,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 13:19:25,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 13:19:25,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:19:25,655 INFO L87 Difference]: Start difference. First operand 71702 states and 205099 transitions. Second operand 8 states. [2018-11-28 13:19:27,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:19:27,191 INFO L93 Difference]: Finished difference Result 164487 states and 482593 transitions. [2018-11-28 13:19:27,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-28 13:19:27,191 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 83 [2018-11-28 13:19:27,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:19:27,400 INFO L225 Difference]: With dead ends: 164487 [2018-11-28 13:19:27,400 INFO L226 Difference]: Without dead ends: 164487 [2018-11-28 13:19:27,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=183, Invalid=629, Unknown=0, NotChecked=0, Total=812 [2018-11-28 13:19:27,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164487 states. [2018-11-28 13:19:28,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164487 to 99573. [2018-11-28 13:19:28,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99573 states. [2018-11-28 13:19:29,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99573 states to 99573 states and 291954 transitions. [2018-11-28 13:19:29,024 INFO L78 Accepts]: Start accepts. Automaton has 99573 states and 291954 transitions. Word has length 83 [2018-11-28 13:19:29,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:19:29,024 INFO L480 AbstractCegarLoop]: Abstraction has 99573 states and 291954 transitions. [2018-11-28 13:19:29,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 13:19:29,024 INFO L276 IsEmpty]: Start isEmpty. Operand 99573 states and 291954 transitions. [2018-11-28 13:19:29,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-28 13:19:29,060 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:19:29,060 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-11-28 13:19:29,061 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:19:29,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:29,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1216223752, now seen corresponding path program 1 times [2018-11-28 13:19:29,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:19:29,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:19:29,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:29,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:19:29,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:29,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:19:29,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:19:29,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:19:29,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:19:29,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:19:29,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:19:29,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:19:29,097 INFO L87 Difference]: Start difference. First operand 99573 states and 291954 transitions. Second operand 5 states. [2018-11-28 13:19:29,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:19:29,198 INFO L93 Difference]: Finished difference Result 35805 states and 86792 transitions. [2018-11-28 13:19:29,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:19:29,198 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2018-11-28 13:19:29,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:19:29,222 INFO L225 Difference]: With dead ends: 35805 [2018-11-28 13:19:29,222 INFO L226 Difference]: Without dead ends: 31165 [2018-11-28 13:19:29,223 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-11-28 13:19:29,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31165 states. [2018-11-28 13:19:29,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31165 to 26658. [2018-11-28 13:19:29,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26658 states. [2018-11-28 13:19:29,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26658 states to 26658 states and 63590 transitions. [2018-11-28 13:19:29,475 INFO L78 Accepts]: Start accepts. Automaton has 26658 states and 63590 transitions. Word has length 83 [2018-11-28 13:19:29,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:19:29,476 INFO L480 AbstractCegarLoop]: Abstraction has 26658 states and 63590 transitions. [2018-11-28 13:19:29,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:19:29,476 INFO L276 IsEmpty]: Start isEmpty. Operand 26658 states and 63590 transitions. [2018-11-28 13:19:29,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-28 13:19:29,494 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:19:29,494 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:19:29,494 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:19:29,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:29,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1193214669, now seen corresponding path program 1 times [2018-11-28 13:19:29,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:19:29,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:19:29,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:29,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:19:29,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:29,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:19:29,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:19:29,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:19:29,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:19:29,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:19:29,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:19:29,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:19:29,563 INFO L87 Difference]: Start difference. First operand 26658 states and 63590 transitions. Second operand 5 states. [2018-11-28 13:19:29,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:19:29,695 INFO L93 Difference]: Finished difference Result 30725 states and 72487 transitions. [2018-11-28 13:19:29,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:19:29,696 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2018-11-28 13:19:29,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:19:29,726 INFO L225 Difference]: With dead ends: 30725 [2018-11-28 13:19:29,726 INFO L226 Difference]: Without dead ends: 30725 [2018-11-28 13:19:29,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:19:29,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30725 states. [2018-11-28 13:19:29,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30725 to 24444. [2018-11-28 13:19:29,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24444 states. [2018-11-28 13:19:29,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24444 states to 24444 states and 57727 transitions. [2018-11-28 13:19:29,952 INFO L78 Accepts]: Start accepts. Automaton has 24444 states and 57727 transitions. Word has length 111 [2018-11-28 13:19:29,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:19:29,952 INFO L480 AbstractCegarLoop]: Abstraction has 24444 states and 57727 transitions. [2018-11-28 13:19:29,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:19:29,952 INFO L276 IsEmpty]: Start isEmpty. Operand 24444 states and 57727 transitions. [2018-11-28 13:19:29,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-28 13:19:29,969 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:19:29,969 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:19:29,969 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:19:29,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:29,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1752092247, now seen corresponding path program 1 times [2018-11-28 13:19:29,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:19:29,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:19:29,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:29,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:19:29,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:29,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:19:30,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:19:30,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:19:30,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:19:30,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:19:30,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:19:30,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:19:30,022 INFO L87 Difference]: Start difference. First operand 24444 states and 57727 transitions. Second operand 5 states. [2018-11-28 13:19:30,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:19:30,469 INFO L93 Difference]: Finished difference Result 47080 states and 111201 transitions. [2018-11-28 13:19:30,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:19:30,469 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2018-11-28 13:19:30,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:19:30,504 INFO L225 Difference]: With dead ends: 47080 [2018-11-28 13:19:30,504 INFO L226 Difference]: Without dead ends: 47046 [2018-11-28 13:19:30,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:19:30,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47046 states. [2018-11-28 13:19:30,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47046 to 31533. [2018-11-28 13:19:30,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31533 states. [2018-11-28 13:19:30,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31533 states to 31533 states and 75074 transitions. [2018-11-28 13:19:30,845 INFO L78 Accepts]: Start accepts. Automaton has 31533 states and 75074 transitions. Word has length 111 [2018-11-28 13:19:30,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:19:30,845 INFO L480 AbstractCegarLoop]: Abstraction has 31533 states and 75074 transitions. [2018-11-28 13:19:30,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:19:30,846 INFO L276 IsEmpty]: Start isEmpty. Operand 31533 states and 75074 transitions. [2018-11-28 13:19:30,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-28 13:19:30,866 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:19:30,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:19:30,867 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:19:30,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:30,867 INFO L82 PathProgramCache]: Analyzing trace with hash -487123411, now seen corresponding path program 1 times [2018-11-28 13:19:30,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:19:30,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:19:30,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:30,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:19:30,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:30,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:19:31,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:19:31,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:19:31,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 13:19:31,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 13:19:31,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 13:19:31,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:19:31,062 INFO L87 Difference]: Start difference. First operand 31533 states and 75074 transitions. Second operand 8 states. [2018-11-28 13:19:31,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:19:31,639 INFO L93 Difference]: Finished difference Result 43744 states and 102348 transitions. [2018-11-28 13:19:31,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 13:19:31,639 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 111 [2018-11-28 13:19:31,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:19:31,670 INFO L225 Difference]: With dead ends: 43744 [2018-11-28 13:19:31,670 INFO L226 Difference]: Without dead ends: 43630 [2018-11-28 13:19:31,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2018-11-28 13:19:31,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43630 states. [2018-11-28 13:19:31,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43630 to 35834. [2018-11-28 13:19:31,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35834 states. [2018-11-28 13:19:32,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35834 states to 35834 states and 84760 transitions. [2018-11-28 13:19:32,011 INFO L78 Accepts]: Start accepts. Automaton has 35834 states and 84760 transitions. Word has length 111 [2018-11-28 13:19:32,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:19:32,011 INFO L480 AbstractCegarLoop]: Abstraction has 35834 states and 84760 transitions. [2018-11-28 13:19:32,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 13:19:32,012 INFO L276 IsEmpty]: Start isEmpty. Operand 35834 states and 84760 transitions. [2018-11-28 13:19:32,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-28 13:19:32,036 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:19:32,036 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:19:32,037 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:19:32,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:32,037 INFO L82 PathProgramCache]: Analyzing trace with hash -741859956, now seen corresponding path program 1 times [2018-11-28 13:19:32,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:19:32,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:19:32,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:32,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:19:32,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:32,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:19:32,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:19:32,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:19:32,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:19:32,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:19:32,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:19:32,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:19:32,119 INFO L87 Difference]: Start difference. First operand 35834 states and 84760 transitions. Second operand 7 states. [2018-11-28 13:19:32,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:19:32,623 INFO L93 Difference]: Finished difference Result 48625 states and 113563 transitions. [2018-11-28 13:19:32,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 13:19:32,624 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 111 [2018-11-28 13:19:32,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:19:32,658 INFO L225 Difference]: With dead ends: 48625 [2018-11-28 13:19:32,658 INFO L226 Difference]: Without dead ends: 48625 [2018-11-28 13:19:32,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-11-28 13:19:32,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48625 states. [2018-11-28 13:19:33,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48625 to 40609. [2018-11-28 13:19:33,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40609 states. [2018-11-28 13:19:33,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40609 states to 40609 states and 95200 transitions. [2018-11-28 13:19:33,045 INFO L78 Accepts]: Start accepts. Automaton has 40609 states and 95200 transitions. Word has length 111 [2018-11-28 13:19:33,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:19:33,045 INFO L480 AbstractCegarLoop]: Abstraction has 40609 states and 95200 transitions. [2018-11-28 13:19:33,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:19:33,045 INFO L276 IsEmpty]: Start isEmpty. Operand 40609 states and 95200 transitions. [2018-11-28 13:19:33,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-28 13:19:33,072 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:19:33,072 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:19:33,072 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:19:33,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:33,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1491337810, now seen corresponding path program 2 times [2018-11-28 13:19:33,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:19:33,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:19:33,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:33,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:19:33,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:33,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:19:33,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:19:33,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:19:33,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:19:33,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:19:33,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:19:33,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:19:33,147 INFO L87 Difference]: Start difference. First operand 40609 states and 95200 transitions. Second operand 5 states. [2018-11-28 13:19:33,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:19:33,421 INFO L93 Difference]: Finished difference Result 41358 states and 96869 transitions. [2018-11-28 13:19:33,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:19:33,422 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2018-11-28 13:19:33,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:19:33,456 INFO L225 Difference]: With dead ends: 41358 [2018-11-28 13:19:33,456 INFO L226 Difference]: Without dead ends: 41358 [2018-11-28 13:19:33,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:19:33,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41358 states. [2018-11-28 13:19:33,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41358 to 41003. [2018-11-28 13:19:33,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41003 states. [2018-11-28 13:19:33,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41003 states to 41003 states and 96095 transitions. [2018-11-28 13:19:33,796 INFO L78 Accepts]: Start accepts. Automaton has 41003 states and 96095 transitions. Word has length 111 [2018-11-28 13:19:33,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:19:33,796 INFO L480 AbstractCegarLoop]: Abstraction has 41003 states and 96095 transitions. [2018-11-28 13:19:33,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:19:33,796 INFO L276 IsEmpty]: Start isEmpty. Operand 41003 states and 96095 transitions. [2018-11-28 13:19:33,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-28 13:19:33,824 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:19:33,825 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:19:33,825 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:19:33,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:33,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1009887957, now seen corresponding path program 1 times [2018-11-28 13:19:33,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:19:33,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:19:33,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:33,826 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:19:33,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:33,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:19:33,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:19:33,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:19:33,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:19:33,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:19:33,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:19:33,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:19:33,912 INFO L87 Difference]: Start difference. First operand 41003 states and 96095 transitions. Second operand 7 states. [2018-11-28 13:19:34,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:19:34,546 INFO L93 Difference]: Finished difference Result 49932 states and 117212 transitions. [2018-11-28 13:19:34,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 13:19:34,546 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2018-11-28 13:19:34,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:19:34,581 INFO L225 Difference]: With dead ends: 49932 [2018-11-28 13:19:34,581 INFO L226 Difference]: Without dead ends: 49932 [2018-11-28 13:19:34,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-11-28 13:19:34,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49932 states. [2018-11-28 13:19:34,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49932 to 42979. [2018-11-28 13:19:34,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42979 states. [2018-11-28 13:19:34,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42979 states to 42979 states and 101022 transitions. [2018-11-28 13:19:34,973 INFO L78 Accepts]: Start accepts. Automaton has 42979 states and 101022 transitions. Word has length 113 [2018-11-28 13:19:34,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:19:34,973 INFO L480 AbstractCegarLoop]: Abstraction has 42979 states and 101022 transitions. [2018-11-28 13:19:34,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:19:34,973 INFO L276 IsEmpty]: Start isEmpty. Operand 42979 states and 101022 transitions. [2018-11-28 13:19:35,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-28 13:19:35,006 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:19:35,006 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:19:35,006 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:19:35,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:35,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1971910951, now seen corresponding path program 1 times [2018-11-28 13:19:35,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:19:35,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:19:35,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:35,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:19:35,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:35,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:19:35,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:19:35,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:19:35,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:19:35,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:19:35,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:19:35,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:19:35,144 INFO L87 Difference]: Start difference. First operand 42979 states and 101022 transitions. Second operand 7 states. [2018-11-28 13:19:35,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:19:35,457 INFO L93 Difference]: Finished difference Result 55831 states and 129811 transitions. [2018-11-28 13:19:35,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:19:35,458 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2018-11-28 13:19:35,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:19:35,512 INFO L225 Difference]: With dead ends: 55831 [2018-11-28 13:19:35,512 INFO L226 Difference]: Without dead ends: 55831 [2018-11-28 13:19:35,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:19:35,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55831 states. [2018-11-28 13:19:35,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55831 to 46159. [2018-11-28 13:19:35,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46159 states. [2018-11-28 13:19:35,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46159 states to 46159 states and 108204 transitions. [2018-11-28 13:19:35,992 INFO L78 Accepts]: Start accepts. Automaton has 46159 states and 108204 transitions. Word has length 113 [2018-11-28 13:19:35,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:19:35,992 INFO L480 AbstractCegarLoop]: Abstraction has 46159 states and 108204 transitions. [2018-11-28 13:19:35,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:19:35,993 INFO L276 IsEmpty]: Start isEmpty. Operand 46159 states and 108204 transitions. [2018-11-28 13:19:36,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-28 13:19:36,024 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:19:36,024 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:19:36,024 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:19:36,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:36,025 INFO L82 PathProgramCache]: Analyzing trace with hash 245847002, now seen corresponding path program 1 times [2018-11-28 13:19:36,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:19:36,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:19:36,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:36,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:19:36,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:36,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:19:36,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:19:36,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:19:36,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:19:36,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:19:36,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:19:36,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:19:36,140 INFO L87 Difference]: Start difference. First operand 46159 states and 108204 transitions. Second operand 7 states. [2018-11-28 13:19:36,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:19:36,304 INFO L93 Difference]: Finished difference Result 50952 states and 118831 transitions. [2018-11-28 13:19:36,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:19:36,305 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2018-11-28 13:19:36,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:19:36,344 INFO L225 Difference]: With dead ends: 50952 [2018-11-28 13:19:36,344 INFO L226 Difference]: Without dead ends: 50952 [2018-11-28 13:19:36,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-11-28 13:19:36,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50952 states. [2018-11-28 13:19:36,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50952 to 40821. [2018-11-28 13:19:36,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40821 states. [2018-11-28 13:19:36,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40821 states to 40821 states and 95748 transitions. [2018-11-28 13:19:36,722 INFO L78 Accepts]: Start accepts. Automaton has 40821 states and 95748 transitions. Word has length 113 [2018-11-28 13:19:36,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:19:36,722 INFO L480 AbstractCegarLoop]: Abstraction has 40821 states and 95748 transitions. [2018-11-28 13:19:36,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:19:36,722 INFO L276 IsEmpty]: Start isEmpty. Operand 40821 states and 95748 transitions. [2018-11-28 13:19:36,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-28 13:19:36,749 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:19:36,749 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:19:36,749 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:19:36,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:36,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1486128550, now seen corresponding path program 1 times [2018-11-28 13:19:36,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:19:36,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:19:36,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:36,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:19:36,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:36,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:19:36,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:19:36,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:19:36,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:19:36,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:19:36,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:19:36,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:19:36,829 INFO L87 Difference]: Start difference. First operand 40821 states and 95748 transitions. Second operand 6 states. [2018-11-28 13:19:36,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:19:36,966 INFO L93 Difference]: Finished difference Result 40677 states and 95164 transitions. [2018-11-28 13:19:36,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:19:36,967 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2018-11-28 13:19:36,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:19:36,995 INFO L225 Difference]: With dead ends: 40677 [2018-11-28 13:19:36,995 INFO L226 Difference]: Without dead ends: 40677 [2018-11-28 13:19:36,996 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-11-28 13:19:37,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40677 states. [2018-11-28 13:19:37,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40677 to 35320. [2018-11-28 13:19:37,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35320 states. [2018-11-28 13:19:37,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35320 states to 35320 states and 83016 transitions. [2018-11-28 13:19:37,437 INFO L78 Accepts]: Start accepts. Automaton has 35320 states and 83016 transitions. Word has length 113 [2018-11-28 13:19:37,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:19:37,437 INFO L480 AbstractCegarLoop]: Abstraction has 35320 states and 83016 transitions. [2018-11-28 13:19:37,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:19:37,438 INFO L276 IsEmpty]: Start isEmpty. Operand 35320 states and 83016 transitions. [2018-11-28 13:19:37,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-28 13:19:37,460 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:19:37,460 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:19:37,460 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:19:37,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:37,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1080307527, now seen corresponding path program 1 times [2018-11-28 13:19:37,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:19:37,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:19:37,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:37,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:19:37,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:37,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:19:37,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:19:37,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:19:37,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:19:37,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:19:37,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:19:37,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:19:37,519 INFO L87 Difference]: Start difference. First operand 35320 states and 83016 transitions. Second operand 6 states. [2018-11-28 13:19:37,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:19:37,847 INFO L93 Difference]: Finished difference Result 39296 states and 91632 transitions. [2018-11-28 13:19:37,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:19:37,848 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2018-11-28 13:19:37,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:19:37,880 INFO L225 Difference]: With dead ends: 39296 [2018-11-28 13:19:37,881 INFO L226 Difference]: Without dead ends: 39296 [2018-11-28 13:19:37,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-11-28 13:19:37,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39296 states. [2018-11-28 13:19:38,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39296 to 35405. [2018-11-28 13:19:38,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35405 states. [2018-11-28 13:19:38,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35405 states to 35405 states and 83175 transitions. [2018-11-28 13:19:38,260 INFO L78 Accepts]: Start accepts. Automaton has 35405 states and 83175 transitions. Word has length 113 [2018-11-28 13:19:38,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:19:38,260 INFO L480 AbstractCegarLoop]: Abstraction has 35405 states and 83175 transitions. [2018-11-28 13:19:38,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:19:38,260 INFO L276 IsEmpty]: Start isEmpty. Operand 35405 states and 83175 transitions. [2018-11-28 13:19:38,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-28 13:19:38,288 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:19:38,289 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:19:38,289 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:19:38,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:38,289 INFO L82 PathProgramCache]: Analyzing trace with hash 314506688, now seen corresponding path program 1 times [2018-11-28 13:19:38,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:19:38,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:19:38,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:38,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:19:38,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:38,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:19:38,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:19:38,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:19:38,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:19:38,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:19:38,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:19:38,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:19:38,365 INFO L87 Difference]: Start difference. First operand 35405 states and 83175 transitions. Second operand 7 states. [2018-11-28 13:19:38,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:19:38,632 INFO L93 Difference]: Finished difference Result 43483 states and 100130 transitions. [2018-11-28 13:19:38,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:19:38,632 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2018-11-28 13:19:38,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:19:38,670 INFO L225 Difference]: With dead ends: 43483 [2018-11-28 13:19:38,670 INFO L226 Difference]: Without dead ends: 43438 [2018-11-28 13:19:38,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:19:38,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43438 states. [2018-11-28 13:19:39,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43438 to 35826. [2018-11-28 13:19:39,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35826 states. [2018-11-28 13:19:39,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35826 states to 35826 states and 83271 transitions. [2018-11-28 13:19:39,091 INFO L78 Accepts]: Start accepts. Automaton has 35826 states and 83271 transitions. Word has length 115 [2018-11-28 13:19:39,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:19:39,091 INFO L480 AbstractCegarLoop]: Abstraction has 35826 states and 83271 transitions. [2018-11-28 13:19:39,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:19:39,091 INFO L276 IsEmpty]: Start isEmpty. Operand 35826 states and 83271 transitions. [2018-11-28 13:19:39,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-28 13:19:39,120 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:19:39,120 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:19:39,121 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:19:39,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:39,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1762702655, now seen corresponding path program 1 times [2018-11-28 13:19:39,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:19:39,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:19:39,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:39,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:19:39,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:39,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:19:39,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:19:39,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:19:39,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:19:39,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:19:39,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:19:39,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:19:39,228 INFO L87 Difference]: Start difference. First operand 35826 states and 83271 transitions. Second operand 7 states. [2018-11-28 13:19:39,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:19:39,642 INFO L93 Difference]: Finished difference Result 43353 states and 98874 transitions. [2018-11-28 13:19:39,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 13:19:39,643 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2018-11-28 13:19:39,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:19:39,679 INFO L225 Difference]: With dead ends: 43353 [2018-11-28 13:19:39,680 INFO L226 Difference]: Without dead ends: 43327 [2018-11-28 13:19:39,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-11-28 13:19:39,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43327 states. [2018-11-28 13:19:40,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43327 to 38315. [2018-11-28 13:19:40,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38315 states. [2018-11-28 13:19:40,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38315 states to 38315 states and 87978 transitions. [2018-11-28 13:19:40,109 INFO L78 Accepts]: Start accepts. Automaton has 38315 states and 87978 transitions. Word has length 115 [2018-11-28 13:19:40,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:19:40,109 INFO L480 AbstractCegarLoop]: Abstraction has 38315 states and 87978 transitions. [2018-11-28 13:19:40,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:19:40,110 INFO L276 IsEmpty]: Start isEmpty. Operand 38315 states and 87978 transitions. [2018-11-28 13:19:40,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-28 13:19:40,141 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:19:40,142 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:19:40,142 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:19:40,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:40,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1551351742, now seen corresponding path program 1 times [2018-11-28 13:19:40,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:19:40,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:19:40,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:40,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:19:40,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:40,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:19:40,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:19:40,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:19:40,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:19:40,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:19:40,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:19:40,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:19:40,241 INFO L87 Difference]: Start difference. First operand 38315 states and 87978 transitions. Second operand 7 states. [2018-11-28 13:19:40,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:19:40,517 INFO L93 Difference]: Finished difference Result 39400 states and 90311 transitions. [2018-11-28 13:19:40,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:19:40,517 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2018-11-28 13:19:40,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:19:40,553 INFO L225 Difference]: With dead ends: 39400 [2018-11-28 13:19:40,553 INFO L226 Difference]: Without dead ends: 39400 [2018-11-28 13:19:40,553 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-11-28 13:19:40,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39400 states. [2018-11-28 13:19:40,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39400 to 38762. [2018-11-28 13:19:40,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38762 states. [2018-11-28 13:19:41,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38762 states to 38762 states and 89014 transitions. [2018-11-28 13:19:41,154 INFO L78 Accepts]: Start accepts. Automaton has 38762 states and 89014 transitions. Word has length 115 [2018-11-28 13:19:41,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:19:41,154 INFO L480 AbstractCegarLoop]: Abstraction has 38762 states and 89014 transitions. [2018-11-28 13:19:41,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:19:41,154 INFO L276 IsEmpty]: Start isEmpty. Operand 38762 states and 89014 transitions. [2018-11-28 13:19:41,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-28 13:19:41,181 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:19:41,181 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:19:41,181 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:19:41,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:41,181 INFO L82 PathProgramCache]: Analyzing trace with hash -663848061, now seen corresponding path program 1 times [2018-11-28 13:19:41,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:19:41,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:19:41,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:41,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:19:41,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:41,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:19:41,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:19:41,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:19:41,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:19:41,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:19:41,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:19:41,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:19:41,204 INFO L87 Difference]: Start difference. First operand 38762 states and 89014 transitions. Second operand 3 states. [2018-11-28 13:19:41,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:19:41,292 INFO L93 Difference]: Finished difference Result 48487 states and 110200 transitions. [2018-11-28 13:19:41,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:19:41,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2018-11-28 13:19:41,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:19:41,327 INFO L225 Difference]: With dead ends: 48487 [2018-11-28 13:19:41,327 INFO L226 Difference]: Without dead ends: 48487 [2018-11-28 13:19:41,327 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-11-28 13:19:41,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48487 states. [2018-11-28 13:19:41,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48487 to 48047. [2018-11-28 13:19:41,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48047 states. [2018-11-28 13:19:41,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48047 states to 48047 states and 109239 transitions. [2018-11-28 13:19:41,719 INFO L78 Accepts]: Start accepts. Automaton has 48047 states and 109239 transitions. Word has length 115 [2018-11-28 13:19:41,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:19:41,719 INFO L480 AbstractCegarLoop]: Abstraction has 48047 states and 109239 transitions. [2018-11-28 13:19:41,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:19:41,719 INFO L276 IsEmpty]: Start isEmpty. Operand 48047 states and 109239 transitions. [2018-11-28 13:19:41,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-28 13:19:41,750 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:19:41,750 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:19:41,750 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:19:41,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:41,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1061632836, now seen corresponding path program 1 times [2018-11-28 13:19:41,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:19:41,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:19:41,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:41,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:19:41,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:41,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:19:41,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:19:41,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:19:41,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-11-28 13:19:41,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-28 13:19:41,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-28 13:19:41,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2018-11-28 13:19:41,877 INFO L87 Difference]: Start difference. First operand 48047 states and 109239 transitions. Second operand 15 states. [2018-11-28 13:19:42,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:19:42,673 INFO L93 Difference]: Finished difference Result 77100 states and 175365 transitions. [2018-11-28 13:19:42,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-28 13:19:42,673 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 115 [2018-11-28 13:19:42,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:19:42,723 INFO L225 Difference]: With dead ends: 77100 [2018-11-28 13:19:42,723 INFO L226 Difference]: Without dead ends: 66396 [2018-11-28 13:19:42,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=730, Unknown=0, NotChecked=0, Total=870 [2018-11-28 13:19:42,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66396 states. [2018-11-28 13:19:43,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66396 to 54690. [2018-11-28 13:19:43,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54690 states. [2018-11-28 13:19:43,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54690 states to 54690 states and 123661 transitions. [2018-11-28 13:19:43,228 INFO L78 Accepts]: Start accepts. Automaton has 54690 states and 123661 transitions. Word has length 115 [2018-11-28 13:19:43,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:19:43,229 INFO L480 AbstractCegarLoop]: Abstraction has 54690 states and 123661 transitions. [2018-11-28 13:19:43,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-28 13:19:43,229 INFO L276 IsEmpty]: Start isEmpty. Operand 54690 states and 123661 transitions. [2018-11-28 13:19:43,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-28 13:19:43,269 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:19:43,269 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:19:43,269 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:19:43,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:43,269 INFO L82 PathProgramCache]: Analyzing trace with hash 2085529924, now seen corresponding path program 2 times [2018-11-28 13:19:43,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:19:43,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:19:43,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:43,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:19:43,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:43,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:19:43,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:19:43,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:19:43,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-11-28 13:19:43,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-28 13:19:43,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-28 13:19:43,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-11-28 13:19:43,456 INFO L87 Difference]: Start difference. First operand 54690 states and 123661 transitions. Second operand 15 states. [2018-11-28 13:19:44,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:19:44,544 INFO L93 Difference]: Finished difference Result 136447 states and 309842 transitions. [2018-11-28 13:19:44,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-28 13:19:44,544 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 115 [2018-11-28 13:19:44,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:19:44,663 INFO L225 Difference]: With dead ends: 136447 [2018-11-28 13:19:44,663 INFO L226 Difference]: Without dead ends: 104393 [2018-11-28 13:19:44,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 674 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=350, Invalid=2100, Unknown=0, NotChecked=0, Total=2450 [2018-11-28 13:19:44,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104393 states. [2018-11-28 13:19:45,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104393 to 64945. [2018-11-28 13:19:45,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64945 states. [2018-11-28 13:19:45,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64945 states to 64945 states and 145373 transitions. [2018-11-28 13:19:45,501 INFO L78 Accepts]: Start accepts. Automaton has 64945 states and 145373 transitions. Word has length 115 [2018-11-28 13:19:45,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:19:45,501 INFO L480 AbstractCegarLoop]: Abstraction has 64945 states and 145373 transitions. [2018-11-28 13:19:45,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-28 13:19:45,501 INFO L276 IsEmpty]: Start isEmpty. Operand 64945 states and 145373 transitions. [2018-11-28 13:19:45,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-28 13:19:45,546 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:19:45,547 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:19:45,547 INFO L423 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:19:45,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:45,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1577768648, now seen corresponding path program 3 times [2018-11-28 13:19:45,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:19:45,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:19:45,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:45,548 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:19:45,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:45,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:19:45,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:19:45,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:19:45,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-11-28 13:19:45,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-28 13:19:45,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-28 13:19:45,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-11-28 13:19:45,679 INFO L87 Difference]: Start difference. First operand 64945 states and 145373 transitions. Second operand 15 states. [2018-11-28 13:19:46,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:19:46,523 INFO L93 Difference]: Finished difference Result 87922 states and 197773 transitions. [2018-11-28 13:19:46,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-28 13:19:46,523 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 115 [2018-11-28 13:19:46,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:19:46,581 INFO L225 Difference]: With dead ends: 87922 [2018-11-28 13:19:46,581 INFO L226 Difference]: Without dead ends: 78507 [2018-11-28 13:19:46,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=316, Invalid=1406, Unknown=0, NotChecked=0, Total=1722 [2018-11-28 13:19:46,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78507 states. [2018-11-28 13:19:47,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78507 to 65842. [2018-11-28 13:19:47,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65842 states. [2018-11-28 13:19:47,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65842 states to 65842 states and 147414 transitions. [2018-11-28 13:19:47,294 INFO L78 Accepts]: Start accepts. Automaton has 65842 states and 147414 transitions. Word has length 115 [2018-11-28 13:19:47,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:19:47,294 INFO L480 AbstractCegarLoop]: Abstraction has 65842 states and 147414 transitions. [2018-11-28 13:19:47,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-28 13:19:47,294 INFO L276 IsEmpty]: Start isEmpty. Operand 65842 states and 147414 transitions. [2018-11-28 13:19:47,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-28 13:19:47,353 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:19:47,353 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:19:47,353 INFO L423 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:19:47,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:47,353 INFO L82 PathProgramCache]: Analyzing trace with hash 861923247, now seen corresponding path program 1 times [2018-11-28 13:19:47,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:19:47,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:19:47,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:47,354 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:19:47,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:47,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:19:47,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:19:47,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:19:47,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-11-28 13:19:47,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-28 13:19:47,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-28 13:19:47,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-11-28 13:19:47,539 INFO L87 Difference]: Start difference. First operand 65842 states and 147414 transitions. Second operand 19 states. [2018-11-28 13:19:48,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:19:48,395 INFO L93 Difference]: Finished difference Result 85425 states and 193021 transitions. [2018-11-28 13:19:48,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-28 13:19:48,395 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 115 [2018-11-28 13:19:48,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:19:48,467 INFO L225 Difference]: With dead ends: 85425 [2018-11-28 13:19:48,467 INFO L226 Difference]: Without dead ends: 80388 [2018-11-28 13:19:48,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=296, Invalid=1510, Unknown=0, NotChecked=0, Total=1806 [2018-11-28 13:19:48,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80388 states. [2018-11-28 13:19:49,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80388 to 69469. [2018-11-28 13:19:49,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69469 states. [2018-11-28 13:19:49,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69469 states to 69469 states and 155755 transitions. [2018-11-28 13:19:49,349 INFO L78 Accepts]: Start accepts. Automaton has 69469 states and 155755 transitions. Word has length 115 [2018-11-28 13:19:49,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:19:49,350 INFO L480 AbstractCegarLoop]: Abstraction has 69469 states and 155755 transitions. [2018-11-28 13:19:49,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-28 13:19:49,350 INFO L276 IsEmpty]: Start isEmpty. Operand 69469 states and 155755 transitions. [2018-11-28 13:19:49,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-28 13:19:49,412 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:19:49,412 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:19:49,412 INFO L423 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:19:49,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:49,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1369109039, now seen corresponding path program 2 times [2018-11-28 13:19:49,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:19:49,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:19:49,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:49,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:19:49,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:49,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:19:49,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:19:49,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:19:49,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-11-28 13:19:49,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-28 13:19:49,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-28 13:19:49,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-11-28 13:19:49,557 INFO L87 Difference]: Start difference. First operand 69469 states and 155755 transitions. Second operand 16 states. [2018-11-28 13:19:50,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:19:50,412 INFO L93 Difference]: Finished difference Result 83313 states and 187104 transitions. [2018-11-28 13:19:50,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-28 13:19:50,412 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 115 [2018-11-28 13:19:50,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:19:50,482 INFO L225 Difference]: With dead ends: 83313 [2018-11-28 13:19:50,483 INFO L226 Difference]: Without dead ends: 78515 [2018-11-28 13:19:50,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=228, Invalid=1104, Unknown=0, NotChecked=0, Total=1332 [2018-11-28 13:19:50,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78515 states. [2018-11-28 13:19:51,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78515 to 64966. [2018-11-28 13:19:51,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64966 states. [2018-11-28 13:19:51,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64966 states to 64966 states and 145595 transitions. [2018-11-28 13:19:51,216 INFO L78 Accepts]: Start accepts. Automaton has 64966 states and 145595 transitions. Word has length 115 [2018-11-28 13:19:51,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:19:51,217 INFO L480 AbstractCegarLoop]: Abstraction has 64966 states and 145595 transitions. [2018-11-28 13:19:51,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-28 13:19:51,217 INFO L276 IsEmpty]: Start isEmpty. Operand 64966 states and 145595 transitions. [2018-11-28 13:19:51,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-28 13:19:51,284 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:19:51,284 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:19:51,285 INFO L423 AbstractCegarLoop]: === Iteration 40 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:19:51,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:51,285 INFO L82 PathProgramCache]: Analyzing trace with hash -312631492, now seen corresponding path program 1 times [2018-11-28 13:19:51,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:19:51,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:19:51,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:51,287 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:19:51,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:51,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:19:51,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:19:51,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:19:51,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 13:19:51,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 13:19:51,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 13:19:51,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-28 13:19:51,396 INFO L87 Difference]: Start difference. First operand 64966 states and 145595 transitions. Second operand 10 states. [2018-11-28 13:19:51,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:19:51,849 INFO L93 Difference]: Finished difference Result 73071 states and 163574 transitions. [2018-11-28 13:19:51,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:19:51,849 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 115 [2018-11-28 13:19:51,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:19:51,854 INFO L225 Difference]: With dead ends: 73071 [2018-11-28 13:19:51,855 INFO L226 Difference]: Without dead ends: 6815 [2018-11-28 13:19:51,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2018-11-28 13:19:51,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6815 states. [2018-11-28 13:19:51,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6815 to 6815. [2018-11-28 13:19:51,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6815 states. [2018-11-28 13:19:51,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6815 states to 6815 states and 15903 transitions. [2018-11-28 13:19:51,907 INFO L78 Accepts]: Start accepts. Automaton has 6815 states and 15903 transitions. Word has length 115 [2018-11-28 13:19:51,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:19:51,908 INFO L480 AbstractCegarLoop]: Abstraction has 6815 states and 15903 transitions. [2018-11-28 13:19:51,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 13:19:51,908 INFO L276 IsEmpty]: Start isEmpty. Operand 6815 states and 15903 transitions. [2018-11-28 13:19:51,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-28 13:19:51,913 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:19:51,913 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:19:51,913 INFO L423 AbstractCegarLoop]: === Iteration 41 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:19:51,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:51,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1293718377, now seen corresponding path program 2 times [2018-11-28 13:19:51,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:19:51,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:19:51,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:51,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:19:51,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:51,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:19:51,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:19:51,966 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 13:19:52,067 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-11-28 13:19:52,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 01:19:52 BasicIcfg [2018-11-28 13:19:52,069 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 13:19:52,069 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 13:19:52,069 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 13:19:52,069 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 13:19:52,070 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:18:03" (3/4) ... [2018-11-28 13:19:52,072 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 13:19:52,167 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_ea192c6a-b426-4e33-a229-635547cb42a4/bin-2019/uautomizer/witness.graphml [2018-11-28 13:19:52,167 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 13:19:52,168 INFO L168 Benchmark]: Toolchain (without parser) took 110131.53 ms. Allocated memory was 1.0 GB in the beginning and 7.6 GB in the end (delta: 6.6 GB). Free memory was 951.3 MB in the beginning and 3.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 4.6 GB. Max. memory is 11.5 GB. [2018-11-28 13:19:52,170 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:19:52,171 INFO L168 Benchmark]: CACSL2BoogieTranslator took 391.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -170.2 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. [2018-11-28 13:19:52,171 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-28 13:19:52,171 INFO L168 Benchmark]: Boogie Preprocessor took 30.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-28 13:19:52,171 INFO L168 Benchmark]: RCFGBuilder took 655.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.8 MB). Peak memory consumption was 58.8 MB. Max. memory is 11.5 GB. [2018-11-28 13:19:52,172 INFO L168 Benchmark]: TraceAbstraction took 108909.70 ms. Allocated memory was 1.2 GB in the beginning and 7.6 GB in the end (delta: 6.4 GB). Free memory was 1.1 GB in the beginning and 3.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 4.5 GB. Max. memory is 11.5 GB. [2018-11-28 13:19:52,172 INFO L168 Benchmark]: Witness Printer took 98.34 ms. Allocated memory is still 7.6 GB. Free memory was 3.0 GB in the beginning and 3.0 GB in the end (delta: 47.1 MB). Peak memory consumption was 47.1 MB. Max. memory is 11.5 GB. [2018-11-28 13:19:52,173 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 391.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -170.2 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 655.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.8 MB). Peak memory consumption was 58.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 108909.70 ms. Allocated memory was 1.2 GB in the beginning and 7.6 GB in the end (delta: 6.4 GB). Free memory was 1.1 GB in the beginning and 3.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 4.5 GB. Max. memory is 11.5 GB. * Witness Printer took 98.34 ms. Allocated memory is still 7.6 GB. Free memory was 3.0 GB in the beginning and 3.0 GB in the end (delta: 47.1 MB). Peak memory consumption was 47.1 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_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L678] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L680] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L681] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L682] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L684] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L686] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L687] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L688] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L689] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L690] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L691] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L692] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L693] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L694] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L695] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L696] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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}] [L697] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L698] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L699] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L700] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L701] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L702] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L794] -1 pthread_t t0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L795] FCALL, FORK -1 pthread_create(&t0, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L796] -1 pthread_t t1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L797] FCALL, FORK -1 pthread_create(&t1, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L706] 0 y$w_buff1 = y$w_buff0 [L707] 0 y$w_buff0 = 1 [L708] 0 y$w_buff1_used = y$w_buff0_used [L709] 0 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L711] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L712] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L713] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L714] 0 y$r_buff0_thd1 = (_Bool)1 [L717] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L718] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L719] 0 y$flush_delayed = weak$$choice2 [L720] 0 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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] [L721] EXPR 0 !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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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] [L721] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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] [L721] EXPR 0 !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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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] [L721] 0 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) [L722] EXPR 0 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_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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] [L722] 0 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)) [L723] EXPR 0 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_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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] [L723] 0 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)) [L724] EXPR 0 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=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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] [L724] 0 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)) [L725] EXPR 0 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=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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] [L725] 0 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)) [L726] EXPR 0 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=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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] [L726] 0 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)) [L727] EXPR 0 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=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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] [L727] 0 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)) [L728] 0 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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] [L729] EXPR 0 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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] [L729] 0 y = y$flush_delayed ? y$mem_tmp : y [L730] 0 y$flush_delayed = (_Bool)0 [L733] 0 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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] [L750] 1 x = 1 [L753] 1 __unbuffered_p1_EAX = x [L756] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L757] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L758] 1 y$flush_delayed = weak$$choice2 [L759] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, 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] [L760] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, 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] [L760] 1 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L761] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? 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=1, 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] [L761] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L736] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, 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] [L762] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? 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=1, 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] [L762] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L763] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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] [L763] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L764] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_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=1, 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] [L764] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L765] EXPR 1 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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] [L765] 1 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L766] EXPR 1 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_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=1, 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] [L766] 1 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L767] 1 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, 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] [L768] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, 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] [L768] 1 y = y$flush_delayed ? y$mem_tmp : y [L769] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, 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] [L772] EXPR 1 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=1, __unbuffered_p0_EBX=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=1, 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] [L772] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, 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, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L772] EXPR 1 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=1, __unbuffered_p0_EBX=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=1, 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_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L772] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L773] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, 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_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L774] EXPR 1 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=1, __unbuffered_p0_EBX=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=1, 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_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] 1 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 [L775] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, 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_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L775] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L776] EXPR 1 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=1, __unbuffered_p0_EBX=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=1, 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_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L776] 1 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 [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, 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] [L736] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L737] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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] [L737] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L738] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L738] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L739] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L740] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L743] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L799] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 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=1, __unbuffered_p0_EBX=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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L803] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 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=1, __unbuffered_p0_EBX=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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L803] -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) [L804] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L804] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L805] 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=1, __unbuffered_p0_EBX=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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L805] -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 [L806] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L806] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L807] 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=1, __unbuffered_p0_EBX=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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L807] -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 [L810] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L5] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L5] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 308 locations, 3 error locations. UNSAFE Result, 108.8s OverallTime, 41 OverallIterations, 1 TraceHistogramMax, 31.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 19399 SDtfs, 26123 SDslu, 75430 SDs, 0 SdLazy, 18244 SolverSat, 1164 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 598 GetRequests, 118 SyntacticMatches, 34 SemanticMatches, 446 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2035 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=256642occurred in iteration=6, 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: 62.3s AutomataMinimizationTime, 40 MinimizatonAttempts, 912392 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 3715 NumberOfCodeBlocks, 3715 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 3560 ConstructedInterpolants, 0 QuantifiedInterpolants, 1036400 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 40 InterpolantComputations, 40 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...