./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix048_tso.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_28927481-d61e-4200-8676-ad0ddeda97c5/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_28927481-d61e-4200-8676-ad0ddeda97c5/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_28927481-d61e-4200-8676-ad0ddeda97c5/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_28927481-d61e-4200-8676-ad0ddeda97c5/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix048_tso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_28927481-d61e-4200-8676-ad0ddeda97c5/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_28927481-d61e-4200-8676-ad0ddeda97c5/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 c0c8faded955830cd36120935919c3f9dab9bfdd .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 08:58:37,261 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 08:58:37,262 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 08:58:37,268 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 08:58:37,268 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 08:58:37,268 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 08:58:37,269 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 08:58:37,270 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 08:58:37,271 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 08:58:37,271 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 08:58:37,271 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 08:58:37,272 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 08:58:37,272 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 08:58:37,273 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 08:58:37,273 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 08:58:37,273 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 08:58:37,274 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 08:58:37,275 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 08:58:37,276 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 08:58:37,276 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 08:58:37,277 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 08:58:37,277 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 08:58:37,279 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 08:58:37,279 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 08:58:37,279 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 08:58:37,279 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 08:58:37,280 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 08:58:37,280 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 08:58:37,281 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 08:58:37,281 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 08:58:37,281 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 08:58:37,282 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 08:58:37,282 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 08:58:37,282 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 08:58:37,282 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 08:58:37,283 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 08:58:37,283 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_28927481-d61e-4200-8676-ad0ddeda97c5/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-02 08:58:37,290 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 08:58:37,290 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 08:58:37,290 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 08:58:37,291 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 08:58:37,291 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 08:58:37,291 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 08:58:37,291 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 08:58:37,291 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 08:58:37,291 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 08:58:37,291 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 08:58:37,292 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 08:58:37,292 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 08:58:37,292 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 08:58:37,292 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 08:58:37,292 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 08:58:37,292 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 08:58:37,292 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 08:58:37,292 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 08:58:37,292 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 08:58:37,292 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 08:58:37,292 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 08:58:37,293 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 08:58:37,293 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 08:58:37,293 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 08:58:37,293 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 08:58:37,293 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 08:58:37,293 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 08:58:37,293 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 08:58:37,293 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 08:58:37,293 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 08:58:37,293 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_28927481-d61e-4200-8676-ad0ddeda97c5/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 -> c0c8faded955830cd36120935919c3f9dab9bfdd [2018-12-02 08:58:37,311 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 08:58:37,317 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 08:58:37,319 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 08:58:37,320 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 08:58:37,320 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 08:58:37,321 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_28927481-d61e-4200-8676-ad0ddeda97c5/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix048_tso.opt_false-unreach-call.i [2018-12-02 08:58:37,354 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_28927481-d61e-4200-8676-ad0ddeda97c5/bin-2019/uautomizer/data/42eddcaf7/18727f57926144a09e32d0e218801c95/FLAGed910a10c [2018-12-02 08:58:37,815 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 08:58:37,815 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_28927481-d61e-4200-8676-ad0ddeda97c5/sv-benchmarks/c/pthread-wmm/mix048_tso.opt_false-unreach-call.i [2018-12-02 08:58:37,822 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_28927481-d61e-4200-8676-ad0ddeda97c5/bin-2019/uautomizer/data/42eddcaf7/18727f57926144a09e32d0e218801c95/FLAGed910a10c [2018-12-02 08:58:37,831 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_28927481-d61e-4200-8676-ad0ddeda97c5/bin-2019/uautomizer/data/42eddcaf7/18727f57926144a09e32d0e218801c95 [2018-12-02 08:58:37,833 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 08:58:37,833 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 08:58:37,834 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 08:58:37,834 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 08:58:37,836 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 08:58:37,837 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:58:37" (1/1) ... [2018-12-02 08:58:37,838 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ab2707f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:58:37, skipping insertion in model container [2018-12-02 08:58:37,838 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:58:37" (1/1) ... [2018-12-02 08:58:37,842 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 08:58:37,864 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 08:58:38,039 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 08:58:38,046 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 08:58:38,132 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 08:58:38,174 INFO L195 MainTranslator]: Completed translation [2018-12-02 08:58:38,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:58:38 WrapperNode [2018-12-02 08:58:38,175 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 08:58:38,175 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 08:58:38,175 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 08:58:38,175 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 08:58:38,181 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:58:38" (1/1) ... [2018-12-02 08:58:38,191 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:58:38" (1/1) ... [2018-12-02 08:58:38,207 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 08:58:38,207 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 08:58:38,207 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 08:58:38,207 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 08:58:38,213 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:58:38" (1/1) ... [2018-12-02 08:58:38,213 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:58:38" (1/1) ... [2018-12-02 08:58:38,215 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:58:38" (1/1) ... [2018-12-02 08:58:38,215 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:58:38" (1/1) ... [2018-12-02 08:58:38,221 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:58:38" (1/1) ... [2018-12-02 08:58:38,223 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:58:38" (1/1) ... [2018-12-02 08:58:38,225 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:58:38" (1/1) ... [2018-12-02 08:58:38,226 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 08:58:38,227 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 08:58:38,227 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 08:58:38,227 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 08:58:38,227 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:58:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_28927481-d61e-4200-8676-ad0ddeda97c5/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 08:58:38,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 08:58:38,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 08:58:38,260 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 08:58:38,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 08:58:38,260 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 08:58:38,260 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 08:58:38,260 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 08:58:38,260 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 08:58:38,260 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 08:58:38,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 08:58:38,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 08:58:38,261 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-02 08:58:38,576 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 08:58:38,576 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 08:58:38,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:58:38 BoogieIcfgContainer [2018-12-02 08:58:38,576 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 08:58:38,577 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 08:58:38,577 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 08:58:38,578 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 08:58:38,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 08:58:37" (1/3) ... [2018-12-02 08:58:38,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fb6b95d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:58:38, skipping insertion in model container [2018-12-02 08:58:38,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:58:38" (2/3) ... [2018-12-02 08:58:38,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fb6b95d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:58:38, skipping insertion in model container [2018-12-02 08:58:38,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:58:38" (3/3) ... [2018-12-02 08:58:38,580 INFO L112 eAbstractionObserver]: Analyzing ICFG mix048_tso.opt_false-unreach-call.i [2018-12-02 08:58:38,603 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,603 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,603 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,603 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,603 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,603 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,603 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,604 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,604 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,604 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,604 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,604 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,604 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,604 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,604 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,605 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,605 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,605 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,605 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,605 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,605 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,605 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,605 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,605 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,605 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,606 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,606 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,606 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,606 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,606 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,606 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,606 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,606 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,606 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,606 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,606 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,607 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,607 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,607 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,607 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,607 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,607 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,607 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,607 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,608 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,608 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,608 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,608 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,608 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,608 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,608 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,608 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,608 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,608 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,608 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,608 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,609 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,609 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,609 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,609 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,609 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,609 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,609 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,609 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,609 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,610 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,610 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,610 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,610 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,610 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,610 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,610 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,610 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,610 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,610 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,610 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,611 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,611 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,611 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,611 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,611 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,611 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,611 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,611 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,611 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,611 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,611 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,611 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,612 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,612 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,612 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,612 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,612 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,612 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,612 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,612 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,612 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,612 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,612 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,612 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,613 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,613 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,613 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,613 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,613 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,613 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,613 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,613 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,613 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,613 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,613 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,614 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,614 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,614 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,614 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,614 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,614 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,614 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,614 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,614 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,614 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,614 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,615 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,615 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,615 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,615 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,615 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,615 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,615 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,615 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,615 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,615 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,615 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,616 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,616 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,616 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,616 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,616 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,616 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,616 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,616 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,616 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,616 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,616 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,616 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,617 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,617 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,617 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,617 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,617 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,617 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,617 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,617 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,617 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,617 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,617 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,618 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,618 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,618 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,618 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,618 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,618 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,618 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,618 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:58:38,622 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 08:58:38,622 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 08:58:38,627 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 08:58:38,637 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 08:58:38,651 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 08:58:38,651 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 08:58:38,651 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 08:58:38,651 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 08:58:38,651 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 08:58:38,651 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 08:58:38,651 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 08:58:38,652 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 08:58:38,652 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 08:58:38,658 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 142places, 180 transitions [2018-12-02 08:58:40,033 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34806 states. [2018-12-02 08:58:40,034 INFO L276 IsEmpty]: Start isEmpty. Operand 34806 states. [2018-12-02 08:58:40,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-02 08:58:40,038 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:58:40,039 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] [2018-12-02 08:58:40,040 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:58:40,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:58:40,043 INFO L82 PathProgramCache]: Analyzing trace with hash -454041356, now seen corresponding path program 1 times [2018-12-02 08:58:40,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:58:40,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:58:40,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:40,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:58:40,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:40,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:58:40,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:58:40,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:58:40,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 08:58:40,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 08:58:40,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 08:58:40,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 08:58:40,192 INFO L87 Difference]: Start difference. First operand 34806 states. Second operand 4 states. [2018-12-02 08:58:40,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:58:40,693 INFO L93 Difference]: Finished difference Result 60790 states and 234493 transitions. [2018-12-02 08:58:40,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 08:58:40,694 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-12-02 08:58:40,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:58:40,836 INFO L225 Difference]: With dead ends: 60790 [2018-12-02 08:58:40,836 INFO L226 Difference]: Without dead ends: 44270 [2018-12-02 08:58:40,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 08:58:41,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44270 states. [2018-12-02 08:58:41,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44270 to 27338. [2018-12-02 08:58:41,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27338 states. [2018-12-02 08:58:41,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27338 states to 27338 states and 105499 transitions. [2018-12-02 08:58:41,572 INFO L78 Accepts]: Start accepts. Automaton has 27338 states and 105499 transitions. Word has length 33 [2018-12-02 08:58:41,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:58:41,572 INFO L480 AbstractCegarLoop]: Abstraction has 27338 states and 105499 transitions. [2018-12-02 08:58:41,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 08:58:41,572 INFO L276 IsEmpty]: Start isEmpty. Operand 27338 states and 105499 transitions. [2018-12-02 08:58:41,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-02 08:58:41,578 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:58:41,578 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] [2018-12-02 08:58:41,579 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:58:41,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:58:41,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1863363909, now seen corresponding path program 1 times [2018-12-02 08:58:41,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:58:41,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:58:41,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:41,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:58:41,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:41,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:58:41,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:58:41,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:58:41,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 08:58:41,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 08:58:41,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 08:58:41,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 08:58:41,635 INFO L87 Difference]: Start difference. First operand 27338 states and 105499 transitions. Second operand 4 states. [2018-12-02 08:58:41,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:58:41,691 INFO L93 Difference]: Finished difference Result 8528 states and 28344 transitions. [2018-12-02 08:58:41,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 08:58:41,692 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-12-02 08:58:41,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:58:41,704 INFO L225 Difference]: With dead ends: 8528 [2018-12-02 08:58:41,704 INFO L226 Difference]: Without dead ends: 7466 [2018-12-02 08:58:41,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 08:58:41,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7466 states. [2018-12-02 08:58:41,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7466 to 7466. [2018-12-02 08:58:41,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7466 states. [2018-12-02 08:58:41,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7466 states to 7466 states and 24636 transitions. [2018-12-02 08:58:41,795 INFO L78 Accepts]: Start accepts. Automaton has 7466 states and 24636 transitions. Word has length 45 [2018-12-02 08:58:41,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:58:41,796 INFO L480 AbstractCegarLoop]: Abstraction has 7466 states and 24636 transitions. [2018-12-02 08:58:41,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 08:58:41,796 INFO L276 IsEmpty]: Start isEmpty. Operand 7466 states and 24636 transitions. [2018-12-02 08:58:41,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 08:58:41,797 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:58:41,797 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-12-02 08:58:41,797 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:58:41,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:58:41,797 INFO L82 PathProgramCache]: Analyzing trace with hash 591681941, now seen corresponding path program 1 times [2018-12-02 08:58:41,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:58:41,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:58:41,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:41,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:58:41,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:41,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:58:41,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:58:41,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:58:41,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 08:58:41,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 08:58:41,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 08:58:41,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 08:58:41,841 INFO L87 Difference]: Start difference. First operand 7466 states and 24636 transitions. Second operand 5 states. [2018-12-02 08:58:42,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:58:42,037 INFO L93 Difference]: Finished difference Result 13998 states and 45805 transitions. [2018-12-02 08:58:42,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 08:58:42,037 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-02 08:58:42,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:58:42,063 INFO L225 Difference]: With dead ends: 13998 [2018-12-02 08:58:42,063 INFO L226 Difference]: Without dead ends: 13930 [2018-12-02 08:58:42,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 08:58:42,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13930 states. [2018-12-02 08:58:42,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13930 to 9441. [2018-12-02 08:58:42,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9441 states. [2018-12-02 08:58:42,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9441 states to 9441 states and 30542 transitions. [2018-12-02 08:58:42,248 INFO L78 Accepts]: Start accepts. Automaton has 9441 states and 30542 transitions. Word has length 46 [2018-12-02 08:58:42,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:58:42,249 INFO L480 AbstractCegarLoop]: Abstraction has 9441 states and 30542 transitions. [2018-12-02 08:58:42,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 08:58:42,249 INFO L276 IsEmpty]: Start isEmpty. Operand 9441 states and 30542 transitions. [2018-12-02 08:58:42,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-02 08:58:42,250 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:58:42,250 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:58:42,250 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:58:42,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:58:42,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1652121253, now seen corresponding path program 1 times [2018-12-02 08:58:42,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:58:42,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:58:42,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:42,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:58:42,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:42,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:58:42,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:58:42,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:58:42,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 08:58:42,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 08:58:42,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 08:58:42,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 08:58:42,278 INFO L87 Difference]: Start difference. First operand 9441 states and 30542 transitions. Second operand 3 states. [2018-12-02 08:58:42,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:58:42,336 INFO L93 Difference]: Finished difference Result 13279 states and 42641 transitions. [2018-12-02 08:58:42,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 08:58:42,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-12-02 08:58:42,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:58:42,352 INFO L225 Difference]: With dead ends: 13279 [2018-12-02 08:58:42,352 INFO L226 Difference]: Without dead ends: 13279 [2018-12-02 08:58:42,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 08:58:42,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13279 states. [2018-12-02 08:58:42,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13279 to 9845. [2018-12-02 08:58:42,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9845 states. [2018-12-02 08:58:42,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9845 states to 9845 states and 31508 transitions. [2018-12-02 08:58:42,472 INFO L78 Accepts]: Start accepts. Automaton has 9845 states and 31508 transitions. Word has length 48 [2018-12-02 08:58:42,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:58:42,473 INFO L480 AbstractCegarLoop]: Abstraction has 9845 states and 31508 transitions. [2018-12-02 08:58:42,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 08:58:42,473 INFO L276 IsEmpty]: Start isEmpty. Operand 9845 states and 31508 transitions. [2018-12-02 08:58:42,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-02 08:58:42,474 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:58:42,474 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] [2018-12-02 08:58:42,474 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:58:42,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:58:42,474 INFO L82 PathProgramCache]: Analyzing trace with hash -164023066, now seen corresponding path program 1 times [2018-12-02 08:58:42,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:58:42,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:58:42,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:42,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:58:42,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:42,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:58:42,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:58:42,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:58:42,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 08:58:42,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 08:58:42,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 08:58:42,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 08:58:42,537 INFO L87 Difference]: Start difference. First operand 9845 states and 31508 transitions. Second operand 7 states. [2018-12-02 08:58:42,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:58:42,940 INFO L93 Difference]: Finished difference Result 12285 states and 38673 transitions. [2018-12-02 08:58:42,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 08:58:42,941 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2018-12-02 08:58:42,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:58:42,953 INFO L225 Difference]: With dead ends: 12285 [2018-12-02 08:58:42,953 INFO L226 Difference]: Without dead ends: 12213 [2018-12-02 08:58:42,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-12-02 08:58:42,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12213 states. [2018-12-02 08:58:43,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12213 to 10849. [2018-12-02 08:58:43,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10849 states. [2018-12-02 08:58:43,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10849 states to 10849 states and 34563 transitions. [2018-12-02 08:58:43,068 INFO L78 Accepts]: Start accepts. Automaton has 10849 states and 34563 transitions. Word has length 52 [2018-12-02 08:58:43,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:58:43,068 INFO L480 AbstractCegarLoop]: Abstraction has 10849 states and 34563 transitions. [2018-12-02 08:58:43,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 08:58:43,068 INFO L276 IsEmpty]: Start isEmpty. Operand 10849 states and 34563 transitions. [2018-12-02 08:58:43,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 08:58:43,071 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:58:43,071 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:58:43,072 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:58:43,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:58:43,072 INFO L82 PathProgramCache]: Analyzing trace with hash 317195842, now seen corresponding path program 1 times [2018-12-02 08:58:43,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:58:43,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:58:43,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:43,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:58:43,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:43,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:58:43,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:58:43,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:58:43,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 08:58:43,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 08:58:43,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 08:58:43,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 08:58:43,123 INFO L87 Difference]: Start difference. First operand 10849 states and 34563 transitions. Second operand 4 states. [2018-12-02 08:58:43,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:58:43,227 INFO L93 Difference]: Finished difference Result 12396 states and 39572 transitions. [2018-12-02 08:58:43,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 08:58:43,228 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-12-02 08:58:43,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:58:43,241 INFO L225 Difference]: With dead ends: 12396 [2018-12-02 08:58:43,241 INFO L226 Difference]: Without dead ends: 12396 [2018-12-02 08:58:43,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 08:58:43,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12396 states. [2018-12-02 08:58:43,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12396 to 11369. [2018-12-02 08:58:43,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11369 states. [2018-12-02 08:58:43,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11369 states to 11369 states and 36236 transitions. [2018-12-02 08:58:43,361 INFO L78 Accepts]: Start accepts. Automaton has 11369 states and 36236 transitions. Word has length 60 [2018-12-02 08:58:43,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:58:43,361 INFO L480 AbstractCegarLoop]: Abstraction has 11369 states and 36236 transitions. [2018-12-02 08:58:43,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 08:58:43,362 INFO L276 IsEmpty]: Start isEmpty. Operand 11369 states and 36236 transitions. [2018-12-02 08:58:43,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 08:58:43,364 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:58:43,364 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] [2018-12-02 08:58:43,364 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:58:43,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:58:43,365 INFO L82 PathProgramCache]: Analyzing trace with hash 2060006177, now seen corresponding path program 1 times [2018-12-02 08:58:43,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:58:43,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:58:43,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:43,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:58:43,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:43,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:58:43,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:58:43,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:58:43,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 08:58:43,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 08:58:43,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 08:58:43,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 08:58:43,414 INFO L87 Difference]: Start difference. First operand 11369 states and 36236 transitions. Second operand 6 states. [2018-12-02 08:58:43,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:58:43,681 INFO L93 Difference]: Finished difference Result 20969 states and 66486 transitions. [2018-12-02 08:58:43,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 08:58:43,681 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2018-12-02 08:58:43,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:58:43,704 INFO L225 Difference]: With dead ends: 20969 [2018-12-02 08:58:43,704 INFO L226 Difference]: Without dead ends: 20898 [2018-12-02 08:58:43,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-02 08:58:43,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20898 states. [2018-12-02 08:58:43,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20898 to 13755. [2018-12-02 08:58:43,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13755 states. [2018-12-02 08:58:43,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13755 states to 13755 states and 43280 transitions. [2018-12-02 08:58:43,884 INFO L78 Accepts]: Start accepts. Automaton has 13755 states and 43280 transitions. Word has length 60 [2018-12-02 08:58:43,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:58:43,885 INFO L480 AbstractCegarLoop]: Abstraction has 13755 states and 43280 transitions. [2018-12-02 08:58:43,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 08:58:43,885 INFO L276 IsEmpty]: Start isEmpty. Operand 13755 states and 43280 transitions. [2018-12-02 08:58:43,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-02 08:58:43,890 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:58:43,890 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:58:43,890 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:58:43,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:58:43,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1699576415, now seen corresponding path program 1 times [2018-12-02 08:58:43,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:58:43,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:58:43,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:43,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:58:43,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:43,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:58:43,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:58:43,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:58:43,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 08:58:43,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 08:58:43,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 08:58:43,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 08:58:43,944 INFO L87 Difference]: Start difference. First operand 13755 states and 43280 transitions. Second operand 4 states. [2018-12-02 08:58:44,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:58:44,156 INFO L93 Difference]: Finished difference Result 17635 states and 54585 transitions. [2018-12-02 08:58:44,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 08:58:44,157 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-02 08:58:44,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:58:44,177 INFO L225 Difference]: With dead ends: 17635 [2018-12-02 08:58:44,177 INFO L226 Difference]: Without dead ends: 17635 [2018-12-02 08:58:44,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 08:58:44,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17635 states. [2018-12-02 08:58:44,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17635 to 15793. [2018-12-02 08:58:44,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15793 states. [2018-12-02 08:58:44,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15793 states to 15793 states and 49131 transitions. [2018-12-02 08:58:44,370 INFO L78 Accepts]: Start accepts. Automaton has 15793 states and 49131 transitions. Word has length 64 [2018-12-02 08:58:44,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:58:44,370 INFO L480 AbstractCegarLoop]: Abstraction has 15793 states and 49131 transitions. [2018-12-02 08:58:44,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 08:58:44,371 INFO L276 IsEmpty]: Start isEmpty. Operand 15793 states and 49131 transitions. [2018-12-02 08:58:44,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-02 08:58:44,375 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:58:44,375 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:58:44,375 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:58:44,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:58:44,376 INFO L82 PathProgramCache]: Analyzing trace with hash -377632928, now seen corresponding path program 1 times [2018-12-02 08:58:44,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:58:44,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:58:44,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:44,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:58:44,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:44,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:58:44,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:58:44,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:58:44,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 08:58:44,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 08:58:44,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 08:58:44,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 08:58:44,400 INFO L87 Difference]: Start difference. First operand 15793 states and 49131 transitions. Second operand 3 states. [2018-12-02 08:58:44,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:58:44,557 INFO L93 Difference]: Finished difference Result 16385 states and 50738 transitions. [2018-12-02 08:58:44,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 08:58:44,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2018-12-02 08:58:44,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:58:44,577 INFO L225 Difference]: With dead ends: 16385 [2018-12-02 08:58:44,577 INFO L226 Difference]: Without dead ends: 16385 [2018-12-02 08:58:44,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 08:58:44,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16385 states. [2018-12-02 08:58:44,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16385 to 16109. [2018-12-02 08:58:44,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16109 states. [2018-12-02 08:58:44,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16109 states to 16109 states and 49981 transitions. [2018-12-02 08:58:44,772 INFO L78 Accepts]: Start accepts. Automaton has 16109 states and 49981 transitions. Word has length 64 [2018-12-02 08:58:44,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:58:44,772 INFO L480 AbstractCegarLoop]: Abstraction has 16109 states and 49981 transitions. [2018-12-02 08:58:44,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 08:58:44,772 INFO L276 IsEmpty]: Start isEmpty. Operand 16109 states and 49981 transitions. [2018-12-02 08:58:44,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 08:58:44,778 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:58:44,778 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] [2018-12-02 08:58:44,778 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:58:44,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:58:44,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1938632710, now seen corresponding path program 1 times [2018-12-02 08:58:44,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:58:44,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:58:44,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:44,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:58:44,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:44,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:58:44,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:58:44,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:58:44,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 08:58:44,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 08:58:44,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 08:58:44,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 08:58:44,856 INFO L87 Difference]: Start difference. First operand 16109 states and 49981 transitions. Second operand 6 states. [2018-12-02 08:58:45,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:58:45,425 INFO L93 Difference]: Finished difference Result 19821 states and 60437 transitions. [2018-12-02 08:58:45,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 08:58:45,426 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-12-02 08:58:45,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:58:45,446 INFO L225 Difference]: With dead ends: 19821 [2018-12-02 08:58:45,446 INFO L226 Difference]: Without dead ends: 19821 [2018-12-02 08:58:45,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 08:58:45,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19821 states. [2018-12-02 08:58:45,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19821 to 18617. [2018-12-02 08:58:45,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18617 states. [2018-12-02 08:58:45,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18617 states to 18617 states and 57217 transitions. [2018-12-02 08:58:45,637 INFO L78 Accepts]: Start accepts. Automaton has 18617 states and 57217 transitions. Word has length 66 [2018-12-02 08:58:45,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:58:45,638 INFO L480 AbstractCegarLoop]: Abstraction has 18617 states and 57217 transitions. [2018-12-02 08:58:45,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 08:58:45,638 INFO L276 IsEmpty]: Start isEmpty. Operand 18617 states and 57217 transitions. [2018-12-02 08:58:45,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 08:58:45,644 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:58:45,644 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] [2018-12-02 08:58:45,644 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:58:45,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:58:45,645 INFO L82 PathProgramCache]: Analyzing trace with hash -138576633, now seen corresponding path program 1 times [2018-12-02 08:58:45,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:58:45,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:58:45,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:45,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:58:45,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:45,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:58:45,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:58:45,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:58:45,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 08:58:45,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 08:58:45,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 08:58:45,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 08:58:45,701 INFO L87 Difference]: Start difference. First operand 18617 states and 57217 transitions. Second operand 6 states. [2018-12-02 08:58:45,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:58:45,974 INFO L93 Difference]: Finished difference Result 21449 states and 63626 transitions. [2018-12-02 08:58:45,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 08:58:45,975 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-12-02 08:58:45,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:58:45,996 INFO L225 Difference]: With dead ends: 21449 [2018-12-02 08:58:45,996 INFO L226 Difference]: Without dead ends: 21449 [2018-12-02 08:58:45,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-02 08:58:46,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21449 states. [2018-12-02 08:58:46,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21449 to 19133. [2018-12-02 08:58:46,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19133 states. [2018-12-02 08:58:46,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19133 states to 19133 states and 57764 transitions. [2018-12-02 08:58:46,241 INFO L78 Accepts]: Start accepts. Automaton has 19133 states and 57764 transitions. Word has length 66 [2018-12-02 08:58:46,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:58:46,241 INFO L480 AbstractCegarLoop]: Abstraction has 19133 states and 57764 transitions. [2018-12-02 08:58:46,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 08:58:46,241 INFO L276 IsEmpty]: Start isEmpty. Operand 19133 states and 57764 transitions. [2018-12-02 08:58:46,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 08:58:46,247 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:58:46,247 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] [2018-12-02 08:58:46,247 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:58:46,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:58:46,247 INFO L82 PathProgramCache]: Analyzing trace with hash 72774280, now seen corresponding path program 1 times [2018-12-02 08:58:46,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:58:46,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:58:46,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:46,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:58:46,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:46,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:58:46,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:58:46,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:58:46,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 08:58:46,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 08:58:46,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 08:58:46,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 08:58:46,289 INFO L87 Difference]: Start difference. First operand 19133 states and 57764 transitions. Second operand 5 states. [2018-12-02 08:58:46,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:58:46,544 INFO L93 Difference]: Finished difference Result 25024 states and 75018 transitions. [2018-12-02 08:58:46,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 08:58:46,545 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-12-02 08:58:46,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:58:46,573 INFO L225 Difference]: With dead ends: 25024 [2018-12-02 08:58:46,573 INFO L226 Difference]: Without dead ends: 25024 [2018-12-02 08:58:46,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 08:58:46,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25024 states. [2018-12-02 08:58:46,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25024 to 22709. [2018-12-02 08:58:46,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22709 states. [2018-12-02 08:58:46,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22709 states to 22709 states and 68032 transitions. [2018-12-02 08:58:46,816 INFO L78 Accepts]: Start accepts. Automaton has 22709 states and 68032 transitions. Word has length 66 [2018-12-02 08:58:46,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:58:46,816 INFO L480 AbstractCegarLoop]: Abstraction has 22709 states and 68032 transitions. [2018-12-02 08:58:46,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 08:58:46,816 INFO L276 IsEmpty]: Start isEmpty. Operand 22709 states and 68032 transitions. [2018-12-02 08:58:46,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 08:58:46,823 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:58:46,824 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] [2018-12-02 08:58:46,824 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:58:46,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:58:46,824 INFO L82 PathProgramCache]: Analyzing trace with hash -437759897, now seen corresponding path program 1 times [2018-12-02 08:58:46,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:58:46,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:58:46,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:46,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:58:46,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:46,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:58:46,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:58:46,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:58:46,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 08:58:46,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 08:58:46,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 08:58:46,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 08:58:46,876 INFO L87 Difference]: Start difference. First operand 22709 states and 68032 transitions. Second operand 4 states. [2018-12-02 08:58:47,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:58:47,218 INFO L93 Difference]: Finished difference Result 31689 states and 95699 transitions. [2018-12-02 08:58:47,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 08:58:47,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-12-02 08:58:47,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:58:47,251 INFO L225 Difference]: With dead ends: 31689 [2018-12-02 08:58:47,251 INFO L226 Difference]: Without dead ends: 31537 [2018-12-02 08:58:47,251 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-12-02 08:58:47,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31537 states. [2018-12-02 08:58:47,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31537 to 28553. [2018-12-02 08:58:47,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28553 states. [2018-12-02 08:58:47,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28553 states to 28553 states and 86263 transitions. [2018-12-02 08:58:47,584 INFO L78 Accepts]: Start accepts. Automaton has 28553 states and 86263 transitions. Word has length 66 [2018-12-02 08:58:47,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:58:47,584 INFO L480 AbstractCegarLoop]: Abstraction has 28553 states and 86263 transitions. [2018-12-02 08:58:47,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 08:58:47,584 INFO L276 IsEmpty]: Start isEmpty. Operand 28553 states and 86263 transitions. [2018-12-02 08:58:47,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 08:58:47,593 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:58:47,593 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] [2018-12-02 08:58:47,593 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:58:47,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:58:47,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1369694566, now seen corresponding path program 1 times [2018-12-02 08:58:47,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:58:47,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:58:47,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:47,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:58:47,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:47,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:58:47,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:58:47,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:58:47,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 08:58:47,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 08:58:47,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 08:58:47,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 08:58:47,632 INFO L87 Difference]: Start difference. First operand 28553 states and 86263 transitions. Second operand 5 states. [2018-12-02 08:58:47,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:58:47,995 INFO L93 Difference]: Finished difference Result 40195 states and 119844 transitions. [2018-12-02 08:58:47,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 08:58:47,996 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-12-02 08:58:47,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:58:48,048 INFO L225 Difference]: With dead ends: 40195 [2018-12-02 08:58:48,049 INFO L226 Difference]: Without dead ends: 39987 [2018-12-02 08:58:48,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 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-12-02 08:58:48,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39987 states. [2018-12-02 08:58:48,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39987 to 35807. [2018-12-02 08:58:48,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35807 states. [2018-12-02 08:58:48,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35807 states to 35807 states and 107399 transitions. [2018-12-02 08:58:48,486 INFO L78 Accepts]: Start accepts. Automaton has 35807 states and 107399 transitions. Word has length 66 [2018-12-02 08:58:48,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:58:48,486 INFO L480 AbstractCegarLoop]: Abstraction has 35807 states and 107399 transitions. [2018-12-02 08:58:48,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 08:58:48,486 INFO L276 IsEmpty]: Start isEmpty. Operand 35807 states and 107399 transitions. [2018-12-02 08:58:48,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 08:58:48,494 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:58:48,494 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:58:48,494 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:58:48,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:58:48,495 INFO L82 PathProgramCache]: Analyzing trace with hash 2060256040, now seen corresponding path program 1 times [2018-12-02 08:58:48,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:58:48,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:58:48,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:48,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:58:48,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:48,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:58:48,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:58:48,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:58:48,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 08:58:48,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 08:58:48,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 08:58:48,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-02 08:58:48,583 INFO L87 Difference]: Start difference. First operand 35807 states and 107399 transitions. Second operand 9 states. [2018-12-02 08:58:49,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:58:49,229 INFO L93 Difference]: Finished difference Result 44023 states and 131291 transitions. [2018-12-02 08:58:49,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 08:58:49,230 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2018-12-02 08:58:49,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:58:49,281 INFO L225 Difference]: With dead ends: 44023 [2018-12-02 08:58:49,281 INFO L226 Difference]: Without dead ends: 44023 [2018-12-02 08:58:49,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-02 08:58:49,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44023 states. [2018-12-02 08:58:49,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44023 to 38973. [2018-12-02 08:58:49,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38973 states. [2018-12-02 08:58:49,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38973 states to 38973 states and 116711 transitions. [2018-12-02 08:58:49,722 INFO L78 Accepts]: Start accepts. Automaton has 38973 states and 116711 transitions. Word has length 66 [2018-12-02 08:58:49,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:58:49,722 INFO L480 AbstractCegarLoop]: Abstraction has 38973 states and 116711 transitions. [2018-12-02 08:58:49,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 08:58:49,722 INFO L276 IsEmpty]: Start isEmpty. Operand 38973 states and 116711 transitions. [2018-12-02 08:58:49,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 08:58:49,731 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:58:49,731 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] [2018-12-02 08:58:49,731 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:58:49,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:58:49,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1347207575, now seen corresponding path program 1 times [2018-12-02 08:58:49,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:58:49,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:58:49,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:49,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:58:49,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:49,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:58:49,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:58:49,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:58:49,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 08:58:49,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 08:58:49,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 08:58:49,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 08:58:49,757 INFO L87 Difference]: Start difference. First operand 38973 states and 116711 transitions. Second operand 5 states. [2018-12-02 08:58:49,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:58:49,804 INFO L93 Difference]: Finished difference Result 9637 states and 23357 transitions. [2018-12-02 08:58:49,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 08:58:49,804 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-12-02 08:58:49,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:58:49,811 INFO L225 Difference]: With dead ends: 9637 [2018-12-02 08:58:49,811 INFO L226 Difference]: Without dead ends: 7669 [2018-12-02 08:58:49,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 08:58:49,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7669 states. [2018-12-02 08:58:49,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7669 to 6276. [2018-12-02 08:58:49,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6276 states. [2018-12-02 08:58:49,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6276 states to 6276 states and 14833 transitions. [2018-12-02 08:58:49,907 INFO L78 Accepts]: Start accepts. Automaton has 6276 states and 14833 transitions. Word has length 66 [2018-12-02 08:58:49,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:58:49,907 INFO L480 AbstractCegarLoop]: Abstraction has 6276 states and 14833 transitions. [2018-12-02 08:58:49,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 08:58:49,907 INFO L276 IsEmpty]: Start isEmpty. Operand 6276 states and 14833 transitions. [2018-12-02 08:58:49,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 08:58:49,910 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:58:49,910 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] [2018-12-02 08:58:49,910 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:58:49,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:58:49,910 INFO L82 PathProgramCache]: Analyzing trace with hash 890203314, now seen corresponding path program 1 times [2018-12-02 08:58:49,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:58:49,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:58:49,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:49,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:58:49,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:49,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:58:49,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:58:49,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:58:49,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 08:58:49,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 08:58:49,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 08:58:49,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 08:58:49,923 INFO L87 Difference]: Start difference. First operand 6276 states and 14833 transitions. Second operand 3 states. [2018-12-02 08:58:49,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:58:49,946 INFO L93 Difference]: Finished difference Result 8733 states and 20570 transitions. [2018-12-02 08:58:49,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 08:58:49,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-12-02 08:58:49,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:58:49,952 INFO L225 Difference]: With dead ends: 8733 [2018-12-02 08:58:49,952 INFO L226 Difference]: Without dead ends: 8733 [2018-12-02 08:58:49,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 08:58:49,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8733 states. [2018-12-02 08:58:49,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8733 to 6213. [2018-12-02 08:58:49,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6213 states. [2018-12-02 08:58:50,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6213 states to 6213 states and 14371 transitions. [2018-12-02 08:58:50,005 INFO L78 Accepts]: Start accepts. Automaton has 6213 states and 14371 transitions. Word has length 66 [2018-12-02 08:58:50,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:58:50,006 INFO L480 AbstractCegarLoop]: Abstraction has 6213 states and 14371 transitions. [2018-12-02 08:58:50,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 08:58:50,006 INFO L276 IsEmpty]: Start isEmpty. Operand 6213 states and 14371 transitions. [2018-12-02 08:58:50,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-02 08:58:50,009 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:58:50,009 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] [2018-12-02 08:58:50,009 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:58:50,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:58:50,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1181781029, now seen corresponding path program 1 times [2018-12-02 08:58:50,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:58:50,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:58:50,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:50,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:58:50,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:50,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:58:50,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:58:50,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:58:50,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 08:58:50,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 08:58:50,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 08:58:50,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 08:58:50,048 INFO L87 Difference]: Start difference. First operand 6213 states and 14371 transitions. Second operand 5 states. [2018-12-02 08:58:50,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:58:50,139 INFO L93 Difference]: Finished difference Result 7383 states and 17012 transitions. [2018-12-02 08:58:50,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 08:58:50,140 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2018-12-02 08:58:50,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:58:50,144 INFO L225 Difference]: With dead ends: 7383 [2018-12-02 08:58:50,144 INFO L226 Difference]: Without dead ends: 7383 [2018-12-02 08:58:50,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-02 08:58:50,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7383 states. [2018-12-02 08:58:50,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7383 to 6657. [2018-12-02 08:58:50,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6657 states. [2018-12-02 08:58:50,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6657 states to 6657 states and 15375 transitions. [2018-12-02 08:58:50,191 INFO L78 Accepts]: Start accepts. Automaton has 6657 states and 15375 transitions. Word has length 72 [2018-12-02 08:58:50,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:58:50,191 INFO L480 AbstractCegarLoop]: Abstraction has 6657 states and 15375 transitions. [2018-12-02 08:58:50,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 08:58:50,191 INFO L276 IsEmpty]: Start isEmpty. Operand 6657 states and 15375 transitions. [2018-12-02 08:58:50,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-02 08:58:50,194 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:58:50,194 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] [2018-12-02 08:58:50,195 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:58:50,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:58:50,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1370375932, now seen corresponding path program 1 times [2018-12-02 08:58:50,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:58:50,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:58:50,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:50,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:58:50,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:50,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:58:50,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:58:50,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:58:50,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 08:58:50,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 08:58:50,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 08:58:50,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-02 08:58:50,276 INFO L87 Difference]: Start difference. First operand 6657 states and 15375 transitions. Second operand 9 states. [2018-12-02 08:58:50,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:58:50,640 INFO L93 Difference]: Finished difference Result 8851 states and 20272 transitions. [2018-12-02 08:58:50,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 08:58:50,640 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2018-12-02 08:58:50,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:58:50,646 INFO L225 Difference]: With dead ends: 8851 [2018-12-02 08:58:50,646 INFO L226 Difference]: Without dead ends: 8732 [2018-12-02 08:58:50,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-12-02 08:58:50,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8732 states. [2018-12-02 08:58:50,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8732 to 6746. [2018-12-02 08:58:50,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6746 states. [2018-12-02 08:58:50,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6746 states to 6746 states and 15444 transitions. [2018-12-02 08:58:50,701 INFO L78 Accepts]: Start accepts. Automaton has 6746 states and 15444 transitions. Word has length 72 [2018-12-02 08:58:50,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:58:50,701 INFO L480 AbstractCegarLoop]: Abstraction has 6746 states and 15444 transitions. [2018-12-02 08:58:50,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 08:58:50,702 INFO L276 IsEmpty]: Start isEmpty. Operand 6746 states and 15444 transitions. [2018-12-02 08:58:50,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 08:58:50,706 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:58:50,706 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] [2018-12-02 08:58:50,706 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:58:50,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:58:50,706 INFO L82 PathProgramCache]: Analyzing trace with hash 342181544, now seen corresponding path program 1 times [2018-12-02 08:58:50,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:58:50,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:58:50,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:50,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:58:50,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:50,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:58:50,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-12-02 08:58:50,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:58:50,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 08:58:50,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 08:58:50,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 08:58:50,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 08:58:50,736 INFO L87 Difference]: Start difference. First operand 6746 states and 15444 transitions. Second operand 3 states. [2018-12-02 08:58:50,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:58:50,836 INFO L93 Difference]: Finished difference Result 8422 states and 18970 transitions. [2018-12-02 08:58:50,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 08:58:50,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2018-12-02 08:58:50,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:58:50,842 INFO L225 Difference]: With dead ends: 8422 [2018-12-02 08:58:50,842 INFO L226 Difference]: Without dead ends: 8422 [2018-12-02 08:58:50,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 08:58:50,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8422 states. [2018-12-02 08:58:50,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8422 to 7857. [2018-12-02 08:58:50,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7857 states. [2018-12-02 08:58:50,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7857 states to 7857 states and 17760 transitions. [2018-12-02 08:58:50,901 INFO L78 Accepts]: Start accepts. Automaton has 7857 states and 17760 transitions. Word has length 91 [2018-12-02 08:58:50,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:58:50,902 INFO L480 AbstractCegarLoop]: Abstraction has 7857 states and 17760 transitions. [2018-12-02 08:58:50,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 08:58:50,902 INFO L276 IsEmpty]: Start isEmpty. Operand 7857 states and 17760 transitions. [2018-12-02 08:58:50,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 08:58:50,907 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:58:50,907 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] [2018-12-02 08:58:50,907 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:58:50,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:58:50,907 INFO L82 PathProgramCache]: Analyzing trace with hash 39095599, now seen corresponding path program 1 times [2018-12-02 08:58:50,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:58:50,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:58:50,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:50,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:58:50,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:50,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:58:50,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:58:50,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:58:50,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 08:58:50,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 08:58:50,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 08:58:50,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 08:58:50,934 INFO L87 Difference]: Start difference. First operand 7857 states and 17760 transitions. Second operand 4 states. [2018-12-02 08:58:50,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:58:50,999 INFO L93 Difference]: Finished difference Result 8431 states and 19074 transitions. [2018-12-02 08:58:50,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 08:58:50,999 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-12-02 08:58:51,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:58:51,005 INFO L225 Difference]: With dead ends: 8431 [2018-12-02 08:58:51,005 INFO L226 Difference]: Without dead ends: 8431 [2018-12-02 08:58:51,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 08:58:51,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8431 states. [2018-12-02 08:58:51,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8431 to 7772. [2018-12-02 08:58:51,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7772 states. [2018-12-02 08:58:51,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7772 states to 7772 states and 17676 transitions. [2018-12-02 08:58:51,065 INFO L78 Accepts]: Start accepts. Automaton has 7772 states and 17676 transitions. Word has length 91 [2018-12-02 08:58:51,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:58:51,065 INFO L480 AbstractCegarLoop]: Abstraction has 7772 states and 17676 transitions. [2018-12-02 08:58:51,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 08:58:51,065 INFO L276 IsEmpty]: Start isEmpty. Operand 7772 states and 17676 transitions. [2018-12-02 08:58:51,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 08:58:51,070 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:58:51,070 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] [2018-12-02 08:58:51,070 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:58:51,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:58:51,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1745561198, now seen corresponding path program 1 times [2018-12-02 08:58:51,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:58:51,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:58:51,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:51,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:58:51,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:51,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:58:51,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:58:51,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:58:51,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 08:58:51,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 08:58:51,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 08:58:51,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 08:58:51,103 INFO L87 Difference]: Start difference. First operand 7772 states and 17676 transitions. Second operand 5 states. [2018-12-02 08:58:51,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:58:51,170 INFO L93 Difference]: Finished difference Result 8948 states and 20243 transitions. [2018-12-02 08:58:51,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 08:58:51,170 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-12-02 08:58:51,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:58:51,176 INFO L225 Difference]: With dead ends: 8948 [2018-12-02 08:58:51,176 INFO L226 Difference]: Without dead ends: 8948 [2018-12-02 08:58:51,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 08:58:51,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8948 states. [2018-12-02 08:58:51,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8948 to 6902. [2018-12-02 08:58:51,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6902 states. [2018-12-02 08:58:51,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6902 states to 6902 states and 15741 transitions. [2018-12-02 08:58:51,232 INFO L78 Accepts]: Start accepts. Automaton has 6902 states and 15741 transitions. Word has length 93 [2018-12-02 08:58:51,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:58:51,232 INFO L480 AbstractCegarLoop]: Abstraction has 6902 states and 15741 transitions. [2018-12-02 08:58:51,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 08:58:51,232 INFO L276 IsEmpty]: Start isEmpty. Operand 6902 states and 15741 transitions. [2018-12-02 08:58:51,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 08:58:51,236 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:58:51,237 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] [2018-12-02 08:58:51,237 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:58:51,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:58:51,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1490824653, now seen corresponding path program 1 times [2018-12-02 08:58:51,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:58:51,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:58:51,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:51,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:58:51,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:51,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:58:51,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:58:51,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:58:51,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 08:58:51,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 08:58:51,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 08:58:51,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 08:58:51,272 INFO L87 Difference]: Start difference. First operand 6902 states and 15741 transitions. Second operand 5 states. [2018-12-02 08:58:51,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:58:51,560 INFO L93 Difference]: Finished difference Result 11458 states and 26340 transitions. [2018-12-02 08:58:51,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 08:58:51,560 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-12-02 08:58:51,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:58:51,568 INFO L225 Difference]: With dead ends: 11458 [2018-12-02 08:58:51,568 INFO L226 Difference]: Without dead ends: 11380 [2018-12-02 08:58:51,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-02 08:58:51,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11380 states. [2018-12-02 08:58:51,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11380 to 8056. [2018-12-02 08:58:51,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8056 states. [2018-12-02 08:58:51,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8056 states to 8056 states and 18403 transitions. [2018-12-02 08:58:51,641 INFO L78 Accepts]: Start accepts. Automaton has 8056 states and 18403 transitions. Word has length 93 [2018-12-02 08:58:51,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:58:51,641 INFO L480 AbstractCegarLoop]: Abstraction has 8056 states and 18403 transitions. [2018-12-02 08:58:51,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 08:58:51,641 INFO L276 IsEmpty]: Start isEmpty. Operand 8056 states and 18403 transitions. [2018-12-02 08:58:51,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 08:58:51,646 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:58:51,646 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] [2018-12-02 08:58:51,646 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:58:51,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:58:51,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1559378162, now seen corresponding path program 1 times [2018-12-02 08:58:51,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:58:51,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:58:51,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:51,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:58:51,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:51,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:58:51,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:58:51,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:58:51,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 08:58:51,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 08:58:51,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 08:58:51,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 08:58:51,684 INFO L87 Difference]: Start difference. First operand 8056 states and 18403 transitions. Second operand 6 states. [2018-12-02 08:58:51,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:58:51,879 INFO L93 Difference]: Finished difference Result 10204 states and 23157 transitions. [2018-12-02 08:58:51,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 08:58:51,880 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-12-02 08:58:51,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:58:51,886 INFO L225 Difference]: With dead ends: 10204 [2018-12-02 08:58:51,886 INFO L226 Difference]: Without dead ends: 10125 [2018-12-02 08:58:51,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-02 08:58:51,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10125 states. [2018-12-02 08:58:51,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10125 to 7529. [2018-12-02 08:58:51,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7529 states. [2018-12-02 08:58:51,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7529 states to 7529 states and 17293 transitions. [2018-12-02 08:58:51,947 INFO L78 Accepts]: Start accepts. Automaton has 7529 states and 17293 transitions. Word has length 93 [2018-12-02 08:58:51,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:58:51,947 INFO L480 AbstractCegarLoop]: Abstraction has 7529 states and 17293 transitions. [2018-12-02 08:58:51,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 08:58:51,947 INFO L276 IsEmpty]: Start isEmpty. Operand 7529 states and 17293 transitions. [2018-12-02 08:58:51,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 08:58:51,952 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:58:51,952 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] [2018-12-02 08:58:51,952 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:58:51,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:58:51,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1497612213, now seen corresponding path program 1 times [2018-12-02 08:58:51,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:58:51,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:58:51,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:51,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:58:51,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:51,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:58:52,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:58:52,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:58:52,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 08:58:52,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 08:58:52,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 08:58:52,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-02 08:58:52,044 INFO L87 Difference]: Start difference. First operand 7529 states and 17293 transitions. Second operand 9 states. [2018-12-02 08:58:52,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:58:52,375 INFO L93 Difference]: Finished difference Result 10604 states and 24259 transitions. [2018-12-02 08:58:52,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-02 08:58:52,375 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2018-12-02 08:58:52,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:58:52,382 INFO L225 Difference]: With dead ends: 10604 [2018-12-02 08:58:52,382 INFO L226 Difference]: Without dead ends: 10572 [2018-12-02 08:58:52,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-12-02 08:58:52,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10572 states. [2018-12-02 08:58:52,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10572 to 9100. [2018-12-02 08:58:52,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9100 states. [2018-12-02 08:58:52,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9100 states to 9100 states and 20773 transitions. [2018-12-02 08:58:52,452 INFO L78 Accepts]: Start accepts. Automaton has 9100 states and 20773 transitions. Word has length 93 [2018-12-02 08:58:52,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:58:52,452 INFO L480 AbstractCegarLoop]: Abstraction has 9100 states and 20773 transitions. [2018-12-02 08:58:52,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 08:58:52,452 INFO L276 IsEmpty]: Start isEmpty. Operand 9100 states and 20773 transitions. [2018-12-02 08:58:52,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 08:58:52,461 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:58:52,461 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] [2018-12-02 08:58:52,461 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:58:52,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:58:52,462 INFO L82 PathProgramCache]: Analyzing trace with hash -299339146, now seen corresponding path program 1 times [2018-12-02 08:58:52,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:58:52,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:58:52,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:52,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:58:52,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:52,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:58:52,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:58:52,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:58:52,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 08:58:52,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 08:58:52,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 08:58:52,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-02 08:58:52,526 INFO L87 Difference]: Start difference. First operand 9100 states and 20773 transitions. Second operand 8 states. [2018-12-02 08:58:52,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:58:52,789 INFO L93 Difference]: Finished difference Result 14198 states and 32836 transitions. [2018-12-02 08:58:52,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 08:58:52,789 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 93 [2018-12-02 08:58:52,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:58:52,811 INFO L225 Difference]: With dead ends: 14198 [2018-12-02 08:58:52,811 INFO L226 Difference]: Without dead ends: 14198 [2018-12-02 08:58:52,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-02 08:58:52,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14198 states. [2018-12-02 08:58:52,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14198 to 9690. [2018-12-02 08:58:52,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9690 states. [2018-12-02 08:58:52,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9690 states to 9690 states and 22304 transitions. [2018-12-02 08:58:52,890 INFO L78 Accepts]: Start accepts. Automaton has 9690 states and 22304 transitions. Word has length 93 [2018-12-02 08:58:52,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:58:52,890 INFO L480 AbstractCegarLoop]: Abstraction has 9690 states and 22304 transitions. [2018-12-02 08:58:52,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 08:58:52,890 INFO L276 IsEmpty]: Start isEmpty. Operand 9690 states and 22304 transitions. [2018-12-02 08:58:52,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 08:58:52,896 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:58:52,896 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] [2018-12-02 08:58:52,897 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:58:52,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:58:52,897 INFO L82 PathProgramCache]: Analyzing trace with hash 588164535, now seen corresponding path program 1 times [2018-12-02 08:58:52,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:58:52,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:58:52,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:52,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:58:52,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:52,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:58:52,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:58:52,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:58:52,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 08:58:52,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 08:58:52,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 08:58:52,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 08:58:52,933 INFO L87 Difference]: Start difference. First operand 9690 states and 22304 transitions. Second operand 3 states. [2018-12-02 08:58:52,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:58:52,955 INFO L93 Difference]: Finished difference Result 9434 states and 21504 transitions. [2018-12-02 08:58:52,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 08:58:52,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2018-12-02 08:58:52,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:58:52,962 INFO L225 Difference]: With dead ends: 9434 [2018-12-02 08:58:52,962 INFO L226 Difference]: Without dead ends: 9402 [2018-12-02 08:58:52,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 08:58:52,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9402 states. [2018-12-02 08:58:53,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9402 to 7460. [2018-12-02 08:58:53,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7460 states. [2018-12-02 08:58:53,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7460 states to 7460 states and 16875 transitions. [2018-12-02 08:58:53,026 INFO L78 Accepts]: Start accepts. Automaton has 7460 states and 16875 transitions. Word has length 93 [2018-12-02 08:58:53,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:58:53,026 INFO L480 AbstractCegarLoop]: Abstraction has 7460 states and 16875 transitions. [2018-12-02 08:58:53,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 08:58:53,026 INFO L276 IsEmpty]: Start isEmpty. Operand 7460 states and 16875 transitions. [2018-12-02 08:58:53,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 08:58:53,031 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:58:53,031 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] [2018-12-02 08:58:53,031 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:58:53,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:58:53,031 INFO L82 PathProgramCache]: Analyzing trace with hash -360597677, now seen corresponding path program 1 times [2018-12-02 08:58:53,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:58:53,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:58:53,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:53,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:58:53,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:53,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:58:53,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:58:53,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:58:53,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 08:58:53,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 08:58:53,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 08:58:53,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-02 08:58:53,156 INFO L87 Difference]: Start difference. First operand 7460 states and 16875 transitions. Second operand 11 states. [2018-12-02 08:58:53,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:58:53,780 INFO L93 Difference]: Finished difference Result 9968 states and 22228 transitions. [2018-12-02 08:58:53,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-02 08:58:53,780 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2018-12-02 08:58:53,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:58:53,786 INFO L225 Difference]: With dead ends: 9968 [2018-12-02 08:58:53,786 INFO L226 Difference]: Without dead ends: 9968 [2018-12-02 08:58:53,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2018-12-02 08:58:53,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9968 states. [2018-12-02 08:58:53,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9968 to 8883. [2018-12-02 08:58:53,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8883 states. [2018-12-02 08:58:53,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8883 states to 8883 states and 19937 transitions. [2018-12-02 08:58:53,854 INFO L78 Accepts]: Start accepts. Automaton has 8883 states and 19937 transitions. Word has length 95 [2018-12-02 08:58:53,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:58:53,854 INFO L480 AbstractCegarLoop]: Abstraction has 8883 states and 19937 transitions. [2018-12-02 08:58:53,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 08:58:53,854 INFO L276 IsEmpty]: Start isEmpty. Operand 8883 states and 19937 transitions. [2018-12-02 08:58:53,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 08:58:53,860 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:58:53,860 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] [2018-12-02 08:58:53,860 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:58:53,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:58:53,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1550303339, now seen corresponding path program 1 times [2018-12-02 08:58:53,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:58:53,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:58:53,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:53,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:58:53,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:53,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:58:53,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:58:53,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:58:53,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 08:58:53,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 08:58:53,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 08:58:53,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-02 08:58:53,966 INFO L87 Difference]: Start difference. First operand 8883 states and 19937 transitions. Second operand 9 states. [2018-12-02 08:58:54,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:58:54,615 INFO L93 Difference]: Finished difference Result 11095 states and 24591 transitions. [2018-12-02 08:58:54,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 08:58:54,616 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2018-12-02 08:58:54,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:58:54,628 INFO L225 Difference]: With dead ends: 11095 [2018-12-02 08:58:54,628 INFO L226 Difference]: Without dead ends: 11095 [2018-12-02 08:58:54,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2018-12-02 08:58:54,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11095 states. [2018-12-02 08:58:54,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11095 to 9338. [2018-12-02 08:58:54,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9338 states. [2018-12-02 08:58:54,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9338 states to 9338 states and 20900 transitions. [2018-12-02 08:58:54,712 INFO L78 Accepts]: Start accepts. Automaton has 9338 states and 20900 transitions. Word has length 95 [2018-12-02 08:58:54,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:58:54,712 INFO L480 AbstractCegarLoop]: Abstraction has 9338 states and 20900 transitions. [2018-12-02 08:58:54,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 08:58:54,712 INFO L276 IsEmpty]: Start isEmpty. Operand 9338 states and 20900 transitions. [2018-12-02 08:58:54,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 08:58:54,718 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:58:54,718 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] [2018-12-02 08:58:54,718 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:58:54,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:58:54,718 INFO L82 PathProgramCache]: Analyzing trace with hash 2068511189, now seen corresponding path program 1 times [2018-12-02 08:58:54,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:58:54,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:58:54,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:54,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:58:54,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:54,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:58:54,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:58:54,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:58:54,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 08:58:54,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 08:58:54,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 08:58:54,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-02 08:58:54,806 INFO L87 Difference]: Start difference. First operand 9338 states and 20900 transitions. Second operand 9 states. [2018-12-02 08:58:55,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:58:55,115 INFO L93 Difference]: Finished difference Result 10117 states and 22547 transitions. [2018-12-02 08:58:55,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-02 08:58:55,115 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2018-12-02 08:58:55,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:58:55,121 INFO L225 Difference]: With dead ends: 10117 [2018-12-02 08:58:55,121 INFO L226 Difference]: Without dead ends: 10117 [2018-12-02 08:58:55,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2018-12-02 08:58:55,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10117 states. [2018-12-02 08:58:55,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10117 to 7028. [2018-12-02 08:58:55,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7028 states. [2018-12-02 08:58:55,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7028 states to 7028 states and 15724 transitions. [2018-12-02 08:58:55,187 INFO L78 Accepts]: Start accepts. Automaton has 7028 states and 15724 transitions. Word has length 95 [2018-12-02 08:58:55,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:58:55,187 INFO L480 AbstractCegarLoop]: Abstraction has 7028 states and 15724 transitions. [2018-12-02 08:58:55,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 08:58:55,187 INFO L276 IsEmpty]: Start isEmpty. Operand 7028 states and 15724 transitions. [2018-12-02 08:58:55,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 08:58:55,191 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:58:55,192 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] [2018-12-02 08:58:55,192 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:58:55,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:58:55,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1338952426, now seen corresponding path program 1 times [2018-12-02 08:58:55,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:58:55,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:58:55,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:55,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:58:55,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:55,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:58:55,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:58:55,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:58:55,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 08:58:55,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 08:58:55,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 08:58:55,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-02 08:58:55,292 INFO L87 Difference]: Start difference. First operand 7028 states and 15724 transitions. Second operand 11 states. [2018-12-02 08:58:57,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:58:57,119 INFO L93 Difference]: Finished difference Result 13312 states and 30006 transitions. [2018-12-02 08:58:57,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 08:58:57,120 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2018-12-02 08:58:57,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:58:57,130 INFO L225 Difference]: With dead ends: 13312 [2018-12-02 08:58:57,130 INFO L226 Difference]: Without dead ends: 9089 [2018-12-02 08:58:57,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-12-02 08:58:57,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9089 states. [2018-12-02 08:58:57,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9089 to 6789. [2018-12-02 08:58:57,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6789 states. [2018-12-02 08:58:57,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6789 states to 6789 states and 15157 transitions. [2018-12-02 08:58:57,194 INFO L78 Accepts]: Start accepts. Automaton has 6789 states and 15157 transitions. Word has length 95 [2018-12-02 08:58:57,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:58:57,194 INFO L480 AbstractCegarLoop]: Abstraction has 6789 states and 15157 transitions. [2018-12-02 08:58:57,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 08:58:57,194 INFO L276 IsEmpty]: Start isEmpty. Operand 6789 states and 15157 transitions. [2018-12-02 08:58:57,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 08:58:57,198 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:58:57,198 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] [2018-12-02 08:58:57,199 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:58:57,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:58:57,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1071746382, now seen corresponding path program 1 times [2018-12-02 08:58:57,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:58:57,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:58:57,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:57,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:58:57,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:57,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:58:57,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:58:57,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:58:57,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 08:58:57,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 08:58:57,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 08:58:57,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 08:58:57,271 INFO L87 Difference]: Start difference. First operand 6789 states and 15157 transitions. Second operand 6 states. [2018-12-02 08:58:57,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:58:57,387 INFO L93 Difference]: Finished difference Result 7655 states and 16871 transitions. [2018-12-02 08:58:57,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 08:58:57,387 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2018-12-02 08:58:57,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:58:57,394 INFO L225 Difference]: With dead ends: 7655 [2018-12-02 08:58:57,394 INFO L226 Difference]: Without dead ends: 7598 [2018-12-02 08:58:57,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-02 08:58:57,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7598 states. [2018-12-02 08:58:57,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7598 to 6741. [2018-12-02 08:58:57,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6741 states. [2018-12-02 08:58:57,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6741 states to 6741 states and 14912 transitions. [2018-12-02 08:58:57,448 INFO L78 Accepts]: Start accepts. Automaton has 6741 states and 14912 transitions. Word has length 95 [2018-12-02 08:58:57,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:58:57,448 INFO L480 AbstractCegarLoop]: Abstraction has 6741 states and 14912 transitions. [2018-12-02 08:58:57,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 08:58:57,448 INFO L276 IsEmpty]: Start isEmpty. Operand 6741 states and 14912 transitions. [2018-12-02 08:58:57,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 08:58:57,453 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:58:57,453 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] [2018-12-02 08:58:57,453 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:58:57,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:58:57,453 INFO L82 PathProgramCache]: Analyzing trace with hash -253609678, now seen corresponding path program 2 times [2018-12-02 08:58:57,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:58:57,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:58:57,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:57,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:58:57,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:57,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:58:57,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:58:57,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:58:57,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 08:58:57,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 08:58:57,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 08:58:57,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-02 08:58:57,558 INFO L87 Difference]: Start difference. First operand 6741 states and 14912 transitions. Second operand 9 states. [2018-12-02 08:58:58,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:58:58,261 INFO L93 Difference]: Finished difference Result 7596 states and 16787 transitions. [2018-12-02 08:58:58,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 08:58:58,262 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2018-12-02 08:58:58,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:58:58,270 INFO L225 Difference]: With dead ends: 7596 [2018-12-02 08:58:58,270 INFO L226 Difference]: Without dead ends: 7596 [2018-12-02 08:58:58,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-12-02 08:58:58,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7596 states. [2018-12-02 08:58:58,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7596 to 6893. [2018-12-02 08:58:58,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6893 states. [2018-12-02 08:58:58,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6893 states to 6893 states and 15258 transitions. [2018-12-02 08:58:58,332 INFO L78 Accepts]: Start accepts. Automaton has 6893 states and 15258 transitions. Word has length 95 [2018-12-02 08:58:58,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:58:58,332 INFO L480 AbstractCegarLoop]: Abstraction has 6893 states and 15258 transitions. [2018-12-02 08:58:58,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 08:58:58,333 INFO L276 IsEmpty]: Start isEmpty. Operand 6893 states and 15258 transitions. [2018-12-02 08:58:58,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 08:58:58,337 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:58:58,337 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] [2018-12-02 08:58:58,337 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:58:58,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:58:58,338 INFO L82 PathProgramCache]: Analyzing trace with hash -42258765, now seen corresponding path program 1 times [2018-12-02 08:58:58,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:58:58,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:58:58,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:58,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 08:58:58,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:58,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:58:58,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:58:58,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:58:58,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 08:58:58,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 08:58:58,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 08:58:58,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 08:58:58,379 INFO L87 Difference]: Start difference. First operand 6893 states and 15258 transitions. Second operand 6 states. [2018-12-02 08:58:58,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:58:58,489 INFO L93 Difference]: Finished difference Result 7014 states and 15445 transitions. [2018-12-02 08:58:58,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 08:58:58,489 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2018-12-02 08:58:58,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:58:58,494 INFO L225 Difference]: With dead ends: 7014 [2018-12-02 08:58:58,494 INFO L226 Difference]: Without dead ends: 7014 [2018-12-02 08:58:58,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-02 08:58:58,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7014 states. [2018-12-02 08:58:58,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7014 to 6716. [2018-12-02 08:58:58,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6716 states. [2018-12-02 08:58:58,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6716 states to 6716 states and 14831 transitions. [2018-12-02 08:58:58,543 INFO L78 Accepts]: Start accepts. Automaton has 6716 states and 14831 transitions. Word has length 95 [2018-12-02 08:58:58,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:58:58,544 INFO L480 AbstractCegarLoop]: Abstraction has 6716 states and 14831 transitions. [2018-12-02 08:58:58,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 08:58:58,544 INFO L276 IsEmpty]: Start isEmpty. Operand 6716 states and 14831 transitions. [2018-12-02 08:58:58,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 08:58:58,549 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:58:58,549 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] [2018-12-02 08:58:58,549 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:58:58,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:58:58,549 INFO L82 PathProgramCache]: Analyzing trace with hash -741980621, now seen corresponding path program 2 times [2018-12-02 08:58:58,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:58:58,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:58:58,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:58,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:58:58,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:58,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:58:58,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:58:58,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:58:58,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 08:58:58,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 08:58:58,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 08:58:58,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 08:58:58,604 INFO L87 Difference]: Start difference. First operand 6716 states and 14831 transitions. Second operand 7 states. [2018-12-02 08:58:58,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:58:58,687 INFO L93 Difference]: Finished difference Result 8609 states and 19057 transitions. [2018-12-02 08:58:58,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 08:58:58,687 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2018-12-02 08:58:58,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:58:58,692 INFO L225 Difference]: With dead ends: 8609 [2018-12-02 08:58:58,692 INFO L226 Difference]: Without dead ends: 8609 [2018-12-02 08:58:58,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-02 08:58:58,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8609 states. [2018-12-02 08:58:58,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8609 to 6345. [2018-12-02 08:58:58,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6345 states. [2018-12-02 08:58:58,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6345 states to 6345 states and 13949 transitions. [2018-12-02 08:58:58,744 INFO L78 Accepts]: Start accepts. Automaton has 6345 states and 13949 transitions. Word has length 95 [2018-12-02 08:58:58,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:58:58,744 INFO L480 AbstractCegarLoop]: Abstraction has 6345 states and 13949 transitions. [2018-12-02 08:58:58,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 08:58:58,744 INFO L276 IsEmpty]: Start isEmpty. Operand 6345 states and 13949 transitions. [2018-12-02 08:58:58,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 08:58:58,748 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:58:58,748 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] [2018-12-02 08:58:58,748 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:58:58,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:58:58,749 INFO L82 PathProgramCache]: Analyzing trace with hash -530629708, now seen corresponding path program 2 times [2018-12-02 08:58:58,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:58:58,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:58:58,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:58,750 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 08:58:58,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:58,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:58:58,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:58:58,799 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 08:58:58,866 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 08:58:58,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 08:58:58 BasicIcfg [2018-12-02 08:58:58,867 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 08:58:58,867 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 08:58:58,868 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 08:58:58,868 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 08:58:58,868 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:58:38" (3/4) ... [2018-12-02 08:58:58,870 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 08:58:58,941 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_28927481-d61e-4200-8676-ad0ddeda97c5/bin-2019/uautomizer/witness.graphml [2018-12-02 08:58:58,941 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 08:58:58,942 INFO L168 Benchmark]: Toolchain (without parser) took 21108.98 ms. Allocated memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: 1.7 GB). Free memory was 956.0 MB in the beginning and 2.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 616.2 MB. Max. memory is 11.5 GB. [2018-12-02 08:58:58,943 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 08:58:58,943 INFO L168 Benchmark]: CACSL2BoogieTranslator took 340.96 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 92.8 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -114.8 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. [2018-12-02 08:58:58,943 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.68 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-02 08:58:58,943 INFO L168 Benchmark]: Boogie Preprocessor took 19.72 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 08:58:58,943 INFO L168 Benchmark]: RCFGBuilder took 349.51 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 11.5 GB. [2018-12-02 08:58:58,944 INFO L168 Benchmark]: TraceAbstraction took 20290.57 ms. Allocated memory was 1.1 GB in the beginning and 2.8 GB in the end (delta: 1.7 GB). Free memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 546.9 MB. Max. memory is 11.5 GB. [2018-12-02 08:58:58,944 INFO L168 Benchmark]: Witness Printer took 73.86 ms. Allocated memory is still 2.8 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 36.7 MB). Peak memory consumption was 36.7 MB. Max. memory is 11.5 GB. [2018-12-02 08:58:58,945 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 340.96 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 92.8 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -114.8 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.68 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.72 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 349.51 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 20290.57 ms. Allocated memory was 1.1 GB in the beginning and 2.8 GB in the end (delta: 1.7 GB). Free memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 546.9 MB. Max. memory is 11.5 GB. * Witness Printer took 73.86 ms. Allocated memory is still 2.8 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 36.7 MB). Peak memory consumption was 36.7 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: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L675] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L681] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L682] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L683] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L684] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L685] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L686] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L687] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L688] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L689] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L690] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L691] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L692] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L693] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L694] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L695] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L696] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L697] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L770] -1 pthread_t t1297; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] FCALL, FORK -1 pthread_create(&t1297, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L701] 0 y$w_buff1 = y$w_buff0 [L702] 0 y$w_buff0 = 1 [L703] 0 y$w_buff1_used = y$w_buff0_used [L704] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L772] -1 pthread_t t1298; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] FCALL, FORK -1 pthread_create(&t1298, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L706] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L707] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L708] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L709] 0 y$r_buff0_thd1 = (_Bool)1 [L712] 0 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L715] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L729] 1 x = 1 [L732] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L733] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L734] 1 y$flush_delayed = weak$$choice2 [L735] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L737] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L737] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L738] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L739] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L740] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L741] EXPR 1 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L742] EXPR 1 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L743] 1 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L715] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L744] 1 y = y$flush_delayed ? y$mem_tmp : y [L745] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L716] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L716] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L717] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L717] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L718] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L718] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L719] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L719] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L722] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L748] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L748] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=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] [L749] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=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] [L750] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=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] [L751] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=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] [L752] 1 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] -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) [L780] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L781] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] -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 [L782] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L782] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L783] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L783] -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 [L786] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 222 locations, 3 error locations. UNSAFE Result, 20.2s OverallTime, 36 OverallIterations, 1 TraceHistogramMax, 11.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9434 SDtfs, 10376 SDslu, 24992 SDs, 0 SdLazy, 11598 SolverSat, 493 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 410 GetRequests, 98 SyntacticMatches, 43 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38973occurred in iteration=15, 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: 5.0s AutomataMinimizationTime, 35 MinimizatonAttempts, 90646 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 2739 NumberOfCodeBlocks, 2739 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 2609 ConstructedInterpolants, 0 QuantifiedInterpolants, 618990 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 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...