./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi001_pso.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_0408fbec-7ea0-4684-95e6-405e8253f87e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0408fbec-7ea0-4684-95e6-405e8253f87e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0408fbec-7ea0-4684-95e6-405e8253f87e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0408fbec-7ea0-4684-95e6-405e8253f87e/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi001_pso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_0408fbec-7ea0-4684-95e6-405e8253f87e/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0408fbec-7ea0-4684-95e6-405e8253f87e/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 4d16ad85263306ac9d29b22bbbb80825fd6ef8e4 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-09 01:41:22,444 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 01:41:22,445 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 01:41:22,451 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 01:41:22,451 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 01:41:22,452 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 01:41:22,453 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 01:41:22,453 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 01:41:22,454 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 01:41:22,454 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 01:41:22,455 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 01:41:22,455 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 01:41:22,455 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 01:41:22,456 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 01:41:22,456 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 01:41:22,457 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 01:41:22,457 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 01:41:22,458 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 01:41:22,459 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 01:41:22,460 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 01:41:22,460 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 01:41:22,461 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 01:41:22,462 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 01:41:22,462 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 01:41:22,462 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 01:41:22,463 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 01:41:22,463 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 01:41:22,464 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 01:41:22,464 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 01:41:22,464 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 01:41:22,465 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 01:41:22,465 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 01:41:22,465 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 01:41:22,465 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 01:41:22,466 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 01:41:22,466 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 01:41:22,466 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0408fbec-7ea0-4684-95e6-405e8253f87e/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-09 01:41:22,473 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 01:41:22,474 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 01:41:22,474 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 01:41:22,474 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 01:41:22,474 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 01:41:22,475 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 01:41:22,475 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 01:41:22,475 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 01:41:22,475 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 01:41:22,475 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 01:41:22,475 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 01:41:22,475 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 01:41:22,475 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 01:41:22,475 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 01:41:22,475 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 01:41:22,475 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 01:41:22,476 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 01:41:22,476 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 01:41:22,476 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 01:41:22,476 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 01:41:22,476 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 01:41:22,476 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 01:41:22,476 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 01:41:22,476 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 01:41:22,476 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 01:41:22,476 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 01:41:22,476 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 01:41:22,476 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 01:41:22,477 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 01:41:22,477 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 01:41:22,477 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_0408fbec-7ea0-4684-95e6-405e8253f87e/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 -> 4d16ad85263306ac9d29b22bbbb80825fd6ef8e4 [2018-12-09 01:41:22,495 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 01:41:22,501 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 01:41:22,503 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 01:41:22,504 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 01:41:22,504 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 01:41:22,505 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0408fbec-7ea0-4684-95e6-405e8253f87e/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/rfi001_pso.opt_false-unreach-call.i [2018-12-09 01:41:22,538 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0408fbec-7ea0-4684-95e6-405e8253f87e/bin-2019/uautomizer/data/99a7dfcf0/e7a375fb1c80484f96151b58684d332b/FLAG41afda7c0 [2018-12-09 01:41:22,926 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 01:41:22,926 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0408fbec-7ea0-4684-95e6-405e8253f87e/sv-benchmarks/c/pthread-wmm/rfi001_pso.opt_false-unreach-call.i [2018-12-09 01:41:22,934 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0408fbec-7ea0-4684-95e6-405e8253f87e/bin-2019/uautomizer/data/99a7dfcf0/e7a375fb1c80484f96151b58684d332b/FLAG41afda7c0 [2018-12-09 01:41:23,284 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0408fbec-7ea0-4684-95e6-405e8253f87e/bin-2019/uautomizer/data/99a7dfcf0/e7a375fb1c80484f96151b58684d332b [2018-12-09 01:41:23,286 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 01:41:23,286 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 01:41:23,287 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 01:41:23,287 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 01:41:23,289 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 01:41:23,290 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:41:23" (1/1) ... [2018-12-09 01:41:23,292 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@501fac56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:41:23, skipping insertion in model container [2018-12-09 01:41:23,292 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:41:23" (1/1) ... [2018-12-09 01:41:23,296 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 01:41:23,319 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 01:41:23,494 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 01:41:23,502 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 01:41:23,574 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 01:41:23,605 INFO L195 MainTranslator]: Completed translation [2018-12-09 01:41:23,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:41:23 WrapperNode [2018-12-09 01:41:23,605 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 01:41:23,606 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 01:41:23,606 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 01:41:23,606 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 01:41:23,611 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:41:23" (1/1) ... [2018-12-09 01:41:23,620 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:41:23" (1/1) ... [2018-12-09 01:41:23,639 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 01:41:23,639 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 01:41:23,639 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 01:41:23,639 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 01:41:23,646 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:41:23" (1/1) ... [2018-12-09 01:41:23,646 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:41:23" (1/1) ... [2018-12-09 01:41:23,648 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:41:23" (1/1) ... [2018-12-09 01:41:23,649 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:41:23" (1/1) ... [2018-12-09 01:41:23,654 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:41:23" (1/1) ... [2018-12-09 01:41:23,656 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:41:23" (1/1) ... [2018-12-09 01:41:23,658 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:41:23" (1/1) ... [2018-12-09 01:41:23,660 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 01:41:23,660 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 01:41:23,660 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 01:41:23,661 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 01:41:23,661 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:41:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0408fbec-7ea0-4684-95e6-405e8253f87e/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-09 01:41:23,707 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 01:41:23,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 01:41:23,707 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 01:41:23,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 01:41:23,708 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 01:41:23,708 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 01:41:23,708 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 01:41:23,708 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 01:41:23,708 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 01:41:23,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 01:41:23,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 01:41:23,709 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-09 01:41:24,019 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 01:41:24,019 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 01:41:24,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:41:24 BoogieIcfgContainer [2018-12-09 01:41:24,019 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 01:41:24,020 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 01:41:24,020 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 01:41:24,021 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 01:41:24,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 01:41:23" (1/3) ... [2018-12-09 01:41:24,022 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55b9077e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 01:41:24, skipping insertion in model container [2018-12-09 01:41:24,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:41:23" (2/3) ... [2018-12-09 01:41:24,022 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55b9077e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 01:41:24, skipping insertion in model container [2018-12-09 01:41:24,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:41:24" (3/3) ... [2018-12-09 01:41:24,023 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi001_pso.opt_false-unreach-call.i [2018-12-09 01:41:24,044 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,044 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,044 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,044 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,045 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,045 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,045 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,045 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,045 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,045 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,045 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,045 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,045 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,046 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,046 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,046 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,046 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,046 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,046 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,046 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,046 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,046 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,046 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,047 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,047 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,047 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,047 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,047 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,047 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,047 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,047 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,047 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,047 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,048 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,048 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,048 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,048 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,048 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,048 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,048 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,048 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,048 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,049 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,049 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,049 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,049 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,049 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,049 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,049 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,049 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,049 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,049 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,049 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,050 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,050 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,050 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,050 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,050 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,050 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,050 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,050 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,050 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,050 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,050 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,051 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,051 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,051 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,051 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,051 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,051 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,051 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,051 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 01:41:24,055 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 01:41:24,055 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 01:41:24,060 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 01:41:24,069 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 01:41:24,082 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 01:41:24,083 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 01:41:24,083 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 01:41:24,083 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 01:41:24,083 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 01:41:24,083 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 01:41:24,083 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 01:41:24,083 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 01:41:24,083 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 01:41:24,089 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143places, 181 transitions [2018-12-09 01:41:25,074 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25089 states. [2018-12-09 01:41:25,076 INFO L276 IsEmpty]: Start isEmpty. Operand 25089 states. [2018-12-09 01:41:25,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-09 01:41:25,082 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:41:25,082 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] [2018-12-09 01:41:25,084 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:41:25,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:41:25,087 INFO L82 PathProgramCache]: Analyzing trace with hash 2006103772, now seen corresponding path program 1 times [2018-12-09 01:41:25,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:41:25,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:41:25,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:25,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:41:25,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:25,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:41:25,249 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-09 01:41:25,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:41:25,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:41:25,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:41:25,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:41:25,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:41:25,268 INFO L87 Difference]: Start difference. First operand 25089 states. Second operand 4 states. [2018-12-09 01:41:25,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:41:25,651 INFO L93 Difference]: Finished difference Result 45389 states and 177627 transitions. [2018-12-09 01:41:25,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:41:25,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-12-09 01:41:25,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:41:25,807 INFO L225 Difference]: With dead ends: 45389 [2018-12-09 01:41:25,807 INFO L226 Difference]: Without dead ends: 40629 [2018-12-09 01:41:25,808 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-09 01:41:26,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40629 states. [2018-12-09 01:41:26,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40629 to 23663. [2018-12-09 01:41:26,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23663 states. [2018-12-09 01:41:26,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23663 states to 23663 states and 92544 transitions. [2018-12-09 01:41:26,480 INFO L78 Accepts]: Start accepts. Automaton has 23663 states and 92544 transitions. Word has length 38 [2018-12-09 01:41:26,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:41:26,481 INFO L480 AbstractCegarLoop]: Abstraction has 23663 states and 92544 transitions. [2018-12-09 01:41:26,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:41:26,481 INFO L276 IsEmpty]: Start isEmpty. Operand 23663 states and 92544 transitions. [2018-12-09 01:41:26,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-09 01:41:26,484 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:41:26,484 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-09 01:41:26,484 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:41:26,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:41:26,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1004185729, now seen corresponding path program 1 times [2018-12-09 01:41:26,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:41:26,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:41:26,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:26,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:41:26,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:26,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:41:26,521 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-09 01:41:26,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:41:26,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 01:41:26,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 01:41:26,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 01:41:26,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:41:26,523 INFO L87 Difference]: Start difference. First operand 23663 states and 92544 transitions. Second operand 3 states. [2018-12-09 01:41:26,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:41:26,650 INFO L93 Difference]: Finished difference Result 23663 states and 92160 transitions. [2018-12-09 01:41:26,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:41:26,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-12-09 01:41:26,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:41:26,704 INFO L225 Difference]: With dead ends: 23663 [2018-12-09 01:41:26,704 INFO L226 Difference]: Without dead ends: 23663 [2018-12-09 01:41:26,705 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-09 01:41:26,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23663 states. [2018-12-09 01:41:27,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23663 to 23663. [2018-12-09 01:41:27,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23663 states. [2018-12-09 01:41:27,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23663 states to 23663 states and 92160 transitions. [2018-12-09 01:41:27,157 INFO L78 Accepts]: Start accepts. Automaton has 23663 states and 92160 transitions. Word has length 45 [2018-12-09 01:41:27,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:41:27,158 INFO L480 AbstractCegarLoop]: Abstraction has 23663 states and 92160 transitions. [2018-12-09 01:41:27,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 01:41:27,158 INFO L276 IsEmpty]: Start isEmpty. Operand 23663 states and 92160 transitions. [2018-12-09 01:41:27,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-09 01:41:27,160 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:41:27,160 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-09 01:41:27,160 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:41:27,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:41:27,160 INFO L82 PathProgramCache]: Analyzing trace with hash -792765630, now seen corresponding path program 1 times [2018-12-09 01:41:27,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:41:27,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:41:27,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:27,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:41:27,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:27,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:41:27,201 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-09 01:41:27,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:41:27,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 01:41:27,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 01:41:27,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 01:41:27,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:41:27,202 INFO L87 Difference]: Start difference. First operand 23663 states and 92160 transitions. Second operand 5 states. [2018-12-09 01:41:27,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:41:27,755 INFO L93 Difference]: Finished difference Result 64831 states and 240932 transitions. [2018-12-09 01:41:27,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 01:41:27,756 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-12-09 01:41:27,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:41:27,891 INFO L225 Difference]: With dead ends: 64831 [2018-12-09 01:41:27,891 INFO L226 Difference]: Without dead ends: 64671 [2018-12-09 01:41:27,891 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-09 01:41:28,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64671 states. [2018-12-09 01:41:28,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64671 to 37143. [2018-12-09 01:41:28,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37143 states. [2018-12-09 01:41:28,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37143 states to 37143 states and 137901 transitions. [2018-12-09 01:41:28,656 INFO L78 Accepts]: Start accepts. Automaton has 37143 states and 137901 transitions. Word has length 45 [2018-12-09 01:41:28,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:41:28,657 INFO L480 AbstractCegarLoop]: Abstraction has 37143 states and 137901 transitions. [2018-12-09 01:41:28,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 01:41:28,657 INFO L276 IsEmpty]: Start isEmpty. Operand 37143 states and 137901 transitions. [2018-12-09 01:41:28,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 01:41:28,659 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:41:28,659 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-09 01:41:28,659 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:41:28,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:41:28,660 INFO L82 PathProgramCache]: Analyzing trace with hash -636463316, now seen corresponding path program 1 times [2018-12-09 01:41:28,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:41:28,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:41:28,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:28,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:41:28,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:28,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:41:28,718 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-09 01:41:28,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:41:28,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 01:41:28,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 01:41:28,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 01:41:28,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:41:28,719 INFO L87 Difference]: Start difference. First operand 37143 states and 137901 transitions. Second operand 5 states. [2018-12-09 01:41:29,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:41:29,219 INFO L93 Difference]: Finished difference Result 66627 states and 246202 transitions. [2018-12-09 01:41:29,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 01:41:29,219 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-09 01:41:29,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:41:29,335 INFO L225 Difference]: With dead ends: 66627 [2018-12-09 01:41:29,336 INFO L226 Difference]: Without dead ends: 66459 [2018-12-09 01:41:29,336 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-09 01:41:29,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66459 states. [2018-12-09 01:41:30,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66459 to 38835. [2018-12-09 01:41:30,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38835 states. [2018-12-09 01:41:30,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38835 states to 38835 states and 143659 transitions. [2018-12-09 01:41:30,250 INFO L78 Accepts]: Start accepts. Automaton has 38835 states and 143659 transitions. Word has length 46 [2018-12-09 01:41:30,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:41:30,250 INFO L480 AbstractCegarLoop]: Abstraction has 38835 states and 143659 transitions. [2018-12-09 01:41:30,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 01:41:30,250 INFO L276 IsEmpty]: Start isEmpty. Operand 38835 states and 143659 transitions. [2018-12-09 01:41:30,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 01:41:30,256 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:41:30,256 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:41:30,257 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:41:30,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:41:30,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1810531732, now seen corresponding path program 1 times [2018-12-09 01:41:30,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:41:30,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:41:30,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:30,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:41:30,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:30,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:41:30,294 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-09 01:41:30,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:41:30,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 01:41:30,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 01:41:30,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 01:41:30,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:41:30,295 INFO L87 Difference]: Start difference. First operand 38835 states and 143659 transitions. Second operand 3 states. [2018-12-09 01:41:30,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:41:30,443 INFO L93 Difference]: Finished difference Result 38835 states and 143586 transitions. [2018-12-09 01:41:30,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:41:30,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2018-12-09 01:41:30,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:41:30,506 INFO L225 Difference]: With dead ends: 38835 [2018-12-09 01:41:30,507 INFO L226 Difference]: Without dead ends: 38835 [2018-12-09 01:41:30,507 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-09 01:41:30,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38835 states. [2018-12-09 01:41:30,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38835 to 38835. [2018-12-09 01:41:30,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38835 states. [2018-12-09 01:41:31,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38835 states to 38835 states and 143586 transitions. [2018-12-09 01:41:31,060 INFO L78 Accepts]: Start accepts. Automaton has 38835 states and 143586 transitions. Word has length 53 [2018-12-09 01:41:31,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:41:31,060 INFO L480 AbstractCegarLoop]: Abstraction has 38835 states and 143586 transitions. [2018-12-09 01:41:31,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 01:41:31,060 INFO L276 IsEmpty]: Start isEmpty. Operand 38835 states and 143586 transitions. [2018-12-09 01:41:31,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 01:41:31,065 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:41:31,066 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:41:31,066 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:41:31,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:41:31,066 INFO L82 PathProgramCache]: Analyzing trace with hash -67721397, now seen corresponding path program 1 times [2018-12-09 01:41:31,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:41:31,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:41:31,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:31,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:41:31,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:31,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:41:31,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:41:31,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:41:31,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:41:31,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:41:31,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:41:31,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:41:31,104 INFO L87 Difference]: Start difference. First operand 38835 states and 143586 transitions. Second operand 4 states. [2018-12-09 01:41:31,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:41:31,148 INFO L93 Difference]: Finished difference Result 14217 states and 47041 transitions. [2018-12-09 01:41:31,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 01:41:31,148 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2018-12-09 01:41:31,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:41:31,165 INFO L225 Difference]: With dead ends: 14217 [2018-12-09 01:41:31,165 INFO L226 Difference]: Without dead ends: 13696 [2018-12-09 01:41:31,165 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-09 01:41:31,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13696 states. [2018-12-09 01:41:31,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13696 to 13696. [2018-12-09 01:41:31,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13696 states. [2018-12-09 01:41:31,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13696 states to 13696 states and 45489 transitions. [2018-12-09 01:41:31,329 INFO L78 Accepts]: Start accepts. Automaton has 13696 states and 45489 transitions. Word has length 53 [2018-12-09 01:41:31,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:41:31,329 INFO L480 AbstractCegarLoop]: Abstraction has 13696 states and 45489 transitions. [2018-12-09 01:41:31,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:41:31,329 INFO L276 IsEmpty]: Start isEmpty. Operand 13696 states and 45489 transitions. [2018-12-09 01:41:31,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-09 01:41:31,332 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:41:31,332 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:41:31,332 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:41:31,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:41:31,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1961100684, now seen corresponding path program 1 times [2018-12-09 01:41:31,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:41:31,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:41:31,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:31,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:41:31,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:31,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:41:31,387 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-09 01:41:31,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:41:31,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 01:41:31,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 01:41:31,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 01:41:31,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:41:31,388 INFO L87 Difference]: Start difference. First operand 13696 states and 45489 transitions. Second operand 5 states. [2018-12-09 01:41:31,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:41:31,425 INFO L93 Difference]: Finished difference Result 2224 states and 6069 transitions. [2018-12-09 01:41:31,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 01:41:31,425 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2018-12-09 01:41:31,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:41:31,427 INFO L225 Difference]: With dead ends: 2224 [2018-12-09 01:41:31,428 INFO L226 Difference]: Without dead ends: 1996 [2018-12-09 01:41:31,428 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-09 01:41:31,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1996 states. [2018-12-09 01:41:31,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1996 to 1989. [2018-12-09 01:41:31,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1989 states. [2018-12-09 01:41:31,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1989 states to 1989 states and 5400 transitions. [2018-12-09 01:41:31,448 INFO L78 Accepts]: Start accepts. Automaton has 1989 states and 5400 transitions. Word has length 59 [2018-12-09 01:41:31,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:41:31,448 INFO L480 AbstractCegarLoop]: Abstraction has 1989 states and 5400 transitions. [2018-12-09 01:41:31,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 01:41:31,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1989 states and 5400 transitions. [2018-12-09 01:41:31,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 01:41:31,450 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:41:31,450 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] [2018-12-09 01:41:31,451 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:41:31,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:41:31,451 INFO L82 PathProgramCache]: Analyzing trace with hash -611328299, now seen corresponding path program 1 times [2018-12-09 01:41:31,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:41:31,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:41:31,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:31,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:41:31,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:31,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:41:31,529 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-09 01:41:31,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:41:31,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:41:31,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:41:31,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:41:31,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:41:31,530 INFO L87 Difference]: Start difference. First operand 1989 states and 5400 transitions. Second operand 4 states. [2018-12-09 01:41:31,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:41:31,614 INFO L93 Difference]: Finished difference Result 2302 states and 6158 transitions. [2018-12-09 01:41:31,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:41:31,614 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-09 01:41:31,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:41:31,616 INFO L225 Difference]: With dead ends: 2302 [2018-12-09 01:41:31,617 INFO L226 Difference]: Without dead ends: 2302 [2018-12-09 01:41:31,617 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-09 01:41:31,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2302 states. [2018-12-09 01:41:31,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2302 to 2076. [2018-12-09 01:41:31,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2076 states. [2018-12-09 01:41:31,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2076 states to 2076 states and 5598 transitions. [2018-12-09 01:41:31,633 INFO L78 Accepts]: Start accepts. Automaton has 2076 states and 5598 transitions. Word has length 92 [2018-12-09 01:41:31,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:41:31,633 INFO L480 AbstractCegarLoop]: Abstraction has 2076 states and 5598 transitions. [2018-12-09 01:41:31,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:41:31,634 INFO L276 IsEmpty]: Start isEmpty. Operand 2076 states and 5598 transitions. [2018-12-09 01:41:31,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 01:41:31,636 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:41:31,636 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] [2018-12-09 01:41:31,636 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:41:31,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:41:31,636 INFO L82 PathProgramCache]: Analyzing trace with hash 358252724, now seen corresponding path program 1 times [2018-12-09 01:41:31,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:41:31,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:41:31,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:31,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:41:31,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:31,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:41:31,663 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-09 01:41:31,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:41:31,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:41:31,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:41:31,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:41:31,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:41:31,664 INFO L87 Difference]: Start difference. First operand 2076 states and 5598 transitions. Second operand 4 states. [2018-12-09 01:41:31,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:41:31,813 INFO L93 Difference]: Finished difference Result 2865 states and 7750 transitions. [2018-12-09 01:41:31,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:41:31,813 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-09 01:41:31,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:41:31,816 INFO L225 Difference]: With dead ends: 2865 [2018-12-09 01:41:31,816 INFO L226 Difference]: Without dead ends: 2865 [2018-12-09 01:41:31,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:41:31,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2865 states. [2018-12-09 01:41:31,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2865 to 2036. [2018-12-09 01:41:31,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2036 states. [2018-12-09 01:41:31,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2036 states to 2036 states and 5449 transitions. [2018-12-09 01:41:31,836 INFO L78 Accepts]: Start accepts. Automaton has 2036 states and 5449 transitions. Word has length 92 [2018-12-09 01:41:31,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:41:31,836 INFO L480 AbstractCegarLoop]: Abstraction has 2036 states and 5449 transitions. [2018-12-09 01:41:31,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:41:31,836 INFO L276 IsEmpty]: Start isEmpty. Operand 2036 states and 5449 transitions. [2018-12-09 01:41:31,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 01:41:31,839 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:41:31,839 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] [2018-12-09 01:41:31,839 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:41:31,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:41:31,839 INFO L82 PathProgramCache]: Analyzing trace with hash -377590202, now seen corresponding path program 2 times [2018-12-09 01:41:31,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:41:31,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:41:31,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:31,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:41:31,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:31,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:41:31,895 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-09 01:41:31,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:41:31,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 01:41:31,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 01:41:31,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 01:41:31,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:41:31,896 INFO L87 Difference]: Start difference. First operand 2036 states and 5449 transitions. Second operand 5 states. [2018-12-09 01:41:31,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:41:31,999 INFO L93 Difference]: Finished difference Result 2272 states and 6030 transitions. [2018-12-09 01:41:32,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 01:41:32,000 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2018-12-09 01:41:32,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:41:32,001 INFO L225 Difference]: With dead ends: 2272 [2018-12-09 01:41:32,001 INFO L226 Difference]: Without dead ends: 2272 [2018-12-09 01:41:32,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 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-09 01:41:32,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2272 states. [2018-12-09 01:41:32,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2272 to 2033. [2018-12-09 01:41:32,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2033 states. [2018-12-09 01:41:32,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2033 states to 2033 states and 5442 transitions. [2018-12-09 01:41:32,056 INFO L78 Accepts]: Start accepts. Automaton has 2033 states and 5442 transitions. Word has length 92 [2018-12-09 01:41:32,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:41:32,056 INFO L480 AbstractCegarLoop]: Abstraction has 2033 states and 5442 transitions. [2018-12-09 01:41:32,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 01:41:32,056 INFO L276 IsEmpty]: Start isEmpty. Operand 2033 states and 5442 transitions. [2018-12-09 01:41:32,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 01:41:32,058 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:41:32,058 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] [2018-12-09 01:41:32,058 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:41:32,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:41:32,058 INFO L82 PathProgramCache]: Analyzing trace with hash 2119308593, now seen corresponding path program 1 times [2018-12-09 01:41:32,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:41:32,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:41:32,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:32,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:41:32,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:32,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:41:32,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:41:32,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:41:32,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 01:41:32,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 01:41:32,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 01:41:32,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:41:32,086 INFO L87 Difference]: Start difference. First operand 2033 states and 5442 transitions. Second operand 3 states. [2018-12-09 01:41:32,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:41:32,152 INFO L93 Difference]: Finished difference Result 2073 states and 5527 transitions. [2018-12-09 01:41:32,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:41:32,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2018-12-09 01:41:32,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:41:32,154 INFO L225 Difference]: With dead ends: 2073 [2018-12-09 01:41:32,154 INFO L226 Difference]: Without dead ends: 2073 [2018-12-09 01:41:32,155 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-09 01:41:32,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2073 states. [2018-12-09 01:41:32,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2073 to 2045. [2018-12-09 01:41:32,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2045 states. [2018-12-09 01:41:32,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2045 states to 2045 states and 5466 transitions. [2018-12-09 01:41:32,168 INFO L78 Accepts]: Start accepts. Automaton has 2045 states and 5466 transitions. Word has length 92 [2018-12-09 01:41:32,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:41:32,168 INFO L480 AbstractCegarLoop]: Abstraction has 2045 states and 5466 transitions. [2018-12-09 01:41:32,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 01:41:32,168 INFO L276 IsEmpty]: Start isEmpty. Operand 2045 states and 5466 transitions. [2018-12-09 01:41:32,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 01:41:32,170 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:41:32,170 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] [2018-12-09 01:41:32,170 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:41:32,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:41:32,170 INFO L82 PathProgramCache]: Analyzing trace with hash 837549783, now seen corresponding path program 1 times [2018-12-09 01:41:32,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:41:32,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:41:32,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:32,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:41:32,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:32,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:41:32,199 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-09 01:41:32,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:41:32,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:41:32,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:41:32,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:41:32,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:41:32,200 INFO L87 Difference]: Start difference. First operand 2045 states and 5466 transitions. Second operand 4 states. [2018-12-09 01:41:32,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:41:32,274 INFO L93 Difference]: Finished difference Result 3947 states and 10640 transitions. [2018-12-09 01:41:32,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:41:32,274 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-09 01:41:32,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:41:32,277 INFO L225 Difference]: With dead ends: 3947 [2018-12-09 01:41:32,277 INFO L226 Difference]: Without dead ends: 3947 [2018-12-09 01:41:32,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:41:32,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3947 states. [2018-12-09 01:41:32,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3947 to 2030. [2018-12-09 01:41:32,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2030 states. [2018-12-09 01:41:32,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2030 states to 2030 states and 5399 transitions. [2018-12-09 01:41:32,296 INFO L78 Accepts]: Start accepts. Automaton has 2030 states and 5399 transitions. Word has length 94 [2018-12-09 01:41:32,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:41:32,296 INFO L480 AbstractCegarLoop]: Abstraction has 2030 states and 5399 transitions. [2018-12-09 01:41:32,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:41:32,296 INFO L276 IsEmpty]: Start isEmpty. Operand 2030 states and 5399 transitions. [2018-12-09 01:41:32,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 01:41:32,297 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:41:32,297 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] [2018-12-09 01:41:32,297 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:41:32,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:41:32,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1995837514, now seen corresponding path program 1 times [2018-12-09 01:41:32,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:41:32,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:41:32,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:32,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:41:32,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:32,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:41:32,352 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-09 01:41:32,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:41:32,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 01:41:32,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 01:41:32,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 01:41:32,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 01:41:32,353 INFO L87 Difference]: Start difference. First operand 2030 states and 5399 transitions. Second operand 6 states. [2018-12-09 01:41:32,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:41:32,552 INFO L93 Difference]: Finished difference Result 2272 states and 5884 transitions. [2018-12-09 01:41:32,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 01:41:32,552 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-09 01:41:32,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:41:32,554 INFO L225 Difference]: With dead ends: 2272 [2018-12-09 01:41:32,554 INFO L226 Difference]: Without dead ends: 2212 [2018-12-09 01:41:32,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 01:41:32,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2212 states. [2018-12-09 01:41:32,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2212 to 2156. [2018-12-09 01:41:32,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2156 states. [2018-12-09 01:41:32,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 5652 transitions. [2018-12-09 01:41:32,569 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 5652 transitions. Word has length 94 [2018-12-09 01:41:32,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:41:32,569 INFO L480 AbstractCegarLoop]: Abstraction has 2156 states and 5652 transitions. [2018-12-09 01:41:32,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 01:41:32,569 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 5652 transitions. [2018-12-09 01:41:32,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 01:41:32,570 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:41:32,571 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] [2018-12-09 01:41:32,571 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:41:32,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:41:32,571 INFO L82 PathProgramCache]: Analyzing trace with hash -295097035, now seen corresponding path program 1 times [2018-12-09 01:41:32,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:41:32,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:41:32,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:32,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:41:32,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:32,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:41:32,648 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-09 01:41:32,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:41:32,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 01:41:32,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 01:41:32,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 01:41:32,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 01:41:32,649 INFO L87 Difference]: Start difference. First operand 2156 states and 5652 transitions. Second operand 7 states. [2018-12-09 01:41:32,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:41:32,879 INFO L93 Difference]: Finished difference Result 2361 states and 6165 transitions. [2018-12-09 01:41:32,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 01:41:32,880 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-09 01:41:32,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:41:32,882 INFO L225 Difference]: With dead ends: 2361 [2018-12-09 01:41:32,882 INFO L226 Difference]: Without dead ends: 2361 [2018-12-09 01:41:32,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 01:41:32,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2361 states. [2018-12-09 01:41:32,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2361 to 2140. [2018-12-09 01:41:32,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2140 states. [2018-12-09 01:41:32,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 5619 transitions. [2018-12-09 01:41:32,897 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 5619 transitions. Word has length 94 [2018-12-09 01:41:32,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:41:32,897 INFO L480 AbstractCegarLoop]: Abstraction has 2140 states and 5619 transitions. [2018-12-09 01:41:32,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 01:41:32,897 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 5619 transitions. [2018-12-09 01:41:32,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 01:41:32,899 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:41:32,899 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:41:32,899 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:41:32,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:41:32,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1115782485, now seen corresponding path program 1 times [2018-12-09 01:41:32,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:41:32,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:41:32,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:32,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:41:32,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:32,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:41:32,945 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-09 01:41:32,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:41:32,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 01:41:32,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 01:41:32,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 01:41:32,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:41:32,946 INFO L87 Difference]: Start difference. First operand 2140 states and 5619 transitions. Second operand 5 states. [2018-12-09 01:41:33,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:41:33,006 INFO L93 Difference]: Finished difference Result 2131 states and 5536 transitions. [2018-12-09 01:41:33,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:41:33,007 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-09 01:41:33,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:41:33,008 INFO L225 Difference]: With dead ends: 2131 [2018-12-09 01:41:33,008 INFO L226 Difference]: Without dead ends: 2131 [2018-12-09 01:41:33,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-09 01:41:33,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2131 states. [2018-12-09 01:41:33,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2131 to 2129. [2018-12-09 01:41:33,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2129 states. [2018-12-09 01:41:33,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2129 states to 2129 states and 5532 transitions. [2018-12-09 01:41:33,025 INFO L78 Accepts]: Start accepts. Automaton has 2129 states and 5532 transitions. Word has length 94 [2018-12-09 01:41:33,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:41:33,025 INFO L480 AbstractCegarLoop]: Abstraction has 2129 states and 5532 transitions. [2018-12-09 01:41:33,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 01:41:33,026 INFO L276 IsEmpty]: Start isEmpty. Operand 2129 states and 5532 transitions. [2018-12-09 01:41:33,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 01:41:33,027 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:41:33,027 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] [2018-12-09 01:41:33,028 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:41:33,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:41:33,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1663464556, now seen corresponding path program 1 times [2018-12-09 01:41:33,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:41:33,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:41:33,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:33,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:41:33,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:33,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:41:33,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:41:33,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:41:33,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 01:41:33,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 01:41:33,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 01:41:33,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:41:33,067 INFO L87 Difference]: Start difference. First operand 2129 states and 5532 transitions. Second operand 5 states. [2018-12-09 01:41:33,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:41:33,177 INFO L93 Difference]: Finished difference Result 3911 states and 10414 transitions. [2018-12-09 01:41:33,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 01:41:33,177 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-09 01:41:33,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:41:33,180 INFO L225 Difference]: With dead ends: 3911 [2018-12-09 01:41:33,180 INFO L226 Difference]: Without dead ends: 3911 [2018-12-09 01:41:33,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-09 01:41:33,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3911 states. [2018-12-09 01:41:33,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3911 to 2165. [2018-12-09 01:41:33,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2165 states. [2018-12-09 01:41:33,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2165 states to 2165 states and 5612 transitions. [2018-12-09 01:41:33,199 INFO L78 Accepts]: Start accepts. Automaton has 2165 states and 5612 transitions. Word has length 94 [2018-12-09 01:41:33,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:41:33,199 INFO L480 AbstractCegarLoop]: Abstraction has 2165 states and 5612 transitions. [2018-12-09 01:41:33,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 01:41:33,199 INFO L276 IsEmpty]: Start isEmpty. Operand 2165 states and 5612 transitions. [2018-12-09 01:41:33,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 01:41:33,201 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:41:33,201 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] [2018-12-09 01:41:33,201 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:41:33,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:41:33,201 INFO L82 PathProgramCache]: Analyzing trace with hash -695842453, now seen corresponding path program 1 times [2018-12-09 01:41:33,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:41:33,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:41:33,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:33,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:41:33,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:33,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:41:33,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-09 01:41:33,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:41:33,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 01:41:33,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 01:41:33,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 01:41:33,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 01:41:33,277 INFO L87 Difference]: Start difference. First operand 2165 states and 5612 transitions. Second operand 6 states. [2018-12-09 01:41:33,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:41:33,370 INFO L93 Difference]: Finished difference Result 1877 states and 4716 transitions. [2018-12-09 01:41:33,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 01:41:33,370 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-09 01:41:33,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:41:33,372 INFO L225 Difference]: With dead ends: 1877 [2018-12-09 01:41:33,372 INFO L226 Difference]: Without dead ends: 1877 [2018-12-09 01:41:33,372 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-09 01:41:33,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1877 states. [2018-12-09 01:41:33,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1877 to 1668. [2018-12-09 01:41:33,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1668 states. [2018-12-09 01:41:33,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1668 states and 4216 transitions. [2018-12-09 01:41:33,386 INFO L78 Accepts]: Start accepts. Automaton has 1668 states and 4216 transitions. Word has length 94 [2018-12-09 01:41:33,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:41:33,386 INFO L480 AbstractCegarLoop]: Abstraction has 1668 states and 4216 transitions. [2018-12-09 01:41:33,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 01:41:33,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 4216 transitions. [2018-12-09 01:41:33,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 01:41:33,388 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:41:33,388 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:41:33,388 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:41:33,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:41:33,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1001566435, now seen corresponding path program 1 times [2018-12-09 01:41:33,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:41:33,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:41:33,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:33,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:41:33,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:33,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:41:33,442 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-09 01:41:33,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:41:33,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 01:41:33,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 01:41:33,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 01:41:33,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-09 01:41:33,443 INFO L87 Difference]: Start difference. First operand 1668 states and 4216 transitions. Second operand 8 states. [2018-12-09 01:41:33,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:41:33,769 INFO L93 Difference]: Finished difference Result 3044 states and 7595 transitions. [2018-12-09 01:41:33,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 01:41:33,770 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2018-12-09 01:41:33,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:41:33,772 INFO L225 Difference]: With dead ends: 3044 [2018-12-09 01:41:33,772 INFO L226 Difference]: Without dead ends: 3044 [2018-12-09 01:41:33,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-12-09 01:41:33,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3044 states. [2018-12-09 01:41:33,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3044 to 2386. [2018-12-09 01:41:33,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2386 states. [2018-12-09 01:41:33,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2386 states to 2386 states and 6058 transitions. [2018-12-09 01:41:33,789 INFO L78 Accepts]: Start accepts. Automaton has 2386 states and 6058 transitions. Word has length 96 [2018-12-09 01:41:33,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:41:33,789 INFO L480 AbstractCegarLoop]: Abstraction has 2386 states and 6058 transitions. [2018-12-09 01:41:33,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 01:41:33,789 INFO L276 IsEmpty]: Start isEmpty. Operand 2386 states and 6058 transitions. [2018-12-09 01:41:33,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 01:41:33,791 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:41:33,791 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:41:33,791 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:41:33,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:41:33,791 INFO L82 PathProgramCache]: Analyzing trace with hash -2048636380, now seen corresponding path program 1 times [2018-12-09 01:41:33,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:41:33,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:41:33,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:33,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:41:33,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:33,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:41:33,848 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-09 01:41:33,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:41:33,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 01:41:33,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 01:41:33,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 01:41:33,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 01:41:33,849 INFO L87 Difference]: Start difference. First operand 2386 states and 6058 transitions. Second operand 7 states. [2018-12-09 01:41:34,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:41:34,054 INFO L93 Difference]: Finished difference Result 2463 states and 6197 transitions. [2018-12-09 01:41:34,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 01:41:34,055 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-09 01:41:34,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:41:34,057 INFO L225 Difference]: With dead ends: 2463 [2018-12-09 01:41:34,057 INFO L226 Difference]: Without dead ends: 2443 [2018-12-09 01:41:34,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-12-09 01:41:34,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2443 states. [2018-12-09 01:41:34,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2443 to 2370. [2018-12-09 01:41:34,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2370 states. [2018-12-09 01:41:34,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2370 states to 2370 states and 6018 transitions. [2018-12-09 01:41:34,073 INFO L78 Accepts]: Start accepts. Automaton has 2370 states and 6018 transitions. Word has length 96 [2018-12-09 01:41:34,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:41:34,073 INFO L480 AbstractCegarLoop]: Abstraction has 2370 states and 6018 transitions. [2018-12-09 01:41:34,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 01:41:34,073 INFO L276 IsEmpty]: Start isEmpty. Operand 2370 states and 6018 transitions. [2018-12-09 01:41:34,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 01:41:34,075 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:41:34,075 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:41:34,076 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:41:34,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:41:34,076 INFO L82 PathProgramCache]: Analyzing trace with hash -77696923, now seen corresponding path program 1 times [2018-12-09 01:41:34,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:41:34,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:41:34,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:34,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:41:34,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:34,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:41:34,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:41:34,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:41:34,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 01:41:34,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 01:41:34,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 01:41:34,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 01:41:34,149 INFO L87 Difference]: Start difference. First operand 2370 states and 6018 transitions. Second operand 6 states. [2018-12-09 01:41:34,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:41:34,274 INFO L93 Difference]: Finished difference Result 2483 states and 6279 transitions. [2018-12-09 01:41:34,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 01:41:34,274 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-09 01:41:34,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:41:34,276 INFO L225 Difference]: With dead ends: 2483 [2018-12-09 01:41:34,276 INFO L226 Difference]: Without dead ends: 2483 [2018-12-09 01:41:34,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-12-09 01:41:34,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2483 states. [2018-12-09 01:41:34,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2483 to 2423. [2018-12-09 01:41:34,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2423 states. [2018-12-09 01:41:34,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2423 states to 2423 states and 6147 transitions. [2018-12-09 01:41:34,293 INFO L78 Accepts]: Start accepts. Automaton has 2423 states and 6147 transitions. Word has length 96 [2018-12-09 01:41:34,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:41:34,293 INFO L480 AbstractCegarLoop]: Abstraction has 2423 states and 6147 transitions. [2018-12-09 01:41:34,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 01:41:34,293 INFO L276 IsEmpty]: Start isEmpty. Operand 2423 states and 6147 transitions. [2018-12-09 01:41:34,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 01:41:34,295 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:41:34,295 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:41:34,296 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:41:34,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:41:34,296 INFO L82 PathProgramCache]: Analyzing trace with hash -992695643, now seen corresponding path program 1 times [2018-12-09 01:41:34,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:41:34,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:41:34,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:34,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:41:34,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:34,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:41:34,344 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-09 01:41:34,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:41:34,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 01:41:34,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 01:41:34,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 01:41:34,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:41:34,344 INFO L87 Difference]: Start difference. First operand 2423 states and 6147 transitions. Second operand 5 states. [2018-12-09 01:41:34,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:41:34,435 INFO L93 Difference]: Finished difference Result 2743 states and 6947 transitions. [2018-12-09 01:41:34,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 01:41:34,435 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-09 01:41:34,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:41:34,438 INFO L225 Difference]: With dead ends: 2743 [2018-12-09 01:41:34,438 INFO L226 Difference]: Without dead ends: 2743 [2018-12-09 01:41:34,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 01:41:34,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2743 states. [2018-12-09 01:41:34,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2743 to 2152. [2018-12-09 01:41:34,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2152 states. [2018-12-09 01:41:34,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2152 states to 2152 states and 5472 transitions. [2018-12-09 01:41:34,457 INFO L78 Accepts]: Start accepts. Automaton has 2152 states and 5472 transitions. Word has length 96 [2018-12-09 01:41:34,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:41:34,458 INFO L480 AbstractCegarLoop]: Abstraction has 2152 states and 5472 transitions. [2018-12-09 01:41:34,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 01:41:34,458 INFO L276 IsEmpty]: Start isEmpty. Operand 2152 states and 5472 transitions. [2018-12-09 01:41:34,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 01:41:34,460 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:41:34,460 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:41:34,460 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:41:34,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:41:34,460 INFO L82 PathProgramCache]: Analyzing trace with hash 252068838, now seen corresponding path program 1 times [2018-12-09 01:41:34,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:41:34,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:41:34,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:34,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:41:34,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:34,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:41:34,526 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-09 01:41:34,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:41:34,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 01:41:34,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 01:41:34,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 01:41:34,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-09 01:41:34,526 INFO L87 Difference]: Start difference. First operand 2152 states and 5472 transitions. Second operand 9 states. [2018-12-09 01:41:34,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:41:34,634 INFO L93 Difference]: Finished difference Result 3904 states and 10123 transitions. [2018-12-09 01:41:34,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 01:41:34,634 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2018-12-09 01:41:34,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:41:34,636 INFO L225 Difference]: With dead ends: 3904 [2018-12-09 01:41:34,637 INFO L226 Difference]: Without dead ends: 1836 [2018-12-09 01:41:34,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-12-09 01:41:34,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1836 states. [2018-12-09 01:41:34,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1836 to 1836. [2018-12-09 01:41:34,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1836 states. [2018-12-09 01:41:34,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1836 states to 1836 states and 4797 transitions. [2018-12-09 01:41:34,656 INFO L78 Accepts]: Start accepts. Automaton has 1836 states and 4797 transitions. Word has length 96 [2018-12-09 01:41:34,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:41:34,656 INFO L480 AbstractCegarLoop]: Abstraction has 1836 states and 4797 transitions. [2018-12-09 01:41:34,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 01:41:34,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1836 states and 4797 transitions. [2018-12-09 01:41:34,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 01:41:34,659 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:41:34,659 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:41:34,659 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:41:34,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:41:34,659 INFO L82 PathProgramCache]: Analyzing trace with hash 981350673, now seen corresponding path program 2 times [2018-12-09 01:41:34,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:41:34,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:41:34,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:34,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:41:34,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:34,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:41:34,744 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-09 01:41:34,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:41:34,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 01:41:34,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 01:41:34,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 01:41:34,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 01:41:34,744 INFO L87 Difference]: Start difference. First operand 1836 states and 4797 transitions. Second operand 6 states. [2018-12-09 01:41:34,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:41:34,895 INFO L93 Difference]: Finished difference Result 1912 states and 4951 transitions. [2018-12-09 01:41:34,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 01:41:34,895 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-09 01:41:34,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:41:34,896 INFO L225 Difference]: With dead ends: 1912 [2018-12-09 01:41:34,896 INFO L226 Difference]: Without dead ends: 1912 [2018-12-09 01:41:34,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-12-09 01:41:34,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1912 states. [2018-12-09 01:41:34,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1912 to 1846. [2018-12-09 01:41:34,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1846 states. [2018-12-09 01:41:34,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1846 states to 1846 states and 4824 transitions. [2018-12-09 01:41:34,908 INFO L78 Accepts]: Start accepts. Automaton has 1846 states and 4824 transitions. Word has length 96 [2018-12-09 01:41:34,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:41:34,908 INFO L480 AbstractCegarLoop]: Abstraction has 1846 states and 4824 transitions. [2018-12-09 01:41:34,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 01:41:34,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1846 states and 4824 transitions. [2018-12-09 01:41:34,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 01:41:34,910 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:41:34,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, 1, 1, 1, 1, 1, 1, 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-09 01:41:34,910 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:41:34,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:41:34,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1311116434, now seen corresponding path program 2 times [2018-12-09 01:41:34,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:41:34,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:41:34,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:34,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:41:34,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:34,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:41:35,008 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-09 01:41:35,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:41:35,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 01:41:35,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 01:41:35,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 01:41:35,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-09 01:41:35,009 INFO L87 Difference]: Start difference. First operand 1846 states and 4824 transitions. Second operand 12 states. [2018-12-09 01:41:35,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:41:35,331 INFO L93 Difference]: Finished difference Result 3508 states and 9256 transitions. [2018-12-09 01:41:35,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 01:41:35,331 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2018-12-09 01:41:35,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:41:35,333 INFO L225 Difference]: With dead ends: 3508 [2018-12-09 01:41:35,333 INFO L226 Difference]: Without dead ends: 2532 [2018-12-09 01:41:35,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-12-09 01:41:35,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2532 states. [2018-12-09 01:41:35,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2532 to 2380. [2018-12-09 01:41:35,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2380 states. [2018-12-09 01:41:35,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2380 states to 2380 states and 6080 transitions. [2018-12-09 01:41:35,349 INFO L78 Accepts]: Start accepts. Automaton has 2380 states and 6080 transitions. Word has length 96 [2018-12-09 01:41:35,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:41:35,349 INFO L480 AbstractCegarLoop]: Abstraction has 2380 states and 6080 transitions. [2018-12-09 01:41:35,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 01:41:35,349 INFO L276 IsEmpty]: Start isEmpty. Operand 2380 states and 6080 transitions. [2018-12-09 01:41:35,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 01:41:35,351 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:41:35,351 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:41:35,351 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:41:35,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:41:35,351 INFO L82 PathProgramCache]: Analyzing trace with hash 187348118, now seen corresponding path program 3 times [2018-12-09 01:41:35,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:41:35,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:41:35,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:35,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:41:35,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:41:35,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:41:35,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:41:35,390 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 01:41:35,448 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 01:41:35,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 01:41:35 BasicIcfg [2018-12-09 01:41:35,449 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 01:41:35,450 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 01:41:35,450 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 01:41:35,450 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 01:41:35,450 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:41:24" (3/4) ... [2018-12-09 01:41:35,452 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 01:41:35,515 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_0408fbec-7ea0-4684-95e6-405e8253f87e/bin-2019/uautomizer/witness.graphml [2018-12-09 01:41:35,515 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 01:41:35,516 INFO L168 Benchmark]: Toolchain (without parser) took 12229.96 ms. Allocated memory was 1.0 GB in the beginning and 2.9 GB in the end (delta: 1.9 GB). Free memory was 950.6 MB in the beginning and 2.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 532.4 MB. Max. memory is 11.5 GB. [2018-12-09 01:41:35,517 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 01:41:35,517 INFO L168 Benchmark]: CACSL2BoogieTranslator took 318.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -165.7 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. [2018-12-09 01:41:35,517 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2018-12-09 01:41:35,517 INFO L168 Benchmark]: Boogie Preprocessor took 20.98 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 01:41:35,517 INFO L168 Benchmark]: RCFGBuilder took 358.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. [2018-12-09 01:41:35,517 INFO L168 Benchmark]: TraceAbstraction took 11429.93 ms. Allocated memory was 1.2 GB in the beginning and 2.9 GB in the end (delta: 1.7 GB). Free memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 472.3 MB. Max. memory is 11.5 GB. [2018-12-09 01:41:35,517 INFO L168 Benchmark]: Witness Printer took 65.59 ms. Allocated memory is still 2.9 GB. Free memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: 34.2 MB). Peak memory consumption was 34.2 MB. Max. memory is 11.5 GB. [2018-12-09 01:41:35,518 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 318.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -165.7 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.98 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 358.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11429.93 ms. Allocated memory was 1.2 GB in the beginning and 2.9 GB in the end (delta: 1.7 GB). Free memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 472.3 MB. Max. memory is 11.5 GB. * Witness Printer took 65.59 ms. Allocated memory is still 2.9 GB. Free memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: 34.2 MB). Peak memory consumption was 34.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L675] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L681] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L682] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L683] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L684] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L685] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L686] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L687] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L688] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L689] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L690] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L691] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L692] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L693] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L694] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L695] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L697] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L698] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L699] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L765] -1 pthread_t t1609; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L766] FCALL, FORK -1 pthread_create(&t1609, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L767] -1 pthread_t t1610; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L768] FCALL, FORK -1 pthread_create(&t1610, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L723] 0 y$w_buff1 = y$w_buff0 [L724] 0 y$w_buff0 = 2 [L725] 0 y$w_buff1_used = y$w_buff0_used [L726] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L728] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L729] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L730] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L731] 0 y$r_buff0_thd2 = (_Bool)1 [L734] 0 z = 1 [L737] 0 __unbuffered_p1_EAX = z [L740] 0 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L743] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L703] 1 x = 1 [L706] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L743] 0 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L744] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L709] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L709] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2, z=1] [L745] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2, z=1] [L745] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L709] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2, z=1] [L709] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L710] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L710] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L746] 0 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L747] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L747] 0 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L750] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L711] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L711] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L712] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L712] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L713] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L713] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L716] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L770] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] -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) [L775] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L775] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L776] 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L776] -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 [L777] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L777] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L778] 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L778] -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 [L781] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L782] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L783] -1 y$flush_delayed = weak$$choice2 [L784] -1 y$mem_tmp = y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L785] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L785] -1 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L786] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L786] -1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L787] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] -1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L788] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L788] -1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L789] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L789] -1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L790] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L790] -1 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L791] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] -1 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L792] -1 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L793] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L793] -1 y = y$flush_delayed ? y$mem_tmp : y [L794] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 181 locations, 3 error locations. UNSAFE Result, 11.3s OverallTime, 25 OverallIterations, 1 TraceHistogramMax, 4.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4811 SDtfs, 4490 SDslu, 11189 SDs, 0 SdLazy, 3863 SolverSat, 254 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 226 GetRequests, 68 SyntacticMatches, 13 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38835occurred in iteration=4, 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: 3.8s AutomataMinimizationTime, 24 MinimizatonAttempts, 79198 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 2039 NumberOfCodeBlocks, 2039 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1919 ConstructedInterpolants, 0 QuantifiedInterpolants, 399236 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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...