./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix042_rmo.opt_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_7db86aba-2984-4a40-b6de-4c3110e7ef4c/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7db86aba-2984-4a40-b6de-4c3110e7ef4c/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7db86aba-2984-4a40-b6de-4c3110e7ef4c/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7db86aba-2984-4a40-b6de-4c3110e7ef4c/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix042_rmo.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_7db86aba-2984-4a40-b6de-4c3110e7ef4c/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7db86aba-2984-4a40-b6de-4c3110e7ef4c/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 a99d57a1eed70a2c92247fcea50713c025ae5730 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:01:25,138 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 13:01:25,139 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 13:01:25,146 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 13:01:25,146 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 13:01:25,147 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 13:01:25,148 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 13:01:25,149 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 13:01:25,150 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 13:01:25,151 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 13:01:25,151 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 13:01:25,151 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 13:01:25,152 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 13:01:25,152 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 13:01:25,153 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 13:01:25,153 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 13:01:25,154 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 13:01:25,155 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 13:01:25,156 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 13:01:25,157 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 13:01:25,158 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 13:01:25,158 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 13:01:25,159 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 13:01:25,159 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 13:01:25,160 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 13:01:25,160 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 13:01:25,161 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 13:01:25,161 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 13:01:25,162 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 13:01:25,162 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 13:01:25,162 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 13:01:25,163 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 13:01:25,163 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 13:01:25,163 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 13:01:25,164 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 13:01:25,164 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 13:01:25,165 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7db86aba-2984-4a40-b6de-4c3110e7ef4c/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 13:01:25,172 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 13:01:25,172 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 13:01:25,173 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 13:01:25,173 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 13:01:25,173 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 13:01:25,173 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 13:01:25,173 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 13:01:25,173 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 13:01:25,173 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 13:01:25,174 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 13:01:25,174 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 13:01:25,174 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 13:01:25,174 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 13:01:25,174 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 13:01:25,174 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 13:01:25,174 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 13:01:25,174 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 13:01:25,174 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 13:01:25,174 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 13:01:25,174 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 13:01:25,174 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 13:01:25,175 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 13:01:25,175 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 13:01:25,175 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 13:01:25,175 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 13:01:25,175 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 13:01:25,175 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 13:01:25,175 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 13:01:25,175 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 13:01:25,175 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 13:01:25,175 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_7db86aba-2984-4a40-b6de-4c3110e7ef4c/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 -> a99d57a1eed70a2c92247fcea50713c025ae5730 [2018-11-28 13:01:25,200 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 13:01:25,208 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 13:01:25,211 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 13:01:25,212 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 13:01:25,212 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 13:01:25,213 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7db86aba-2984-4a40-b6de-4c3110e7ef4c/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix042_rmo.opt_false-unreach-call.i [2018-11-28 13:01:25,260 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7db86aba-2984-4a40-b6de-4c3110e7ef4c/bin-2019/uautomizer/data/22f01f9ba/7931e0d41c9343f183d9112d07978266/FLAGd355331dd [2018-11-28 13:01:25,645 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 13:01:25,646 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7db86aba-2984-4a40-b6de-4c3110e7ef4c/sv-benchmarks/c/pthread-wmm/mix042_rmo.opt_false-unreach-call.i [2018-11-28 13:01:25,656 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7db86aba-2984-4a40-b6de-4c3110e7ef4c/bin-2019/uautomizer/data/22f01f9ba/7931e0d41c9343f183d9112d07978266/FLAGd355331dd [2018-11-28 13:01:26,017 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7db86aba-2984-4a40-b6de-4c3110e7ef4c/bin-2019/uautomizer/data/22f01f9ba/7931e0d41c9343f183d9112d07978266 [2018-11-28 13:01:26,019 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 13:01:26,019 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 13:01:26,020 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 13:01:26,020 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 13:01:26,023 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 13:01:26,024 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:01:26" (1/1) ... [2018-11-28 13:01:26,026 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3521e628 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:01:26, skipping insertion in model container [2018-11-28 13:01:26,026 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:01:26" (1/1) ... [2018-11-28 13:01:26,033 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 13:01:26,065 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 13:01:26,294 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:01:26,302 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 13:01:26,402 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:01:26,447 INFO L195 MainTranslator]: Completed translation [2018-11-28 13:01:26,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:01:26 WrapperNode [2018-11-28 13:01:26,448 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 13:01:26,448 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 13:01:26,448 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 13:01:26,449 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 13:01:26,457 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:01:26" (1/1) ... [2018-11-28 13:01:26,469 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:01:26" (1/1) ... [2018-11-28 13:01:26,488 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 13:01:26,488 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 13:01:26,488 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 13:01:26,488 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 13:01:26,494 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:01:26" (1/1) ... [2018-11-28 13:01:26,494 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:01:26" (1/1) ... [2018-11-28 13:01:26,497 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:01:26" (1/1) ... [2018-11-28 13:01:26,497 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:01:26" (1/1) ... [2018-11-28 13:01:26,504 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:01:26" (1/1) ... [2018-11-28 13:01:26,506 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:01:26" (1/1) ... [2018-11-28 13:01:26,508 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:01:26" (1/1) ... [2018-11-28 13:01:26,510 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 13:01:26,511 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 13:01:26,511 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 13:01:26,511 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 13:01:26,511 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:01:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7db86aba-2984-4a40-b6de-4c3110e7ef4c/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:01:26,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 13:01:26,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 13:01:26,543 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-11-28 13:01:26,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 13:01:26,543 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-11-28 13:01:26,543 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-11-28 13:01:26,543 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-11-28 13:01:26,543 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-11-28 13:01:26,543 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-11-28 13:01:26,543 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-11-28 13:01:26,543 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-11-28 13:01:26,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 13:01:26,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 13:01:26,545 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:01:26,972 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 13:01:26,972 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 13:01:26,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:01:26 BoogieIcfgContainer [2018-11-28 13:01:26,972 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 13:01:26,973 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 13:01:26,973 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 13:01:26,975 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 13:01:26,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 01:01:26" (1/3) ... [2018-11-28 13:01:26,975 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23f2f24a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:01:26, skipping insertion in model container [2018-11-28 13:01:26,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:01:26" (2/3) ... [2018-11-28 13:01:26,975 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23f2f24a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:01:26, skipping insertion in model container [2018-11-28 13:01:26,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:01:26" (3/3) ... [2018-11-28 13:01:26,977 INFO L112 eAbstractionObserver]: Analyzing ICFG mix042_rmo.opt_false-unreach-call.i [2018-11-28 13:01:27,001 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,002 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,002 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,002 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,002 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,003 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,003 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,003 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,003 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,003 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,003 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,004 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,004 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,005 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,005 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,006 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,006 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,006 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,006 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,006 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,006 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,006 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,007 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,007 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,007 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,007 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,007 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,007 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,008 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,008 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,008 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,008 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,008 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,008 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,008 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,009 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,009 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,009 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,009 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,009 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,009 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,009 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,009 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,010 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,010 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,010 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,010 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,010 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,011 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,011 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,011 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,011 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,011 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,011 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,012 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,012 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,012 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,012 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,012 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,012 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,013 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,013 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,013 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,018 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,018 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,018 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,018 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,018 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,019 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,019 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,019 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,019 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,019 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,019 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,020 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,020 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,020 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,020 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,020 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,020 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,020 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,020 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:01:27,037 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-11-28 13:01:27,038 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 13:01:27,044 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-28 13:01:27,060 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-28 13:01:27,081 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 13:01:27,082 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 13:01:27,082 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 13:01:27,082 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 13:01:27,082 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 13:01:27,082 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 13:01:27,082 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 13:01:27,082 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 13:01:27,082 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 13:01:27,092 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 158places, 195 transitions [2018-11-28 13:01:41,505 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 128915 states. [2018-11-28 13:01:41,507 INFO L276 IsEmpty]: Start isEmpty. Operand 128915 states. [2018-11-28 13:01:41,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-28 13:01:41,514 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:01:41,514 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] [2018-11-28 13:01:41,516 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:01:41,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:01:41,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1862294190, now seen corresponding path program 1 times [2018-11-28 13:01:41,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:01:41,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:01:41,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:01:41,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:01:41,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:01:41,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:01:41,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:01:41,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:01:41,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:01:41,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:01:41,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:01:41,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:01:41,744 INFO L87 Difference]: Start difference. First operand 128915 states. Second operand 4 states. [2018-11-28 13:01:45,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:01:45,582 INFO L93 Difference]: Finished difference Result 233475 states and 1098327 transitions. [2018-11-28 13:01:45,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:01:45,583 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-11-28 13:01:45,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:01:46,334 INFO L225 Difference]: With dead ends: 233475 [2018-11-28 13:01:46,334 INFO L226 Difference]: Without dead ends: 203725 [2018-11-28 13:01:46,335 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:01:47,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203725 states. [2018-11-28 13:01:49,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203725 to 118895. [2018-11-28 13:01:49,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118895 states. [2018-11-28 13:01:50,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118895 states to 118895 states and 559778 transitions. [2018-11-28 13:01:50,092 INFO L78 Accepts]: Start accepts. Automaton has 118895 states and 559778 transitions. Word has length 46 [2018-11-28 13:01:50,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:01:50,093 INFO L480 AbstractCegarLoop]: Abstraction has 118895 states and 559778 transitions. [2018-11-28 13:01:50,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:01:50,093 INFO L276 IsEmpty]: Start isEmpty. Operand 118895 states and 559778 transitions. [2018-11-28 13:01:50,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-28 13:01:50,101 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:01:50,105 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] [2018-11-28 13:01:50,105 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:01:50,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:01:50,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1986059105, now seen corresponding path program 1 times [2018-11-28 13:01:50,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:01:50,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:01:50,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:01:50,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:01:50,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:01:50,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:01:50,164 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:01:50,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:01:50,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:01:50,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:01:50,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:01:50,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:01:50,166 INFO L87 Difference]: Start difference. First operand 118895 states and 559778 transitions. Second operand 3 states. [2018-11-28 13:01:51,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:01:51,325 INFO L93 Difference]: Finished difference Result 118895 states and 557818 transitions. [2018-11-28 13:01:51,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:01:51,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2018-11-28 13:01:51,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:01:51,689 INFO L225 Difference]: With dead ends: 118895 [2018-11-28 13:01:51,689 INFO L226 Difference]: Without dead ends: 118895 [2018-11-28 13:01:51,690 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:01:52,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118895 states. [2018-11-28 13:01:54,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118895 to 118895. [2018-11-28 13:01:54,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118895 states. [2018-11-28 13:01:54,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118895 states to 118895 states and 557818 transitions. [2018-11-28 13:01:54,430 INFO L78 Accepts]: Start accepts. Automaton has 118895 states and 557818 transitions. Word has length 53 [2018-11-28 13:01:54,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:01:54,430 INFO L480 AbstractCegarLoop]: Abstraction has 118895 states and 557818 transitions. [2018-11-28 13:01:54,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:01:54,431 INFO L276 IsEmpty]: Start isEmpty. Operand 118895 states and 557818 transitions. [2018-11-28 13:01:54,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-28 13:01:54,434 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:01:54,434 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] [2018-11-28 13:01:54,434 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:01:54,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:01:54,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1856976386, now seen corresponding path program 1 times [2018-11-28 13:01:54,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:01:54,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:01:54,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:01:54,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:01:54,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:01:54,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:01:54,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:01:54,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:01:54,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:01:54,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:01:54,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:01:54,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:01:54,517 INFO L87 Difference]: Start difference. First operand 118895 states and 557818 transitions. Second operand 5 states. [2018-11-28 13:01:59,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:01:59,592 INFO L93 Difference]: Finished difference Result 325275 states and 1468252 transitions. [2018-11-28 13:01:59,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:01:59,592 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-11-28 13:01:59,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:00,491 INFO L225 Difference]: With dead ends: 325275 [2018-11-28 13:02:00,491 INFO L226 Difference]: Without dead ends: 324275 [2018-11-28 13:02:00,491 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:02:01,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324275 states. [2018-11-28 13:02:05,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324275 to 186425. [2018-11-28 13:02:05,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186425 states. [2018-11-28 13:02:06,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186425 states to 186425 states and 840917 transitions. [2018-11-28 13:02:06,405 INFO L78 Accepts]: Start accepts. Automaton has 186425 states and 840917 transitions. Word has length 53 [2018-11-28 13:02:06,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:06,405 INFO L480 AbstractCegarLoop]: Abstraction has 186425 states and 840917 transitions. [2018-11-28 13:02:06,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:02:06,406 INFO L276 IsEmpty]: Start isEmpty. Operand 186425 states and 840917 transitions. [2018-11-28 13:02:06,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-28 13:02:06,410 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:06,410 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:02:06,411 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:02:06,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:06,411 INFO L82 PathProgramCache]: Analyzing trace with hash 713101365, now seen corresponding path program 1 times [2018-11-28 13:02:06,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:06,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:06,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:06,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:06,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:06,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:06,466 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:02:06,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:02:06,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:02:06,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:02:06,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:02:06,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:02:06,467 INFO L87 Difference]: Start difference. First operand 186425 states and 840917 transitions. Second operand 4 states. [2018-11-28 13:02:07,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:02:07,189 INFO L93 Difference]: Finished difference Result 163601 states and 725475 transitions. [2018-11-28 13:02:07,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:02:07,189 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-11-28 13:02:07,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:07,595 INFO L225 Difference]: With dead ends: 163601 [2018-11-28 13:02:07,595 INFO L226 Difference]: Without dead ends: 160996 [2018-11-28 13:02:07,595 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:02:08,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160996 states. [2018-11-28 13:02:14,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160996 to 160996. [2018-11-28 13:02:14,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160996 states. [2018-11-28 13:02:14,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160996 states to 160996 states and 716803 transitions. [2018-11-28 13:02:14,890 INFO L78 Accepts]: Start accepts. Automaton has 160996 states and 716803 transitions. Word has length 54 [2018-11-28 13:02:14,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:14,890 INFO L480 AbstractCegarLoop]: Abstraction has 160996 states and 716803 transitions. [2018-11-28 13:02:14,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:02:14,890 INFO L276 IsEmpty]: Start isEmpty. Operand 160996 states and 716803 transitions. [2018-11-28 13:02:14,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-28 13:02:14,897 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:14,897 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] [2018-11-28 13:02:14,898 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:02:14,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:14,898 INFO L82 PathProgramCache]: Analyzing trace with hash -955671519, now seen corresponding path program 1 times [2018-11-28 13:02:14,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:14,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:14,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:14,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:14,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:14,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:14,955 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:02:14,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:02:14,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:02:14,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:02:14,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:02:14,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:02:14,956 INFO L87 Difference]: Start difference. First operand 160996 states and 716803 transitions. Second operand 3 states. [2018-11-28 13:02:15,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:02:15,714 INFO L93 Difference]: Finished difference Result 160996 states and 716767 transitions. [2018-11-28 13:02:15,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:02:15,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2018-11-28 13:02:15,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:16,141 INFO L225 Difference]: With dead ends: 160996 [2018-11-28 13:02:16,141 INFO L226 Difference]: Without dead ends: 160996 [2018-11-28 13:02:16,141 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:02:17,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160996 states. [2018-11-28 13:02:19,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160996 to 160996. [2018-11-28 13:02:19,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160996 states. [2018-11-28 13:02:20,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160996 states to 160996 states and 716767 transitions. [2018-11-28 13:02:20,399 INFO L78 Accepts]: Start accepts. Automaton has 160996 states and 716767 transitions. Word has length 55 [2018-11-28 13:02:20,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:20,400 INFO L480 AbstractCegarLoop]: Abstraction has 160996 states and 716767 transitions. [2018-11-28 13:02:20,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:02:20,400 INFO L276 IsEmpty]: Start isEmpty. Operand 160996 states and 716767 transitions. [2018-11-28 13:02:20,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-28 13:02:20,403 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:20,403 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] [2018-11-28 13:02:20,404 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:02:20,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:20,404 INFO L82 PathProgramCache]: Analyzing trace with hash 787138816, now seen corresponding path program 1 times [2018-11-28 13:02:20,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:20,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:20,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:20,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:20,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:20,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:20,451 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:02:20,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:02:20,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:02:20,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:02:20,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:02:20,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:02:20,452 INFO L87 Difference]: Start difference. First operand 160996 states and 716767 transitions. Second operand 5 states. [2018-11-28 13:02:25,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:02:25,667 INFO L93 Difference]: Finished difference Result 289852 states and 1285660 transitions. [2018-11-28 13:02:25,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:02:25,667 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2018-11-28 13:02:25,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:26,456 INFO L225 Difference]: With dead ends: 289852 [2018-11-28 13:02:26,456 INFO L226 Difference]: Without dead ends: 289012 [2018-11-28 13:02:26,456 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:02:27,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289012 states. [2018-11-28 13:02:30,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289012 to 169616. [2018-11-28 13:02:30,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169616 states. [2018-11-28 13:02:31,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169616 states to 169616 states and 752620 transitions. [2018-11-28 13:02:31,205 INFO L78 Accepts]: Start accepts. Automaton has 169616 states and 752620 transitions. Word has length 55 [2018-11-28 13:02:31,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:31,205 INFO L480 AbstractCegarLoop]: Abstraction has 169616 states and 752620 transitions. [2018-11-28 13:02:31,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:02:31,205 INFO L276 IsEmpty]: Start isEmpty. Operand 169616 states and 752620 transitions. [2018-11-28 13:02:31,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-28 13:02:31,225 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:31,225 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:02:31,225 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:02:31,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:31,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1233238636, now seen corresponding path program 1 times [2018-11-28 13:02:31,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:31,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:31,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:31,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:31,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:31,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:31,281 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:02:31,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:02:31,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:02:31,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:02:31,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:02:31,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:02:31,282 INFO L87 Difference]: Start difference. First operand 169616 states and 752620 transitions. Second operand 5 states. [2018-11-28 13:02:31,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:02:31,526 INFO L93 Difference]: Finished difference Result 59120 states and 239396 transitions. [2018-11-28 13:02:31,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:02:31,527 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2018-11-28 13:02:31,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:31,639 INFO L225 Difference]: With dead ends: 59120 [2018-11-28 13:02:31,639 INFO L226 Difference]: Without dead ends: 56808 [2018-11-28 13:02:31,639 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:02:31,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56808 states. [2018-11-28 13:02:32,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56808 to 56808. [2018-11-28 13:02:32,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56808 states. [2018-11-28 13:02:33,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56808 states to 56808 states and 230742 transitions. [2018-11-28 13:02:33,081 INFO L78 Accepts]: Start accepts. Automaton has 56808 states and 230742 transitions. Word has length 62 [2018-11-28 13:02:33,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:33,081 INFO L480 AbstractCegarLoop]: Abstraction has 56808 states and 230742 transitions. [2018-11-28 13:02:33,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:02:33,081 INFO L276 IsEmpty]: Start isEmpty. Operand 56808 states and 230742 transitions. [2018-11-28 13:02:33,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-28 13:02:33,090 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:33,090 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:02:33,090 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:02:33,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:33,091 INFO L82 PathProgramCache]: Analyzing trace with hash 49065616, now seen corresponding path program 1 times [2018-11-28 13:02:33,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:33,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:33,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:33,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:33,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:33,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:33,148 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:02:33,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:02:33,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:02:33,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:02:33,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:02:33,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:02:33,149 INFO L87 Difference]: Start difference. First operand 56808 states and 230742 transitions. Second operand 4 states. [2018-11-28 13:02:33,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:02:33,576 INFO L93 Difference]: Finished difference Result 78972 states and 316067 transitions. [2018-11-28 13:02:33,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:02:33,576 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2018-11-28 13:02:33,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:33,730 INFO L225 Difference]: With dead ends: 78972 [2018-11-28 13:02:33,730 INFO L226 Difference]: Without dead ends: 78972 [2018-11-28 13:02:33,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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:02:33,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78972 states. [2018-11-28 13:02:34,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78972 to 61564. [2018-11-28 13:02:34,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61564 states. [2018-11-28 13:02:34,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61564 states to 61564 states and 248435 transitions. [2018-11-28 13:02:34,716 INFO L78 Accepts]: Start accepts. Automaton has 61564 states and 248435 transitions. Word has length 68 [2018-11-28 13:02:34,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:34,716 INFO L480 AbstractCegarLoop]: Abstraction has 61564 states and 248435 transitions. [2018-11-28 13:02:34,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:02:34,716 INFO L276 IsEmpty]: Start isEmpty. Operand 61564 states and 248435 transitions. [2018-11-28 13:02:34,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-28 13:02:34,729 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:34,729 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:02:34,730 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:02:34,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:34,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1791875951, now seen corresponding path program 1 times [2018-11-28 13:02:34,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:34,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:34,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:34,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:34,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:34,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:34,780 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:02:34,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:02:34,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:02:34,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:02:34,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:02:34,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:02:34,781 INFO L87 Difference]: Start difference. First operand 61564 states and 248435 transitions. Second operand 6 states. [2018-11-28 13:02:35,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:02:35,791 INFO L93 Difference]: Finished difference Result 82140 states and 328947 transitions. [2018-11-28 13:02:35,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 13:02:35,791 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-11-28 13:02:35,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:35,953 INFO L225 Difference]: With dead ends: 82140 [2018-11-28 13:02:35,953 INFO L226 Difference]: Without dead ends: 81980 [2018-11-28 13:02:35,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-11-28 13:02:36,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81980 states. [2018-11-28 13:02:36,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81980 to 60092. [2018-11-28 13:02:36,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60092 states. [2018-11-28 13:02:36,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60092 states to 60092 states and 242467 transitions. [2018-11-28 13:02:36,940 INFO L78 Accepts]: Start accepts. Automaton has 60092 states and 242467 transitions. Word has length 68 [2018-11-28 13:02:36,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:36,941 INFO L480 AbstractCegarLoop]: Abstraction has 60092 states and 242467 transitions. [2018-11-28 13:02:36,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:02:36,941 INFO L276 IsEmpty]: Start isEmpty. Operand 60092 states and 242467 transitions. [2018-11-28 13:02:36,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-28 13:02:36,986 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:36,986 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:36,986 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:02:36,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:36,986 INFO L82 PathProgramCache]: Analyzing trace with hash -397541118, now seen corresponding path program 1 times [2018-11-28 13:02:36,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:36,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:36,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:36,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:36,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:36,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:37,095 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:02:37,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:02:37,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:02:37,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:02:37,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:02:37,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:02:37,096 INFO L87 Difference]: Start difference. First operand 60092 states and 242467 transitions. Second operand 7 states. [2018-11-28 13:02:39,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:02:39,006 INFO L93 Difference]: Finished difference Result 206079 states and 821108 transitions. [2018-11-28 13:02:39,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 13:02:39,007 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2018-11-28 13:02:39,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:39,455 INFO L225 Difference]: With dead ends: 206079 [2018-11-28 13:02:39,455 INFO L226 Difference]: Without dead ends: 204943 [2018-11-28 13:02:39,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-11-28 13:02:39,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204943 states. [2018-11-28 13:02:41,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204943 to 93001. [2018-11-28 13:02:41,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93001 states. [2018-11-28 13:02:41,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93001 states to 93001 states and 372077 transitions. [2018-11-28 13:02:41,812 INFO L78 Accepts]: Start accepts. Automaton has 93001 states and 372077 transitions. Word has length 82 [2018-11-28 13:02:41,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:41,812 INFO L480 AbstractCegarLoop]: Abstraction has 93001 states and 372077 transitions. [2018-11-28 13:02:41,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:02:41,813 INFO L276 IsEmpty]: Start isEmpty. Operand 93001 states and 372077 transitions. [2018-11-28 13:02:41,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-28 13:02:41,899 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:41,899 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:02:41,899 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:02:41,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:41,900 INFO L82 PathProgramCache]: Analyzing trace with hash 955768579, now seen corresponding path program 1 times [2018-11-28 13:02:41,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:41,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:41,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:41,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:41,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:41,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:41,960 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:02:41,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:02:41,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:02:41,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:02:41,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:02:41,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:02:41,961 INFO L87 Difference]: Start difference. First operand 93001 states and 372077 transitions. Second operand 4 states. [2018-11-28 13:02:42,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:02:42,741 INFO L93 Difference]: Finished difference Result 128658 states and 509081 transitions. [2018-11-28 13:02:42,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:02:42,741 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2018-11-28 13:02:42,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:43,023 INFO L225 Difference]: With dead ends: 128658 [2018-11-28 13:02:43,023 INFO L226 Difference]: Without dead ends: 128658 [2018-11-28 13:02:43,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:02:43,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128658 states. [2018-11-28 13:02:45,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128658 to 116357. [2018-11-28 13:02:45,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116357 states. [2018-11-28 13:02:45,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116357 states to 116357 states and 463127 transitions. [2018-11-28 13:02:45,278 INFO L78 Accepts]: Start accepts. Automaton has 116357 states and 463127 transitions. Word has length 82 [2018-11-28 13:02:45,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:45,279 INFO L480 AbstractCegarLoop]: Abstraction has 116357 states and 463127 transitions. [2018-11-28 13:02:45,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:02:45,279 INFO L276 IsEmpty]: Start isEmpty. Operand 116357 states and 463127 transitions. [2018-11-28 13:02:45,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-28 13:02:45,371 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:45,371 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:02:45,371 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:02:45,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:45,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1306568516, now seen corresponding path program 1 times [2018-11-28 13:02:45,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:45,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:45,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:45,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:45,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:45,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:45,479 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:02:45,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:02:45,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 13:02:45,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 13:02:45,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 13:02:45,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:02:45,480 INFO L87 Difference]: Start difference. First operand 116357 states and 463127 transitions. Second operand 8 states. [2018-11-28 13:02:46,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:02:46,637 INFO L93 Difference]: Finished difference Result 164277 states and 640372 transitions. [2018-11-28 13:02:46,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 13:02:46,638 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2018-11-28 13:02:46,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:46,998 INFO L225 Difference]: With dead ends: 164277 [2018-11-28 13:02:46,998 INFO L226 Difference]: Without dead ends: 163189 [2018-11-28 13:02:46,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-11-28 13:02:47,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163189 states. [2018-11-28 13:02:49,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163189 to 120040. [2018-11-28 13:02:49,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120040 states. [2018-11-28 13:02:49,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120040 states to 120040 states and 477378 transitions. [2018-11-28 13:02:49,449 INFO L78 Accepts]: Start accepts. Automaton has 120040 states and 477378 transitions. Word has length 82 [2018-11-28 13:02:49,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:49,449 INFO L480 AbstractCegarLoop]: Abstraction has 120040 states and 477378 transitions. [2018-11-28 13:02:49,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 13:02:49,449 INFO L276 IsEmpty]: Start isEmpty. Operand 120040 states and 477378 transitions. [2018-11-28 13:02:49,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-28 13:02:49,546 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:49,546 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:02:49,546 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:02:49,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:49,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1013165509, now seen corresponding path program 1 times [2018-11-28 13:02:49,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:49,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:49,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:49,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:49,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:49,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:49,655 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:02:49,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:02:49,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:02:49,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:02:49,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:02:49,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:02:49,656 INFO L87 Difference]: Start difference. First operand 120040 states and 477378 transitions. Second operand 6 states. [2018-11-28 13:02:50,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:02:50,612 INFO L93 Difference]: Finished difference Result 129314 states and 510127 transitions. [2018-11-28 13:02:50,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:02:50,612 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-11-28 13:02:50,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:50,880 INFO L225 Difference]: With dead ends: 129314 [2018-11-28 13:02:50,880 INFO L226 Difference]: Without dead ends: 129314 [2018-11-28 13:02:50,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:02:51,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129314 states. [2018-11-28 13:02:52,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129314 to 122879. [2018-11-28 13:02:52,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122879 states. [2018-11-28 13:02:56,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122879 states to 122879 states and 487324 transitions. [2018-11-28 13:02:56,513 INFO L78 Accepts]: Start accepts. Automaton has 122879 states and 487324 transitions. Word has length 82 [2018-11-28 13:02:56,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:56,513 INFO L480 AbstractCegarLoop]: Abstraction has 122879 states and 487324 transitions. [2018-11-28 13:02:56,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:02:56,513 INFO L276 IsEmpty]: Start isEmpty. Operand 122879 states and 487324 transitions. [2018-11-28 13:02:56,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-28 13:02:56,625 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:56,625 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:02:56,625 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:02:56,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:56,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1974779526, now seen corresponding path program 1 times [2018-11-28 13:02:56,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:56,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:56,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:56,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:56,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:56,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:56,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:02:56,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:02:56,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:02:56,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:02:56,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:02:56,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:02:56,686 INFO L87 Difference]: Start difference. First operand 122879 states and 487324 transitions. Second operand 6 states. [2018-11-28 13:02:56,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:02:56,823 INFO L93 Difference]: Finished difference Result 24159 states and 80924 transitions. [2018-11-28 13:02:56,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:02:56,824 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-11-28 13:02:56,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:56,853 INFO L225 Difference]: With dead ends: 24159 [2018-11-28 13:02:56,853 INFO L226 Difference]: Without dead ends: 19753 [2018-11-28 13:02:56,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:02:56,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19753 states. [2018-11-28 13:02:57,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19753 to 16723. [2018-11-28 13:02:57,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16723 states. [2018-11-28 13:02:57,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16723 states to 16723 states and 56222 transitions. [2018-11-28 13:02:57,045 INFO L78 Accepts]: Start accepts. Automaton has 16723 states and 56222 transitions. Word has length 82 [2018-11-28 13:02:57,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:57,045 INFO L480 AbstractCegarLoop]: Abstraction has 16723 states and 56222 transitions. [2018-11-28 13:02:57,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:02:57,045 INFO L276 IsEmpty]: Start isEmpty. Operand 16723 states and 56222 transitions. [2018-11-28 13:02:57,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-28 13:02:57,061 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:57,061 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] [2018-11-28 13:02:57,061 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:02:57,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:57,061 INFO L82 PathProgramCache]: Analyzing trace with hash 632352529, now seen corresponding path program 1 times [2018-11-28 13:02:57,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:57,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:57,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:57,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:57,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:57,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:57,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:02:57,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:02:57,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:02:57,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:02:57,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:02:57,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:02:57,130 INFO L87 Difference]: Start difference. First operand 16723 states and 56222 transitions. Second operand 4 states. [2018-11-28 13:02:57,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:02:57,269 INFO L93 Difference]: Finished difference Result 20403 states and 67626 transitions. [2018-11-28 13:02:57,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:02:57,270 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2018-11-28 13:02:57,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:57,294 INFO L225 Difference]: With dead ends: 20403 [2018-11-28 13:02:57,294 INFO L226 Difference]: Without dead ends: 20263 [2018-11-28 13:02:57,295 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:02:57,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20263 states. [2018-11-28 13:02:57,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20263 to 20030. [2018-11-28 13:02:57,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20030 states. [2018-11-28 13:02:57,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20030 states to 20030 states and 66594 transitions. [2018-11-28 13:02:57,506 INFO L78 Accepts]: Start accepts. Automaton has 20030 states and 66594 transitions. Word has length 101 [2018-11-28 13:02:57,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:57,507 INFO L480 AbstractCegarLoop]: Abstraction has 20030 states and 66594 transitions. [2018-11-28 13:02:57,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:02:57,507 INFO L276 IsEmpty]: Start isEmpty. Operand 20030 states and 66594 transitions. [2018-11-28 13:02:57,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-28 13:02:57,526 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:57,527 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] [2018-11-28 13:02:57,527 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:02:57,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:57,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1601933552, now seen corresponding path program 1 times [2018-11-28 13:02:57,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:57,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:57,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:57,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:57,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:57,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:57,565 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:02:57,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:02:57,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:02:57,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:02:57,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:02:57,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:02:57,566 INFO L87 Difference]: Start difference. First operand 20030 states and 66594 transitions. Second operand 4 states. [2018-11-28 13:02:57,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:02:57,772 INFO L93 Difference]: Finished difference Result 25054 states and 83640 transitions. [2018-11-28 13:02:57,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:02:57,772 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2018-11-28 13:02:57,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:57,803 INFO L225 Difference]: With dead ends: 25054 [2018-11-28 13:02:57,803 INFO L226 Difference]: Without dead ends: 25054 [2018-11-28 13:02:57,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:02:57,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25054 states. [2018-11-28 13:02:58,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25054 to 19400. [2018-11-28 13:02:58,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19400 states. [2018-11-28 13:02:58,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19400 states to 19400 states and 64240 transitions. [2018-11-28 13:02:58,032 INFO L78 Accepts]: Start accepts. Automaton has 19400 states and 64240 transitions. Word has length 101 [2018-11-28 13:02:58,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:58,033 INFO L480 AbstractCegarLoop]: Abstraction has 19400 states and 64240 transitions. [2018-11-28 13:02:58,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:02:58,033 INFO L276 IsEmpty]: Start isEmpty. Operand 19400 states and 64240 transitions. [2018-11-28 13:02:58,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-28 13:02:58,051 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:58,051 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] [2018-11-28 13:02:58,051 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:02:58,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:58,052 INFO L82 PathProgramCache]: Analyzing trace with hash 866090626, now seen corresponding path program 2 times [2018-11-28 13:02:58,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:58,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:58,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:58,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:58,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:58,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:58,104 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:02:58,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:02:58,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:02:58,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:02:58,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:02:58,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:02:58,105 INFO L87 Difference]: Start difference. First operand 19400 states and 64240 transitions. Second operand 5 states. [2018-11-28 13:02:58,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:02:58,278 INFO L93 Difference]: Finished difference Result 22444 states and 73737 transitions. [2018-11-28 13:02:58,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:02:58,278 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2018-11-28 13:02:58,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:58,304 INFO L225 Difference]: With dead ends: 22444 [2018-11-28 13:02:58,304 INFO L226 Difference]: Without dead ends: 22304 [2018-11-28 13:02:58,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 3 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:02:58,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22304 states. [2018-11-28 13:02:58,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22304 to 19400. [2018-11-28 13:02:58,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19400 states. [2018-11-28 13:02:58,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19400 states to 19400 states and 64200 transitions. [2018-11-28 13:02:58,535 INFO L78 Accepts]: Start accepts. Automaton has 19400 states and 64200 transitions. Word has length 101 [2018-11-28 13:02:58,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:58,535 INFO L480 AbstractCegarLoop]: Abstraction has 19400 states and 64200 transitions. [2018-11-28 13:02:58,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:02:58,535 INFO L276 IsEmpty]: Start isEmpty. Operand 19400 states and 64200 transitions. [2018-11-28 13:02:58,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-28 13:02:58,554 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:58,554 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] [2018-11-28 13:02:58,554 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:02:58,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:58,554 INFO L82 PathProgramCache]: Analyzing trace with hash 955834999, now seen corresponding path program 1 times [2018-11-28 13:02:58,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:58,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:58,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:58,556 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:02:58,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:58,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:58,611 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:02:58,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:02:58,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:02:58,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:02:58,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:02:58,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:02:58,612 INFO L87 Difference]: Start difference. First operand 19400 states and 64200 transitions. Second operand 6 states. [2018-11-28 13:02:58,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:02:58,856 INFO L93 Difference]: Finished difference Result 21510 states and 69968 transitions. [2018-11-28 13:02:58,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:02:58,856 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 103 [2018-11-28 13:02:58,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:58,879 INFO L225 Difference]: With dead ends: 21510 [2018-11-28 13:02:58,879 INFO L226 Difference]: Without dead ends: 20835 [2018-11-28 13:02:58,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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:02:58,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20835 states. [2018-11-28 13:02:59,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20835 to 20230. [2018-11-28 13:02:59,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20230 states. [2018-11-28 13:02:59,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20230 states to 20230 states and 66559 transitions. [2018-11-28 13:02:59,072 INFO L78 Accepts]: Start accepts. Automaton has 20230 states and 66559 transitions. Word has length 103 [2018-11-28 13:02:59,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:59,072 INFO L480 AbstractCegarLoop]: Abstraction has 20230 states and 66559 transitions. [2018-11-28 13:02:59,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:02:59,072 INFO L276 IsEmpty]: Start isEmpty. Operand 20230 states and 66559 transitions. [2018-11-28 13:02:59,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-28 13:02:59,088 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:59,088 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] [2018-11-28 13:02:59,088 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:02:59,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:59,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1638391818, now seen corresponding path program 1 times [2018-11-28 13:02:59,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:59,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:59,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:59,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:59,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:59,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:59,152 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:02:59,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:02:59,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:02:59,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:02:59,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:02:59,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:02:59,154 INFO L87 Difference]: Start difference. First operand 20230 states and 66559 transitions. Second operand 4 states. [2018-11-28 13:02:59,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:02:59,401 INFO L93 Difference]: Finished difference Result 33930 states and 112830 transitions. [2018-11-28 13:02:59,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:02:59,401 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2018-11-28 13:02:59,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:02:59,442 INFO L225 Difference]: With dead ends: 33930 [2018-11-28 13:02:59,442 INFO L226 Difference]: Without dead ends: 33755 [2018-11-28 13:02:59,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:02:59,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33755 states. [2018-11-28 13:02:59,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33755 to 19255. [2018-11-28 13:02:59,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19255 states. [2018-11-28 13:02:59,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19255 states to 19255 states and 63104 transitions. [2018-11-28 13:02:59,710 INFO L78 Accepts]: Start accepts. Automaton has 19255 states and 63104 transitions. Word has length 103 [2018-11-28 13:02:59,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:02:59,710 INFO L480 AbstractCegarLoop]: Abstraction has 19255 states and 63104 transitions. [2018-11-28 13:02:59,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:02:59,710 INFO L276 IsEmpty]: Start isEmpty. Operand 19255 states and 63104 transitions. [2018-11-28 13:02:59,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-28 13:02:59,729 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:02:59,729 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] [2018-11-28 13:02:59,729 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:02:59,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:02:59,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1308626057, now seen corresponding path program 1 times [2018-11-28 13:02:59,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:02:59,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:02:59,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:59,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:02:59,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:02:59,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:02:59,802 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:02:59,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:02:59,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:02:59,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:02:59,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:02:59,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:02:59,803 INFO L87 Difference]: Start difference. First operand 19255 states and 63104 transitions. Second operand 7 states. [2018-11-28 13:03:00,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:03:00,150 INFO L93 Difference]: Finished difference Result 20916 states and 68469 transitions. [2018-11-28 13:03:00,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:03:00,151 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2018-11-28 13:03:00,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:03:00,175 INFO L225 Difference]: With dead ends: 20916 [2018-11-28 13:03:00,175 INFO L226 Difference]: Without dead ends: 20916 [2018-11-28 13:03:00,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:03:00,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20916 states. [2018-11-28 13:03:00,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20916 to 19140. [2018-11-28 13:03:00,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19140 states. [2018-11-28 13:03:00,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19140 states to 19140 states and 62792 transitions. [2018-11-28 13:03:00,376 INFO L78 Accepts]: Start accepts. Automaton has 19140 states and 62792 transitions. Word has length 103 [2018-11-28 13:03:00,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:03:00,376 INFO L480 AbstractCegarLoop]: Abstraction has 19140 states and 62792 transitions. [2018-11-28 13:03:00,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:03:00,377 INFO L276 IsEmpty]: Start isEmpty. Operand 19140 states and 62792 transitions. [2018-11-28 13:03:00,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-28 13:03:00,393 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:03:00,393 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] [2018-11-28 13:03:00,393 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:03:00,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:00,394 INFO L82 PathProgramCache]: Analyzing trace with hash 102253463, now seen corresponding path program 1 times [2018-11-28 13:03:00,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:03:00,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:03:00,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:00,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:03:00,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:00,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:00,443 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:03:00,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:03:00,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:03:00,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:03:00,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:03:00,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:03:00,444 INFO L87 Difference]: Start difference. First operand 19140 states and 62792 transitions. Second operand 5 states. [2018-11-28 13:03:00,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:03:00,657 INFO L93 Difference]: Finished difference Result 36664 states and 121117 transitions. [2018-11-28 13:03:00,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:03:00,657 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2018-11-28 13:03:00,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:03:00,702 INFO L225 Difference]: With dead ends: 36664 [2018-11-28 13:03:00,702 INFO L226 Difference]: Without dead ends: 36534 [2018-11-28 13:03:00,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:03:00,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36534 states. [2018-11-28 13:03:00,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36534 to 19510. [2018-11-28 13:03:00,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19510 states. [2018-11-28 13:03:00,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19510 states to 19510 states and 63933 transitions. [2018-11-28 13:03:00,976 INFO L78 Accepts]: Start accepts. Automaton has 19510 states and 63933 transitions. Word has length 103 [2018-11-28 13:03:00,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:03:00,976 INFO L480 AbstractCegarLoop]: Abstraction has 19510 states and 63933 transitions. [2018-11-28 13:03:00,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:03:00,976 INFO L276 IsEmpty]: Start isEmpty. Operand 19510 states and 63933 transitions. [2018-11-28 13:03:00,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-28 13:03:00,994 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:03:00,994 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] [2018-11-28 13:03:00,994 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:03:00,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:00,994 INFO L82 PathProgramCache]: Analyzing trace with hash 892693590, now seen corresponding path program 1 times [2018-11-28 13:03:00,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:03:00,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:03:00,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:00,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:03:00,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:01,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:01,068 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:03:01,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:03:01,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:03:01,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:03:01,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:03:01,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:03:01,069 INFO L87 Difference]: Start difference. First operand 19510 states and 63933 transitions. Second operand 5 states. [2018-11-28 13:03:01,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:03:01,182 INFO L93 Difference]: Finished difference Result 17154 states and 56157 transitions. [2018-11-28 13:03:01,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:03:01,183 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2018-11-28 13:03:01,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:03:01,204 INFO L225 Difference]: With dead ends: 17154 [2018-11-28 13:03:01,205 INFO L226 Difference]: Without dead ends: 17154 [2018-11-28 13:03:01,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:03:01,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17154 states. [2018-11-28 13:03:01,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17154 to 16674. [2018-11-28 13:03:01,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16674 states. [2018-11-28 13:03:01,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16674 states to 16674 states and 54783 transitions. [2018-11-28 13:03:01,375 INFO L78 Accepts]: Start accepts. Automaton has 16674 states and 54783 transitions. Word has length 103 [2018-11-28 13:03:01,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:03:01,375 INFO L480 AbstractCegarLoop]: Abstraction has 16674 states and 54783 transitions. [2018-11-28 13:03:01,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:03:01,375 INFO L276 IsEmpty]: Start isEmpty. Operand 16674 states and 54783 transitions. [2018-11-28 13:03:01,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-28 13:03:01,389 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:03:01,389 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] [2018-11-28 13:03:01,389 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:03:01,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:01,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1042966697, now seen corresponding path program 1 times [2018-11-28 13:03:01,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:03:01,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:03:01,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:01,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:03:01,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:01,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:01,485 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:03:01,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:03:01,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:03:01,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:03:01,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:03:01,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:03:01,486 INFO L87 Difference]: Start difference. First operand 16674 states and 54783 transitions. Second operand 6 states. [2018-11-28 13:03:01,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:03:01,587 INFO L93 Difference]: Finished difference Result 16098 states and 51951 transitions. [2018-11-28 13:03:01,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:03:01,587 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 103 [2018-11-28 13:03:01,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:03:01,605 INFO L225 Difference]: With dead ends: 16098 [2018-11-28 13:03:01,605 INFO L226 Difference]: Without dead ends: 16098 [2018-11-28 13:03:01,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:03:01,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16098 states. [2018-11-28 13:03:01,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16098 to 12199. [2018-11-28 13:03:01,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12199 states. [2018-11-28 13:03:01,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12199 states to 12199 states and 39782 transitions. [2018-11-28 13:03:01,740 INFO L78 Accepts]: Start accepts. Automaton has 12199 states and 39782 transitions. Word has length 103 [2018-11-28 13:03:01,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:03:01,740 INFO L480 AbstractCegarLoop]: Abstraction has 12199 states and 39782 transitions. [2018-11-28 13:03:01,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:03:01,741 INFO L276 IsEmpty]: Start isEmpty. Operand 12199 states and 39782 transitions. [2018-11-28 13:03:01,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-28 13:03:01,751 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:03:01,751 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] [2018-11-28 13:03:01,751 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:03:01,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:01,751 INFO L82 PathProgramCache]: Analyzing trace with hash 425338674, now seen corresponding path program 1 times [2018-11-28 13:03:01,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:03:01,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:03:01,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:01,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:03:01,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:01,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:01,825 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:03:01,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:03:01,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 13:03:01,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 13:03:01,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 13:03:01,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:03:01,826 INFO L87 Difference]: Start difference. First operand 12199 states and 39782 transitions. Second operand 8 states. [2018-11-28 13:03:02,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:03:02,223 INFO L93 Difference]: Finished difference Result 19087 states and 61247 transitions. [2018-11-28 13:03:02,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 13:03:02,223 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 105 [2018-11-28 13:03:02,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:03:02,252 INFO L225 Difference]: With dead ends: 19087 [2018-11-28 13:03:02,252 INFO L226 Difference]: Without dead ends: 19087 [2018-11-28 13:03:02,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-11-28 13:03:02,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19087 states. [2018-11-28 13:03:02,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19087 to 13709. [2018-11-28 13:03:02,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13709 states. [2018-11-28 13:03:02,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13709 states to 13709 states and 44600 transitions. [2018-11-28 13:03:02,586 INFO L78 Accepts]: Start accepts. Automaton has 13709 states and 44600 transitions. Word has length 105 [2018-11-28 13:03:02,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:03:02,587 INFO L480 AbstractCegarLoop]: Abstraction has 13709 states and 44600 transitions. [2018-11-28 13:03:02,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 13:03:02,587 INFO L276 IsEmpty]: Start isEmpty. Operand 13709 states and 44600 transitions. [2018-11-28 13:03:02,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-28 13:03:02,604 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:03:02,604 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] [2018-11-28 13:03:02,604 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:03:02,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:02,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1670103155, now seen corresponding path program 1 times [2018-11-28 13:03:02,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:03:02,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:03:02,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:02,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:03:02,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:02,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:02,694 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:03:02,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:03:02,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:03:02,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:03:02,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:03:02,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:03:02,695 INFO L87 Difference]: Start difference. First operand 13709 states and 44600 transitions. Second operand 6 states. [2018-11-28 13:03:02,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:03:02,892 INFO L93 Difference]: Finished difference Result 14369 states and 46338 transitions. [2018-11-28 13:03:02,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:03:02,892 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2018-11-28 13:03:02,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:03:02,914 INFO L225 Difference]: With dead ends: 14369 [2018-11-28 13:03:02,914 INFO L226 Difference]: Without dead ends: 14269 [2018-11-28 13:03:02,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:03:02,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14269 states. [2018-11-28 13:03:03,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14269 to 13444. [2018-11-28 13:03:03,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13444 states. [2018-11-28 13:03:03,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13444 states to 13444 states and 43783 transitions. [2018-11-28 13:03:03,116 INFO L78 Accepts]: Start accepts. Automaton has 13444 states and 43783 transitions. Word has length 105 [2018-11-28 13:03:03,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:03:03,116 INFO L480 AbstractCegarLoop]: Abstraction has 13444 states and 43783 transitions. [2018-11-28 13:03:03,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:03:03,116 INFO L276 IsEmpty]: Start isEmpty. Operand 13444 states and 43783 transitions. [2018-11-28 13:03:03,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-28 13:03:03,134 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:03:03,134 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] [2018-11-28 13:03:03,134 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:03:03,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:03,134 INFO L82 PathProgramCache]: Analyzing trace with hash -653924684, now seen corresponding path program 1 times [2018-11-28 13:03:03,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:03:03,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:03:03,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:03,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:03:03,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:03,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:03,229 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:03:03,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:03:03,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:03:03,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:03:03,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:03:03,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:03:03,230 INFO L87 Difference]: Start difference. First operand 13444 states and 43783 transitions. Second operand 6 states. [2018-11-28 13:03:03,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:03:03,513 INFO L93 Difference]: Finished difference Result 14384 states and 46510 transitions. [2018-11-28 13:03:03,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 13:03:03,513 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2018-11-28 13:03:03,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:03:03,533 INFO L225 Difference]: With dead ends: 14384 [2018-11-28 13:03:03,533 INFO L226 Difference]: Without dead ends: 14384 [2018-11-28 13:03:03,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-11-28 13:03:03,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14384 states. [2018-11-28 13:03:03,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14384 to 13819. [2018-11-28 13:03:03,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13819 states. [2018-11-28 13:03:03,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13819 states to 13819 states and 44898 transitions. [2018-11-28 13:03:03,676 INFO L78 Accepts]: Start accepts. Automaton has 13819 states and 44898 transitions. Word has length 105 [2018-11-28 13:03:03,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:03:03,677 INFO L480 AbstractCegarLoop]: Abstraction has 13819 states and 44898 transitions. [2018-11-28 13:03:03,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:03:03,677 INFO L276 IsEmpty]: Start isEmpty. Operand 13819 states and 44898 transitions. [2018-11-28 13:03:03,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-28 13:03:03,689 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:03:03,689 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] [2018-11-28 13:03:03,689 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:03:03,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:03,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1568923404, now seen corresponding path program 1 times [2018-11-28 13:03:03,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:03:03,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:03:03,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:03,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:03:03,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:03,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:03,786 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:03:03,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:03:03,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:03:03,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:03:03,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:03:03,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:03:03,787 INFO L87 Difference]: Start difference. First operand 13819 states and 44898 transitions. Second operand 5 states. [2018-11-28 13:03:04,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:03:04,129 INFO L93 Difference]: Finished difference Result 15227 states and 49410 transitions. [2018-11-28 13:03:04,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:03:04,130 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2018-11-28 13:03:04,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:03:04,155 INFO L225 Difference]: With dead ends: 15227 [2018-11-28 13:03:04,155 INFO L226 Difference]: Without dead ends: 15099 [2018-11-28 13:03:04,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:03:04,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15099 states. [2018-11-28 13:03:04,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15099 to 11548. [2018-11-28 13:03:04,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11548 states. [2018-11-28 13:03:04,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11548 states to 11548 states and 37622 transitions. [2018-11-28 13:03:04,292 INFO L78 Accepts]: Start accepts. Automaton has 11548 states and 37622 transitions. Word has length 105 [2018-11-28 13:03:04,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:03:04,292 INFO L480 AbstractCegarLoop]: Abstraction has 11548 states and 37622 transitions. [2018-11-28 13:03:04,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:03:04,292 INFO L276 IsEmpty]: Start isEmpty. Operand 11548 states and 37622 transitions. [2018-11-28 13:03:04,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-28 13:03:04,303 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:03:04,303 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] [2018-11-28 13:03:04,303 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:03:04,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:04,304 INFO L82 PathProgramCache]: Analyzing trace with hash -324158923, now seen corresponding path program 1 times [2018-11-28 13:03:04,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:03:04,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:03:04,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:04,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:03:04,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:04,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:04,383 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:03:04,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:03:04,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 13:03:04,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 13:03:04,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 13:03:04,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:03:04,383 INFO L87 Difference]: Start difference. First operand 11548 states and 37622 transitions. Second operand 9 states. [2018-11-28 13:03:04,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:03:04,516 INFO L93 Difference]: Finished difference Result 21380 states and 70300 transitions. [2018-11-28 13:03:04,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:03:04,516 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2018-11-28 13:03:04,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:03:04,529 INFO L225 Difference]: With dead ends: 21380 [2018-11-28 13:03:04,529 INFO L226 Difference]: Without dead ends: 10864 [2018-11-28 13:03:04,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-11-28 13:03:04,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10864 states. [2018-11-28 13:03:04,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10864 to 10864. [2018-11-28 13:03:04,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10864 states. [2018-11-28 13:03:04,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10864 states to 10864 states and 35606 transitions. [2018-11-28 13:03:04,634 INFO L78 Accepts]: Start accepts. Automaton has 10864 states and 35606 transitions. Word has length 105 [2018-11-28 13:03:04,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:03:04,634 INFO L480 AbstractCegarLoop]: Abstraction has 10864 states and 35606 transitions. [2018-11-28 13:03:04,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 13:03:04,634 INFO L276 IsEmpty]: Start isEmpty. Operand 10864 states and 35606 transitions. [2018-11-28 13:03:04,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-28 13:03:04,643 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:03:04,643 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] [2018-11-28 13:03:04,643 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:03:04,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:04,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1916571609, now seen corresponding path program 2 times [2018-11-28 13:03:04,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:03:04,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:03:04,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:04,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:03:04,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:04,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:04,735 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:03:04,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:03:04,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 13:03:04,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 13:03:04,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 13:03:04,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:03:04,736 INFO L87 Difference]: Start difference. First operand 10864 states and 35606 transitions. Second operand 9 states. [2018-11-28 13:03:04,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:03:04,910 INFO L93 Difference]: Finished difference Result 17872 states and 59402 transitions. [2018-11-28 13:03:04,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:03:04,911 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2018-11-28 13:03:04,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:03:04,923 INFO L225 Difference]: With dead ends: 17872 [2018-11-28 13:03:04,924 INFO L226 Difference]: Without dead ends: 7252 [2018-11-28 13:03:04,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-11-28 13:03:04,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7252 states. [2018-11-28 13:03:05,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7252 to 7252. [2018-11-28 13:03:05,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7252 states. [2018-11-28 13:03:05,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7252 states to 7252 states and 24440 transitions. [2018-11-28 13:03:05,012 INFO L78 Accepts]: Start accepts. Automaton has 7252 states and 24440 transitions. Word has length 105 [2018-11-28 13:03:05,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:03:05,012 INFO L480 AbstractCegarLoop]: Abstraction has 7252 states and 24440 transitions. [2018-11-28 13:03:05,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 13:03:05,013 INFO L276 IsEmpty]: Start isEmpty. Operand 7252 states and 24440 transitions. [2018-11-28 13:03:05,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-28 13:03:05,020 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:03:05,020 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] [2018-11-28 13:03:05,020 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:03:05,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:05,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1439351056, now seen corresponding path program 2 times [2018-11-28 13:03:05,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:03:05,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:03:05,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:05,022 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:03:05,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:05,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:05,084 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:03:05,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:03:05,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:03:05,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:03:05,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:03:05,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:03:05,085 INFO L87 Difference]: Start difference. First operand 7252 states and 24440 transitions. Second operand 5 states. [2018-11-28 13:03:05,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:03:05,117 INFO L93 Difference]: Finished difference Result 7252 states and 24356 transitions. [2018-11-28 13:03:05,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:03:05,117 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2018-11-28 13:03:05,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:03:05,126 INFO L225 Difference]: With dead ends: 7252 [2018-11-28 13:03:05,126 INFO L226 Difference]: Without dead ends: 7252 [2018-11-28 13:03:05,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:03:05,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7252 states. [2018-11-28 13:03:05,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7252 to 7072. [2018-11-28 13:03:05,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7072 states. [2018-11-28 13:03:05,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7072 states to 7072 states and 23861 transitions. [2018-11-28 13:03:05,197 INFO L78 Accepts]: Start accepts. Automaton has 7072 states and 23861 transitions. Word has length 105 [2018-11-28 13:03:05,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:03:05,197 INFO L480 AbstractCegarLoop]: Abstraction has 7072 states and 23861 transitions. [2018-11-28 13:03:05,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:03:05,197 INFO L276 IsEmpty]: Start isEmpty. Operand 7072 states and 23861 transitions. [2018-11-28 13:03:05,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-28 13:03:05,203 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:03:05,203 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] [2018-11-28 13:03:05,204 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:03:05,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:05,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1109585295, now seen corresponding path program 3 times [2018-11-28 13:03:05,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:03:05,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:03:05,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:05,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:03:05,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:05,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:05,330 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:03:05,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:03:05,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-28 13:03:05,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 13:03:05,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 13:03:05,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-28 13:03:05,331 INFO L87 Difference]: Start difference. First operand 7072 states and 23861 transitions. Second operand 12 states. [2018-11-28 13:03:05,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:03:05,675 INFO L93 Difference]: Finished difference Result 13500 states and 45842 transitions. [2018-11-28 13:03:05,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-28 13:03:05,675 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 105 [2018-11-28 13:03:05,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:03:05,686 INFO L225 Difference]: With dead ends: 13500 [2018-11-28 13:03:05,687 INFO L226 Difference]: Without dead ends: 9596 [2018-11-28 13:03:05,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-11-28 13:03:05,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9596 states. [2018-11-28 13:03:05,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9596 to 8988. [2018-11-28 13:03:05,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8988 states. [2018-11-28 13:03:05,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8988 states to 8988 states and 29754 transitions. [2018-11-28 13:03:05,777 INFO L78 Accepts]: Start accepts. Automaton has 8988 states and 29754 transitions. Word has length 105 [2018-11-28 13:03:05,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:03:05,777 INFO L480 AbstractCegarLoop]: Abstraction has 8988 states and 29754 transitions. [2018-11-28 13:03:05,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 13:03:05,777 INFO L276 IsEmpty]: Start isEmpty. Operand 8988 states and 29754 transitions. [2018-11-28 13:03:05,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-28 13:03:05,785 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:03:05,785 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] [2018-11-28 13:03:05,785 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:03:05,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:05,785 INFO L82 PathProgramCache]: Analyzing trace with hash 2061613685, now seen corresponding path program 4 times [2018-11-28 13:03:05,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:03:05,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:03:05,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:05,786 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:03:05,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:05,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:03:05,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:03:05,848 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 13:03:05,958 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-11-28 13:03:05,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 01:03:05 BasicIcfg [2018-11-28 13:03:05,960 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 13:03:05,960 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 13:03:05,960 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 13:03:05,960 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 13:03:05,961 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:01:26" (3/4) ... [2018-11-28 13:03:05,963 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 13:03:06,087 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_7db86aba-2984-4a40-b6de-4c3110e7ef4c/bin-2019/uautomizer/witness.graphml [2018-11-28 13:03:06,088 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 13:03:06,088 INFO L168 Benchmark]: Toolchain (without parser) took 100069.35 ms. Allocated memory was 1.0 GB in the beginning and 7.5 GB in the end (delta: 6.4 GB). Free memory was 950.6 MB in the beginning and 4.0 GB in the end (delta: -3.1 GB). Peak memory consumption was 3.4 GB. Max. memory is 11.5 GB. [2018-11-28 13:03:06,090 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:03:06,090 INFO L168 Benchmark]: CACSL2BoogieTranslator took 428.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -160.6 MB). Peak memory consumption was 36.5 MB. Max. memory is 11.5 GB. [2018-11-28 13:03:06,091 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-28 13:03:06,091 INFO L168 Benchmark]: Boogie Preprocessor took 22.28 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:03:06,091 INFO L168 Benchmark]: RCFGBuilder took 461.64 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: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 11.5 GB. [2018-11-28 13:03:06,091 INFO L168 Benchmark]: TraceAbstraction took 98987.12 ms. Allocated memory was 1.2 GB in the beginning and 7.5 GB in the end (delta: 6.3 GB). Free memory was 1.1 GB in the beginning and 4.0 GB in the end (delta: -3.0 GB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. [2018-11-28 13:03:06,092 INFO L168 Benchmark]: Witness Printer took 127.57 ms. Allocated memory is still 7.5 GB. Free memory was 4.0 GB in the beginning and 4.0 GB in the end (delta: 39.9 MB). Peak memory consumption was 39.9 MB. Max. memory is 11.5 GB. [2018-11-28 13:03:06,093 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 428.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -160.6 MB). Peak memory consumption was 36.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.28 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 461.64 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: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 98987.12 ms. Allocated memory was 1.2 GB in the beginning and 7.5 GB in the end (delta: 6.3 GB). Free memory was 1.1 GB in the beginning and 4.0 GB in the end (delta: -3.0 GB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. * Witness Printer took 127.57 ms. Allocated memory is still 7.5 GB. Free memory was 4.0 GB in the beginning and 4.0 GB in the end (delta: 39.9 MB). Peak memory consumption was 39.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [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_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0] [L678] -1 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L680] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L681] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L682] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L684] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0] [L693] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0] [L694] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L695] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L696] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L697] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L698] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L699] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L700] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L701] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L702] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L704] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L705] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L706] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] -1 pthread_t t1122; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L789] FCALL, FORK -1 pthread_create(&t1122, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] -1 pthread_t t1123; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L791] FCALL, FORK -1 pthread_create(&t1123, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L792] -1 pthread_t t1124; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L793] FCALL, FORK -1 pthread_create(&t1124, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L745] 0 y$w_buff1 = y$w_buff0 [L746] 0 y$w_buff0 = 2 [L747] 0 y$w_buff1_used = y$w_buff0_used [L748] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L750] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L751] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L752] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L753] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L754] 0 y$r_buff0_thd3 = (_Bool)1 [L757] 0 z = 1 [L760] 0 __unbuffered_p2_EAX = z [L763] 0 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0: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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0: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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L710] 1 a = 1 [L713] 1 __unbuffered_p0_EAX = x [L718] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0: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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L725] 2 x = 1 [L728] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 0 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L767] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L731] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L767] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L731] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2, z=1] [L768] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2, z=1] [L768] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L731] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2, z=1] [L731] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L732] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L769] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L770] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L770] 0 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L773] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_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, z=1] [L733] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L734] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L734] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L735] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_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, z=1] [L735] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L738] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L795] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] 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=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] 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=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] -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) [L800] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L801] 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=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] -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 [L802] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L802] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L803] 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=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L803] -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 [L806] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L807] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L808] -1 y$flush_delayed = weak$$choice2 [L809] -1 y$mem_tmp = y VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] -1 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L811] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] -1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L812] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L812] -1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L813] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] -1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L814] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] -1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L815] -1 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L816] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L816] -1 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] -1 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] -1 y = y$flush_delayed ? y$mem_tmp : y [L819] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 201 locations, 3 error locations. UNSAFE Result, 98.8s OverallTime, 32 OverallIterations, 1 TraceHistogramMax, 32.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8010 SDtfs, 8825 SDslu, 18525 SDs, 0 SdLazy, 6848 SolverSat, 487 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 316 GetRequests, 96 SyntacticMatches, 22 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=186425occurred in iteration=3, 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: 48.0s AutomataMinimizationTime, 31 MinimizatonAttempts, 616411 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 2790 NumberOfCodeBlocks, 2790 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2654 ConstructedInterpolants, 0 QuantifiedInterpolants, 600257 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...