./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe031_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_25a4fdc4-0e07-446a-ab83-f7aee7f2869a/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_25a4fdc4-0e07-446a-ab83-f7aee7f2869a/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_25a4fdc4-0e07-446a-ab83-f7aee7f2869a/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_25a4fdc4-0e07-446a-ab83-f7aee7f2869a/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe031_pso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_25a4fdc4-0e07-446a-ab83-f7aee7f2869a/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_25a4fdc4-0e07-446a-ab83-f7aee7f2869a/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 52f250ce523e42d8ac81c9c1780b17f1f4712371 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 08:00:03,161 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 08:00:03,161 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 08:00:03,167 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 08:00:03,168 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 08:00:03,168 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 08:00:03,169 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 08:00:03,170 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 08:00:03,171 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 08:00:03,171 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 08:00:03,171 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 08:00:03,172 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 08:00:03,172 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 08:00:03,173 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 08:00:03,173 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 08:00:03,173 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 08:00:03,174 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 08:00:03,175 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 08:00:03,176 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 08:00:03,177 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 08:00:03,177 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 08:00:03,178 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 08:00:03,179 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 08:00:03,179 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 08:00:03,179 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 08:00:03,180 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 08:00:03,180 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 08:00:03,181 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 08:00:03,181 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 08:00:03,182 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 08:00:03,182 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 08:00:03,182 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 08:00:03,182 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 08:00:03,182 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 08:00:03,183 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 08:00:03,183 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 08:00:03,183 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_25a4fdc4-0e07-446a-ab83-f7aee7f2869a/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-09 08:00:03,191 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 08:00:03,191 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 08:00:03,191 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 08:00:03,191 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 08:00:03,192 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 08:00:03,192 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 08:00:03,192 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 08:00:03,192 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 08:00:03,192 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 08:00:03,192 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 08:00:03,192 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 08:00:03,192 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 08:00:03,192 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 08:00:03,192 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 08:00:03,192 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 08:00:03,192 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 08:00:03,193 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 08:00:03,193 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 08:00:03,193 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 08:00:03,193 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 08:00:03,193 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 08:00:03,193 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 08:00:03,193 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 08:00:03,193 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 08:00:03,193 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 08:00:03,193 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 08:00:03,193 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 08:00:03,193 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 08:00:03,194 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 08:00:03,194 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 08:00:03,194 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_25a4fdc4-0e07-446a-ab83-f7aee7f2869a/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 -> 52f250ce523e42d8ac81c9c1780b17f1f4712371 [2018-12-09 08:00:03,212 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 08:00:03,218 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 08:00:03,220 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 08:00:03,221 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 08:00:03,221 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 08:00:03,222 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_25a4fdc4-0e07-446a-ab83-f7aee7f2869a/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe031_pso.opt_false-unreach-call.i [2018-12-09 08:00:03,255 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_25a4fdc4-0e07-446a-ab83-f7aee7f2869a/bin-2019/uautomizer/data/5ad4439ed/ba6d46bdc3ce45cc9a9a3131d716433b/FLAG9662fd716 [2018-12-09 08:00:03,748 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 08:00:03,748 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_25a4fdc4-0e07-446a-ab83-f7aee7f2869a/sv-benchmarks/c/pthread-wmm/safe031_pso.opt_false-unreach-call.i [2018-12-09 08:00:03,756 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_25a4fdc4-0e07-446a-ab83-f7aee7f2869a/bin-2019/uautomizer/data/5ad4439ed/ba6d46bdc3ce45cc9a9a3131d716433b/FLAG9662fd716 [2018-12-09 08:00:03,765 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_25a4fdc4-0e07-446a-ab83-f7aee7f2869a/bin-2019/uautomizer/data/5ad4439ed/ba6d46bdc3ce45cc9a9a3131d716433b [2018-12-09 08:00:03,766 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 08:00:03,767 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 08:00:03,768 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 08:00:03,768 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 08:00:03,770 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 08:00:03,770 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 08:00:03" (1/1) ... [2018-12-09 08:00:03,772 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ca176b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:00:03, skipping insertion in model container [2018-12-09 08:00:03,772 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 08:00:03" (1/1) ... [2018-12-09 08:00:03,776 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 08:00:03,798 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 08:00:03,976 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 08:00:03,984 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 08:00:04,061 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 08:00:04,092 INFO L195 MainTranslator]: Completed translation [2018-12-09 08:00:04,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:00:04 WrapperNode [2018-12-09 08:00:04,092 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 08:00:04,093 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 08:00:04,093 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 08:00:04,093 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 08:00:04,098 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:00:04" (1/1) ... [2018-12-09 08:00:04,108 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:00:04" (1/1) ... [2018-12-09 08:00:04,126 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 08:00:04,127 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 08:00:04,127 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 08:00:04,127 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 08:00:04,133 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:00:04" (1/1) ... [2018-12-09 08:00:04,133 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:00:04" (1/1) ... [2018-12-09 08:00:04,136 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:00:04" (1/1) ... [2018-12-09 08:00:04,136 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:00:04" (1/1) ... [2018-12-09 08:00:04,141 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:00:04" (1/1) ... [2018-12-09 08:00:04,143 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:00:04" (1/1) ... [2018-12-09 08:00:04,145 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:00:04" (1/1) ... [2018-12-09 08:00:04,147 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 08:00:04,147 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 08:00:04,147 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 08:00:04,147 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 08:00:04,148 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:00:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25a4fdc4-0e07-446a-ab83-f7aee7f2869a/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 08:00:04,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 08:00:04,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 08:00:04,180 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 08:00:04,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 08:00:04,180 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 08:00:04,180 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 08:00:04,180 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 08:00:04,180 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 08:00:04,181 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-09 08:00:04,181 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-09 08:00:04,181 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 08:00:04,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 08:00:04,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 08:00:04,182 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 08:00:04,537 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 08:00:04,538 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 08:00:04,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:00:04 BoogieIcfgContainer [2018-12-09 08:00:04,538 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 08:00:04,539 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 08:00:04,539 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 08:00:04,541 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 08:00:04,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 08:00:03" (1/3) ... [2018-12-09 08:00:04,542 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dafec6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 08:00:04, skipping insertion in model container [2018-12-09 08:00:04,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:00:04" (2/3) ... [2018-12-09 08:00:04,542 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dafec6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 08:00:04, skipping insertion in model container [2018-12-09 08:00:04,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:00:04" (3/3) ... [2018-12-09 08:00:04,544 INFO L112 eAbstractionObserver]: Analyzing ICFG safe031_pso.opt_false-unreach-call.i [2018-12-09 08:00:04,566 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,566 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,566 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,566 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,567 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,567 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,567 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,567 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,567 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,567 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,568 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,568 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,568 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,568 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,568 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,568 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,569 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,569 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,569 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,569 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,569 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,569 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,570 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,570 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,570 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,570 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,570 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,570 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,571 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,571 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,571 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,571 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,571 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,571 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,572 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,572 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,572 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,572 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,572 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,572 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,572 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,573 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,573 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,573 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,573 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,573 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,574 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,574 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,574 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,574 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,574 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,574 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,574 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,575 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,575 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,575 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,575 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,575 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,575 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,576 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,576 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,576 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,576 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,576 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,576 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,576 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,577 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,577 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,577 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,577 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,577 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,577 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,578 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,578 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,578 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,578 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,578 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,578 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,578 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,579 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,579 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,579 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:00:04,593 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 08:00:04,593 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 08:00:04,600 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 08:00:04,613 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 08:00:04,631 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 08:00:04,632 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 08:00:04,632 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 08:00:04,632 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 08:00:04,632 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 08:00:04,632 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 08:00:04,632 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 08:00:04,632 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 08:00:04,632 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 08:00:04,639 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 155places, 192 transitions [2018-12-09 08:00:19,201 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 128912 states. [2018-12-09 08:00:19,202 INFO L276 IsEmpty]: Start isEmpty. Operand 128912 states. [2018-12-09 08:00:19,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-09 08:00:19,210 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:00:19,210 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] [2018-12-09 08:00:19,211 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:00:19,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:00:19,215 INFO L82 PathProgramCache]: Analyzing trace with hash 961127934, now seen corresponding path program 1 times [2018-12-09 08:00:19,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:00:19,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:00:19,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:00:19,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:00:19,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:00:19,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:00:19,368 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 08:00:19,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:00:19,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 08:00:19,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 08:00:19,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 08:00:19,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 08:00:19,382 INFO L87 Difference]: Start difference. First operand 128912 states. Second operand 4 states. [2018-12-09 08:00:20,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:00:20,595 INFO L93 Difference]: Finished difference Result 233472 states and 1098324 transitions. [2018-12-09 08:00:20,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 08:00:20,596 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-12-09 08:00:20,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:00:23,002 INFO L225 Difference]: With dead ends: 233472 [2018-12-09 08:00:23,002 INFO L226 Difference]: Without dead ends: 203722 [2018-12-09 08:00:23,003 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 08:00:24,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203722 states. [2018-12-09 08:00:26,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203722 to 118892. [2018-12-09 08:00:26,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118892 states. [2018-12-09 08:00:26,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118892 states to 118892 states and 559775 transitions. [2018-12-09 08:00:26,642 INFO L78 Accepts]: Start accepts. Automaton has 118892 states and 559775 transitions. Word has length 43 [2018-12-09 08:00:26,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:00:26,643 INFO L480 AbstractCegarLoop]: Abstraction has 118892 states and 559775 transitions. [2018-12-09 08:00:26,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 08:00:26,643 INFO L276 IsEmpty]: Start isEmpty. Operand 118892 states and 559775 transitions. [2018-12-09 08:00:26,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 08:00:26,649 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:00:26,650 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:00:26,650 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:00:26,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:00:26,650 INFO L82 PathProgramCache]: Analyzing trace with hash -94457539, now seen corresponding path program 1 times [2018-12-09 08:00:26,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:00:26,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:00:26,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:00:26,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:00:26,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:00:26,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:00:26,698 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 08:00:26,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:00:26,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 08:00:26,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 08:00:26,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 08:00:26,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 08:00:26,700 INFO L87 Difference]: Start difference. First operand 118892 states and 559775 transitions. Second operand 3 states. [2018-12-09 08:00:27,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:00:27,249 INFO L93 Difference]: Finished difference Result 118892 states and 557815 transitions. [2018-12-09 08:00:27,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 08:00:27,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-09 08:00:27,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:00:27,593 INFO L225 Difference]: With dead ends: 118892 [2018-12-09 08:00:27,593 INFO L226 Difference]: Without dead ends: 118892 [2018-12-09 08:00:27,593 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 08:00:28,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118892 states. [2018-12-09 08:00:29,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118892 to 118892. [2018-12-09 08:00:29,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118892 states. [2018-12-09 08:00:30,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118892 states to 118892 states and 557815 transitions. [2018-12-09 08:00:30,611 INFO L78 Accepts]: Start accepts. Automaton has 118892 states and 557815 transitions. Word has length 50 [2018-12-09 08:00:30,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:00:30,612 INFO L480 AbstractCegarLoop]: Abstraction has 118892 states and 557815 transitions. [2018-12-09 08:00:30,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 08:00:30,612 INFO L276 IsEmpty]: Start isEmpty. Operand 118892 states and 557815 transitions. [2018-12-09 08:00:30,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 08:00:30,615 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:00:30,615 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:00:30,615 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:00:30,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:00:30,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1901912002, now seen corresponding path program 1 times [2018-12-09 08:00:30,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:00:30,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:00:30,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:00:30,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:00:30,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:00:30,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:00:30,656 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 08:00:30,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:00:30,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 08:00:30,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 08:00:30,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 08:00:30,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 08:00:30,657 INFO L87 Difference]: Start difference. First operand 118892 states and 557815 transitions. Second operand 5 states. [2018-12-09 08:00:32,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:00:32,322 INFO L93 Difference]: Finished difference Result 325272 states and 1468249 transitions. [2018-12-09 08:00:32,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 08:00:32,323 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-12-09 08:00:32,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:00:35,816 INFO L225 Difference]: With dead ends: 325272 [2018-12-09 08:00:35,817 INFO L226 Difference]: Without dead ends: 324272 [2018-12-09 08:00:35,817 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 08:00:37,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324272 states. [2018-12-09 08:00:39,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324272 to 186422. [2018-12-09 08:00:39,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186422 states. [2018-12-09 08:00:40,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186422 states to 186422 states and 840914 transitions. [2018-12-09 08:00:40,605 INFO L78 Accepts]: Start accepts. Automaton has 186422 states and 840914 transitions. Word has length 50 [2018-12-09 08:00:40,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:00:40,606 INFO L480 AbstractCegarLoop]: Abstraction has 186422 states and 840914 transitions. [2018-12-09 08:00:40,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 08:00:40,606 INFO L276 IsEmpty]: Start isEmpty. Operand 186422 states and 840914 transitions. [2018-12-09 08:00:40,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-09 08:00:40,611 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:00:40,611 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] [2018-12-09 08:00:40,611 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:00:40,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:00:40,612 INFO L82 PathProgramCache]: Analyzing trace with hash 945118259, now seen corresponding path program 1 times [2018-12-09 08:00:40,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:00:40,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:00:40,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:00:40,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:00:40,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:00:40,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:00:40,636 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 08:00:40,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:00:40,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 08:00:40,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 08:00:40,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 08:00:40,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 08:00:40,637 INFO L87 Difference]: Start difference. First operand 186422 states and 840914 transitions. Second operand 3 states. [2018-12-09 08:00:41,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:00:41,477 INFO L93 Difference]: Finished difference Result 186422 states and 840549 transitions. [2018-12-09 08:00:41,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 08:00:41,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-12-09 08:00:41,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:00:41,942 INFO L225 Difference]: With dead ends: 186422 [2018-12-09 08:00:41,942 INFO L226 Difference]: Without dead ends: 186422 [2018-12-09 08:00:41,942 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 08:00:43,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186422 states. [2018-12-09 08:00:47,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186422 to 186422. [2018-12-09 08:00:47,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186422 states. [2018-12-09 08:00:48,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186422 states to 186422 states and 840549 transitions. [2018-12-09 08:00:48,408 INFO L78 Accepts]: Start accepts. Automaton has 186422 states and 840549 transitions. Word has length 51 [2018-12-09 08:00:48,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:00:48,408 INFO L480 AbstractCegarLoop]: Abstraction has 186422 states and 840549 transitions. [2018-12-09 08:00:48,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 08:00:48,408 INFO L276 IsEmpty]: Start isEmpty. Operand 186422 states and 840549 transitions. [2018-12-09 08:00:48,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-09 08:00:48,413 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:00:48,413 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] [2018-12-09 08:00:48,413 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:00:48,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:00:48,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1607038702, now seen corresponding path program 1 times [2018-12-09 08:00:48,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:00:48,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:00:48,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:00:48,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:00:48,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:00:48,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:00:48,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:00:48,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:00:48,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 08:00:48,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 08:00:48,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 08:00:48,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 08:00:48,443 INFO L87 Difference]: Start difference. First operand 186422 states and 840549 transitions. Second operand 4 states. [2018-12-09 08:00:49,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:00:49,155 INFO L93 Difference]: Finished difference Result 163598 states and 725160 transitions. [2018-12-09 08:00:49,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 08:00:49,156 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-12-09 08:00:49,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:00:49,860 INFO L225 Difference]: With dead ends: 163598 [2018-12-09 08:00:49,861 INFO L226 Difference]: Without dead ends: 160993 [2018-12-09 08:00:49,861 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 08:00:50,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160993 states. [2018-12-09 08:00:52,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160993 to 160993. [2018-12-09 08:00:52,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160993 states. [2018-12-09 08:00:52,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160993 states to 160993 states and 716488 transitions. [2018-12-09 08:00:52,970 INFO L78 Accepts]: Start accepts. Automaton has 160993 states and 716488 transitions. Word has length 51 [2018-12-09 08:00:52,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:00:52,970 INFO L480 AbstractCegarLoop]: Abstraction has 160993 states and 716488 transitions. [2018-12-09 08:00:52,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 08:00:52,971 INFO L276 IsEmpty]: Start isEmpty. Operand 160993 states and 716488 transitions. [2018-12-09 08:00:52,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-09 08:00:52,975 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:00:52,975 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:00:52,975 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:00:52,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:00:52,975 INFO L82 PathProgramCache]: Analyzing trace with hash 24689396, now seen corresponding path program 1 times [2018-12-09 08:00:52,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:00:52,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:00:52,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:00:52,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:00:52,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:00:52,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:00:53,018 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 08:00:53,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:00:53,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 08:00:53,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 08:00:53,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 08:00:53,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 08:00:53,020 INFO L87 Difference]: Start difference. First operand 160993 states and 716488 transitions. Second operand 5 states. [2018-12-09 08:00:53,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:00:53,217 INFO L93 Difference]: Finished difference Result 51405 states and 209041 transitions. [2018-12-09 08:00:53,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 08:00:53,218 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-12-09 08:00:53,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:00:53,312 INFO L225 Difference]: With dead ends: 51405 [2018-12-09 08:00:53,312 INFO L226 Difference]: Without dead ends: 49093 [2018-12-09 08:00:53,312 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 08:00:53,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49093 states. [2018-12-09 08:00:54,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49093 to 49093. [2018-12-09 08:00:54,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49093 states. [2018-12-09 08:00:54,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49093 states to 49093 states and 200387 transitions. [2018-12-09 08:00:54,251 INFO L78 Accepts]: Start accepts. Automaton has 49093 states and 200387 transitions. Word has length 52 [2018-12-09 08:00:54,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:00:54,252 INFO L480 AbstractCegarLoop]: Abstraction has 49093 states and 200387 transitions. [2018-12-09 08:00:54,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 08:00:54,252 INFO L276 IsEmpty]: Start isEmpty. Operand 49093 states and 200387 transitions. [2018-12-09 08:00:54,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 08:00:54,259 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:00:54,259 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] [2018-12-09 08:00:54,259 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:00:54,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:00:54,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1256698635, now seen corresponding path program 1 times [2018-12-09 08:00:54,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:00:54,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:00:54,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:00:54,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:00:54,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:00:54,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:00:54,303 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 08:00:54,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:00:54,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 08:00:54,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 08:00:54,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 08:00:54,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 08:00:54,304 INFO L87 Difference]: Start difference. First operand 49093 states and 200387 transitions. Second operand 4 states. [2018-12-09 08:00:54,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:00:54,886 INFO L93 Difference]: Finished difference Result 70974 states and 285554 transitions. [2018-12-09 08:00:54,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 08:00:54,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-12-09 08:00:54,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:00:55,022 INFO L225 Difference]: With dead ends: 70974 [2018-12-09 08:00:55,022 INFO L226 Difference]: Without dead ends: 70974 [2018-12-09 08:00:55,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 08:00:55,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70974 states. [2018-12-09 08:00:55,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70974 to 63001. [2018-12-09 08:00:55,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63001 states. [2018-12-09 08:00:56,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63001 states to 63001 states and 255398 transitions. [2018-12-09 08:00:56,103 INFO L78 Accepts]: Start accepts. Automaton has 63001 states and 255398 transitions. Word has length 65 [2018-12-09 08:00:56,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:00:56,103 INFO L480 AbstractCegarLoop]: Abstraction has 63001 states and 255398 transitions. [2018-12-09 08:00:56,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 08:00:56,103 INFO L276 IsEmpty]: Start isEmpty. Operand 63001 states and 255398 transitions. [2018-12-09 08:00:56,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 08:00:56,112 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:00:56,112 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] [2018-12-09 08:00:56,113 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:00:56,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:00:56,113 INFO L82 PathProgramCache]: Analyzing trace with hash 2041196308, now seen corresponding path program 1 times [2018-12-09 08:00:56,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:00:56,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:00:56,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:00:56,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:00:56,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:00:56,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:00:56,188 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 08:00:56,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:00:56,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 08:00:56,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 08:00:56,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 08:00:56,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 08:00:56,189 INFO L87 Difference]: Start difference. First operand 63001 states and 255398 transitions. Second operand 6 states. [2018-12-09 08:00:56,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:00:56,777 INFO L93 Difference]: Finished difference Result 89481 states and 358094 transitions. [2018-12-09 08:00:56,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 08:00:56,778 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2018-12-09 08:00:56,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:00:56,955 INFO L225 Difference]: With dead ends: 89481 [2018-12-09 08:00:56,955 INFO L226 Difference]: Without dead ends: 89321 [2018-12-09 08:00:56,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-09 08:00:57,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89321 states. [2018-12-09 08:00:58,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89321 to 70729. [2018-12-09 08:00:58,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70729 states. [2018-12-09 08:00:58,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70729 states to 70729 states and 285278 transitions. [2018-12-09 08:00:58,245 INFO L78 Accepts]: Start accepts. Automaton has 70729 states and 285278 transitions. Word has length 65 [2018-12-09 08:00:58,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:00:58,245 INFO L480 AbstractCegarLoop]: Abstraction has 70729 states and 285278 transitions. [2018-12-09 08:00:58,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 08:00:58,246 INFO L276 IsEmpty]: Start isEmpty. Operand 70729 states and 285278 transitions. [2018-12-09 08:00:58,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-09 08:00:58,292 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:00:58,292 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:00:58,293 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:00:58,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:00:58,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1397213879, now seen corresponding path program 1 times [2018-12-09 08:00:58,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:00:58,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:00:58,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:00:58,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:00:58,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:00:58,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:00:58,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 08:00:58,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:00:58,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 08:00:58,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 08:00:58,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 08:00:58,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 08:00:58,345 INFO L87 Difference]: Start difference. First operand 70729 states and 285278 transitions. Second operand 6 states. [2018-12-09 08:00:58,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:00:58,408 INFO L93 Difference]: Finished difference Result 10873 states and 37510 transitions. [2018-12-09 08:00:58,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 08:00:58,408 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2018-12-09 08:00:58,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:00:58,419 INFO L225 Difference]: With dead ends: 10873 [2018-12-09 08:00:58,419 INFO L226 Difference]: Without dead ends: 9621 [2018-12-09 08:00:58,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-09 08:00:58,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9621 states. [2018-12-09 08:00:58,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9621 to 9586. [2018-12-09 08:00:58,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9586 states. [2018-12-09 08:00:58,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9586 states to 9586 states and 32946 transitions. [2018-12-09 08:00:58,512 INFO L78 Accepts]: Start accepts. Automaton has 9586 states and 32946 transitions. Word has length 79 [2018-12-09 08:00:58,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:00:58,513 INFO L480 AbstractCegarLoop]: Abstraction has 9586 states and 32946 transitions. [2018-12-09 08:00:58,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 08:00:58,513 INFO L276 IsEmpty]: Start isEmpty. Operand 9586 states and 32946 transitions. [2018-12-09 08:00:58,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-09 08:00:58,522 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:00:58,523 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:00:58,523 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:00:58,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:00:58,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1971421972, now seen corresponding path program 1 times [2018-12-09 08:00:58,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:00:58,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:00:58,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:00:58,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:00:58,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:00:58,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:00:58,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:00:58,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:00:58,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 08:00:58,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 08:00:58,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 08:00:58,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 08:00:58,559 INFO L87 Difference]: Start difference. First operand 9586 states and 32946 transitions. Second operand 3 states. [2018-12-09 08:00:58,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:00:58,665 INFO L93 Difference]: Finished difference Result 10146 states and 34654 transitions. [2018-12-09 08:00:58,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 08:00:58,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2018-12-09 08:00:58,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:00:58,677 INFO L225 Difference]: With dead ends: 10146 [2018-12-09 08:00:58,677 INFO L226 Difference]: Without dead ends: 10146 [2018-12-09 08:00:58,677 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 08:00:58,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10146 states. [2018-12-09 08:00:58,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10146 to 9866. [2018-12-09 08:00:58,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9866 states. [2018-12-09 08:00:58,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9866 states to 9866 states and 33800 transitions. [2018-12-09 08:00:58,777 INFO L78 Accepts]: Start accepts. Automaton has 9866 states and 33800 transitions. Word has length 98 [2018-12-09 08:00:58,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:00:58,777 INFO L480 AbstractCegarLoop]: Abstraction has 9866 states and 33800 transitions. [2018-12-09 08:00:58,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 08:00:58,778 INFO L276 IsEmpty]: Start isEmpty. Operand 9866 states and 33800 transitions. [2018-12-09 08:00:58,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-09 08:00:58,787 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:00:58,787 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:00:58,788 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:00:58,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:00:58,788 INFO L82 PathProgramCache]: Analyzing trace with hash -151074771, now seen corresponding path program 1 times [2018-12-09 08:00:58,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:00:58,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:00:58,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:00:58,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:00:58,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:00:58,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:00:58,877 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 08:00:58,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:00:58,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 08:00:58,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 08:00:58,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 08:00:58,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 08:00:58,878 INFO L87 Difference]: Start difference. First operand 9866 states and 33800 transitions. Second operand 5 states. [2018-12-09 08:00:59,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:00:59,028 INFO L93 Difference]: Finished difference Result 11938 states and 40240 transitions. [2018-12-09 08:00:59,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 08:00:59,028 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2018-12-09 08:00:59,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:00:59,041 INFO L225 Difference]: With dead ends: 11938 [2018-12-09 08:00:59,042 INFO L226 Difference]: Without dead ends: 11838 [2018-12-09 08:00:59,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 08:00:59,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11838 states. [2018-12-09 08:00:59,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11838 to 11570. [2018-12-09 08:00:59,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11570 states. [2018-12-09 08:00:59,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11570 states to 11570 states and 39142 transitions. [2018-12-09 08:00:59,157 INFO L78 Accepts]: Start accepts. Automaton has 11570 states and 39142 transitions. Word has length 98 [2018-12-09 08:00:59,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:00:59,157 INFO L480 AbstractCegarLoop]: Abstraction has 11570 states and 39142 transitions. [2018-12-09 08:00:59,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 08:00:59,157 INFO L276 IsEmpty]: Start isEmpty. Operand 11570 states and 39142 transitions. [2018-12-09 08:00:59,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 08:00:59,168 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:00:59,169 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:00:59,169 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:00:59,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:00:59,169 INFO L82 PathProgramCache]: Analyzing trace with hash -375385946, now seen corresponding path program 1 times [2018-12-09 08:00:59,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:00:59,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:00:59,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:00:59,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:00:59,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:00:59,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:00:59,215 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 08:00:59,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:00:59,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 08:00:59,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 08:00:59,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 08:00:59,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 08:00:59,216 INFO L87 Difference]: Start difference. First operand 11570 states and 39142 transitions. Second operand 4 states. [2018-12-09 08:00:59,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:00:59,325 INFO L93 Difference]: Finished difference Result 19669 states and 66795 transitions. [2018-12-09 08:00:59,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 08:00:59,325 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-12-09 08:00:59,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:00:59,348 INFO L225 Difference]: With dead ends: 19669 [2018-12-09 08:00:59,348 INFO L226 Difference]: Without dead ends: 19569 [2018-12-09 08:00:59,348 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 08:00:59,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19569 states. [2018-12-09 08:00:59,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19569 to 10930. [2018-12-09 08:00:59,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10930 states. [2018-12-09 08:00:59,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10930 states to 10930 states and 36695 transitions. [2018-12-09 08:00:59,494 INFO L78 Accepts]: Start accepts. Automaton has 10930 states and 36695 transitions. Word has length 100 [2018-12-09 08:00:59,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:00:59,495 INFO L480 AbstractCegarLoop]: Abstraction has 10930 states and 36695 transitions. [2018-12-09 08:00:59,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 08:00:59,495 INFO L276 IsEmpty]: Start isEmpty. Operand 10930 states and 36695 transitions. [2018-12-09 08:00:59,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 08:00:59,504 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:00:59,505 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:00:59,505 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:00:59,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:00:59,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1558733243, now seen corresponding path program 1 times [2018-12-09 08:00:59,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:00:59,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:00:59,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:00:59,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:00:59,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:00:59,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:00:59,573 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 08:00:59,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:00:59,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 08:00:59,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 08:00:59,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 08:00:59,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-09 08:00:59,574 INFO L87 Difference]: Start difference. First operand 10930 states and 36695 transitions. Second operand 6 states. [2018-12-09 08:00:59,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:00:59,729 INFO L93 Difference]: Finished difference Result 13510 states and 44684 transitions. [2018-12-09 08:00:59,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 08:00:59,729 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-09 08:00:59,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:00:59,744 INFO L225 Difference]: With dead ends: 13510 [2018-12-09 08:00:59,744 INFO L226 Difference]: Without dead ends: 13510 [2018-12-09 08:00:59,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-09 08:00:59,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13510 states. [2018-12-09 08:00:59,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13510 to 11310. [2018-12-09 08:00:59,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11310 states. [2018-12-09 08:00:59,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11310 states to 11310 states and 37929 transitions. [2018-12-09 08:00:59,858 INFO L78 Accepts]: Start accepts. Automaton has 11310 states and 37929 transitions. Word has length 100 [2018-12-09 08:00:59,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:00:59,858 INFO L480 AbstractCegarLoop]: Abstraction has 11310 states and 37929 transitions. [2018-12-09 08:00:59,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 08:00:59,859 INFO L276 IsEmpty]: Start isEmpty. Operand 11310 states and 37929 transitions. [2018-12-09 08:00:59,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 08:00:59,869 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:00:59,869 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:00:59,869 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:00:59,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:00:59,869 INFO L82 PathProgramCache]: Analyzing trace with hash -589152220, now seen corresponding path program 1 times [2018-12-09 08:00:59,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:00:59,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:00:59,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:00:59,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:00:59,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:00:59,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:00:59,928 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 08:00:59,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:00:59,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 08:00:59,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 08:00:59,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 08:00:59,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 08:00:59,929 INFO L87 Difference]: Start difference. First operand 11310 states and 37929 transitions. Second operand 6 states. [2018-12-09 08:01:00,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:01:00,060 INFO L93 Difference]: Finished difference Result 10238 states and 34135 transitions. [2018-12-09 08:01:00,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 08:01:00,061 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-09 08:01:00,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:01:00,072 INFO L225 Difference]: With dead ends: 10238 [2018-12-09 08:01:00,072 INFO L226 Difference]: Without dead ends: 10238 [2018-12-09 08:01:00,072 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 08:01:00,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10238 states. [2018-12-09 08:01:00,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10238 to 9930. [2018-12-09 08:01:00,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9930 states. [2018-12-09 08:01:00,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9930 states to 9930 states and 33200 transitions. [2018-12-09 08:01:00,220 INFO L78 Accepts]: Start accepts. Automaton has 9930 states and 33200 transitions. Word has length 100 [2018-12-09 08:01:00,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:01:00,220 INFO L480 AbstractCegarLoop]: Abstraction has 9930 states and 33200 transitions. [2018-12-09 08:01:00,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 08:01:00,220 INFO L276 IsEmpty]: Start isEmpty. Operand 9930 states and 33200 transitions. [2018-12-09 08:01:00,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 08:01:00,228 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:01:00,228 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:01:00,229 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:01:00,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:01:00,229 INFO L82 PathProgramCache]: Analyzing trace with hash 706788966, now seen corresponding path program 1 times [2018-12-09 08:01:00,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:01:00,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:01:00,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:01:00,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:01:00,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:01:00,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:01:00,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:01:00,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:01:00,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 08:01:00,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 08:01:00,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 08:01:00,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 08:01:00,281 INFO L87 Difference]: Start difference. First operand 9930 states and 33200 transitions. Second operand 7 states. [2018-12-09 08:01:00,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:01:00,506 INFO L93 Difference]: Finished difference Result 11403 states and 37679 transitions. [2018-12-09 08:01:00,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 08:01:00,506 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2018-12-09 08:01:00,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:01:00,518 INFO L225 Difference]: With dead ends: 11403 [2018-12-09 08:01:00,518 INFO L226 Difference]: Without dead ends: 11403 [2018-12-09 08:01:00,519 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 08:01:00,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11403 states. [2018-12-09 08:01:00,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11403 to 10360. [2018-12-09 08:01:00,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10360 states. [2018-12-09 08:01:00,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10360 states to 10360 states and 34314 transitions. [2018-12-09 08:01:00,623 INFO L78 Accepts]: Start accepts. Automaton has 10360 states and 34314 transitions. Word has length 100 [2018-12-09 08:01:00,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:01:00,623 INFO L480 AbstractCegarLoop]: Abstraction has 10360 states and 34314 transitions. [2018-12-09 08:01:00,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 08:01:00,623 INFO L276 IsEmpty]: Start isEmpty. Operand 10360 states and 34314 transitions. [2018-12-09 08:01:00,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 08:01:00,632 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:01:00,633 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:01:00,633 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:01:00,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:01:00,633 INFO L82 PathProgramCache]: Analyzing trace with hash -476558331, now seen corresponding path program 1 times [2018-12-09 08:01:00,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:01:00,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:01:00,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:01:00,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:01:00,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:01:00,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:01:00,701 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 08:01:00,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:01:00,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 08:01:00,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 08:01:00,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 08:01:00,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 08:01:00,702 INFO L87 Difference]: Start difference. First operand 10360 states and 34314 transitions. Second operand 5 states. [2018-12-09 08:01:00,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:01:00,792 INFO L93 Difference]: Finished difference Result 10190 states and 33558 transitions. [2018-12-09 08:01:00,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 08:01:00,793 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2018-12-09 08:01:00,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:01:00,803 INFO L225 Difference]: With dead ends: 10190 [2018-12-09 08:01:00,803 INFO L226 Difference]: Without dead ends: 10190 [2018-12-09 08:01:00,804 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 08:01:00,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10190 states. [2018-12-09 08:01:00,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10190 to 9570. [2018-12-09 08:01:00,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9570 states. [2018-12-09 08:01:00,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9570 states to 9570 states and 31817 transitions. [2018-12-09 08:01:00,892 INFO L78 Accepts]: Start accepts. Automaton has 9570 states and 31817 transitions. Word has length 100 [2018-12-09 08:01:00,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:01:00,893 INFO L480 AbstractCegarLoop]: Abstraction has 9570 states and 31817 transitions. [2018-12-09 08:01:00,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 08:01:00,893 INFO L276 IsEmpty]: Start isEmpty. Operand 9570 states and 31817 transitions. [2018-12-09 08:01:00,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 08:01:00,900 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:01:00,901 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:01:00,901 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:01:00,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:01:00,901 INFO L82 PathProgramCache]: Analyzing trace with hash -925254970, now seen corresponding path program 1 times [2018-12-09 08:01:00,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:01:00,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:01:00,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:01:00,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:01:00,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:01:00,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:01:00,982 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 08:01:00,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:01:00,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 08:01:00,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 08:01:00,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 08:01:00,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 08:01:00,983 INFO L87 Difference]: Start difference. First operand 9570 states and 31817 transitions. Second operand 6 states. [2018-12-09 08:01:01,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:01:01,086 INFO L93 Difference]: Finished difference Result 9698 states and 31721 transitions. [2018-12-09 08:01:01,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 08:01:01,087 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-09 08:01:01,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:01:01,097 INFO L225 Difference]: With dead ends: 9698 [2018-12-09 08:01:01,097 INFO L226 Difference]: Without dead ends: 9698 [2018-12-09 08:01:01,097 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 08:01:01,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9698 states. [2018-12-09 08:01:01,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9698 to 8801. [2018-12-09 08:01:01,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8801 states. [2018-12-09 08:01:01,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8801 states to 8801 states and 28915 transitions. [2018-12-09 08:01:01,180 INFO L78 Accepts]: Start accepts. Automaton has 8801 states and 28915 transitions. Word has length 100 [2018-12-09 08:01:01,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:01:01,180 INFO L480 AbstractCegarLoop]: Abstraction has 8801 states and 28915 transitions. [2018-12-09 08:01:01,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 08:01:01,180 INFO L276 IsEmpty]: Start isEmpty. Operand 8801 states and 28915 transitions. [2018-12-09 08:01:01,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 08:01:01,187 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:01:01,187 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:01:01,187 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:01:01,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:01:01,187 INFO L82 PathProgramCache]: Analyzing trace with hash -461333349, now seen corresponding path program 1 times [2018-12-09 08:01:01,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:01:01,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:01:01,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:01:01,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:01:01,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:01:01,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:01:01,238 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 08:01:01,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:01:01,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 08:01:01,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 08:01:01,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 08:01:01,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 08:01:01,239 INFO L87 Difference]: Start difference. First operand 8801 states and 28915 transitions. Second operand 7 states. [2018-12-09 08:01:01,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:01:01,556 INFO L93 Difference]: Finished difference Result 16641 states and 53816 transitions. [2018-12-09 08:01:01,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 08:01:01,557 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-09 08:01:01,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:01:01,575 INFO L225 Difference]: With dead ends: 16641 [2018-12-09 08:01:01,575 INFO L226 Difference]: Without dead ends: 16513 [2018-12-09 08:01:01,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-09 08:01:01,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16513 states. [2018-12-09 08:01:01,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16513 to 13101. [2018-12-09 08:01:01,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13101 states. [2018-12-09 08:01:01,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13101 states to 13101 states and 42903 transitions. [2018-12-09 08:01:01,728 INFO L78 Accepts]: Start accepts. Automaton has 13101 states and 42903 transitions. Word has length 102 [2018-12-09 08:01:01,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:01:01,729 INFO L480 AbstractCegarLoop]: Abstraction has 13101 states and 42903 transitions. [2018-12-09 08:01:01,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 08:01:01,729 INFO L276 IsEmpty]: Start isEmpty. Operand 13101 states and 42903 transitions. [2018-12-09 08:01:01,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 08:01:01,741 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:01:01,741 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:01:01,741 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:01:01,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:01:01,741 INFO L82 PathProgramCache]: Analyzing trace with hash 783431132, now seen corresponding path program 1 times [2018-12-09 08:01:01,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:01:01,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:01:01,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:01:01,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:01:01,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:01:01,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:01:01,813 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 08:01:01,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:01:01,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 08:01:01,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 08:01:01,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 08:01:01,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 08:01:01,814 INFO L87 Difference]: Start difference. First operand 13101 states and 42903 transitions. Second operand 6 states. [2018-12-09 08:01:01,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:01:01,943 INFO L93 Difference]: Finished difference Result 13351 states and 43313 transitions. [2018-12-09 08:01:01,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 08:01:01,944 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-12-09 08:01:01,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:01:01,958 INFO L225 Difference]: With dead ends: 13351 [2018-12-09 08:01:01,959 INFO L226 Difference]: Without dead ends: 13351 [2018-12-09 08:01:01,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-09 08:01:01,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13351 states. [2018-12-09 08:01:02,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13351 to 12951. [2018-12-09 08:01:02,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12951 states. [2018-12-09 08:01:02,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12951 states to 12951 states and 42223 transitions. [2018-12-09 08:01:02,101 INFO L78 Accepts]: Start accepts. Automaton has 12951 states and 42223 transitions. Word has length 102 [2018-12-09 08:01:02,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:01:02,101 INFO L480 AbstractCegarLoop]: Abstraction has 12951 states and 42223 transitions. [2018-12-09 08:01:02,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 08:01:02,101 INFO L276 IsEmpty]: Start isEmpty. Operand 12951 states and 42223 transitions. [2018-12-09 08:01:02,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 08:01:02,113 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:01:02,113 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:01:02,113 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:01:02,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:01:02,113 INFO L82 PathProgramCache]: Analyzing trace with hash -131567588, now seen corresponding path program 1 times [2018-12-09 08:01:02,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:01:02,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:01:02,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:01:02,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:01:02,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:01:02,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:01:02,161 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 08:01:02,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:01:02,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 08:01:02,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 08:01:02,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 08:01:02,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 08:01:02,162 INFO L87 Difference]: Start difference. First operand 12951 states and 42223 transitions. Second operand 5 states. [2018-12-09 08:01:02,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:01:02,301 INFO L93 Difference]: Finished difference Result 14359 states and 46735 transitions. [2018-12-09 08:01:02,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 08:01:02,301 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2018-12-09 08:01:02,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:01:02,317 INFO L225 Difference]: With dead ends: 14359 [2018-12-09 08:01:02,317 INFO L226 Difference]: Without dead ends: 14231 [2018-12-09 08:01:02,317 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 08:01:02,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14231 states. [2018-12-09 08:01:02,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14231 to 10665. [2018-12-09 08:01:02,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10665 states. [2018-12-09 08:01:02,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10665 states to 10665 states and 34985 transitions. [2018-12-09 08:01:02,431 INFO L78 Accepts]: Start accepts. Automaton has 10665 states and 34985 transitions. Word has length 102 [2018-12-09 08:01:02,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:01:02,431 INFO L480 AbstractCegarLoop]: Abstraction has 10665 states and 34985 transitions. [2018-12-09 08:01:02,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 08:01:02,431 INFO L276 IsEmpty]: Start isEmpty. Operand 10665 states and 34985 transitions. [2018-12-09 08:01:02,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 08:01:02,439 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:01:02,439 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:01:02,439 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:01:02,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:01:02,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1113196893, now seen corresponding path program 1 times [2018-12-09 08:01:02,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:01:02,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:01:02,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:01:02,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:01:02,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:01:02,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:01:02,491 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 08:01:02,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:01:02,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 08:01:02,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 08:01:02,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 08:01:02,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 08:01:02,492 INFO L87 Difference]: Start difference. First operand 10665 states and 34985 transitions. Second operand 6 states. [2018-12-09 08:01:02,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:01:02,643 INFO L93 Difference]: Finished difference Result 12381 states and 40061 transitions. [2018-12-09 08:01:02,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 08:01:02,644 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-12-09 08:01:02,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:01:02,657 INFO L225 Difference]: With dead ends: 12381 [2018-12-09 08:01:02,657 INFO L226 Difference]: Without dead ends: 12381 [2018-12-09 08:01:02,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-09 08:01:02,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12381 states. [2018-12-09 08:01:02,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12381 to 10860. [2018-12-09 08:01:02,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10860 states. [2018-12-09 08:01:02,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10860 states to 10860 states and 35391 transitions. [2018-12-09 08:01:02,783 INFO L78 Accepts]: Start accepts. Automaton has 10860 states and 35391 transitions. Word has length 102 [2018-12-09 08:01:02,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:01:02,783 INFO L480 AbstractCegarLoop]: Abstraction has 10860 states and 35391 transitions. [2018-12-09 08:01:02,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 08:01:02,783 INFO L276 IsEmpty]: Start isEmpty. Operand 10860 states and 35391 transitions. [2018-12-09 08:01:02,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 08:01:02,792 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:01:02,792 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:01:02,792 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:01:02,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:01:02,792 INFO L82 PathProgramCache]: Analyzing trace with hash -2048579810, now seen corresponding path program 1 times [2018-12-09 08:01:02,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:01:02,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:01:02,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:01:02,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:01:02,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:01:02,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:01:02,872 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 08:01:02,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:01:02,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 08:01:02,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 08:01:02,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 08:01:02,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 08:01:02,873 INFO L87 Difference]: Start difference. First operand 10860 states and 35391 transitions. Second operand 7 states. [2018-12-09 08:01:03,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:01:03,055 INFO L93 Difference]: Finished difference Result 20222 states and 66538 transitions. [2018-12-09 08:01:03,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 08:01:03,055 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-09 08:01:03,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:01:03,066 INFO L225 Difference]: With dead ends: 20222 [2018-12-09 08:01:03,067 INFO L226 Difference]: Without dead ends: 10230 [2018-12-09 08:01:03,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-09 08:01:03,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10230 states. [2018-12-09 08:01:03,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10230 to 10200. [2018-12-09 08:01:03,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10200 states. [2018-12-09 08:01:03,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10200 states to 10200 states and 33455 transitions. [2018-12-09 08:01:03,165 INFO L78 Accepts]: Start accepts. Automaton has 10200 states and 33455 transitions. Word has length 102 [2018-12-09 08:01:03,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:01:03,165 INFO L480 AbstractCegarLoop]: Abstraction has 10200 states and 33455 transitions. [2018-12-09 08:01:03,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 08:01:03,165 INFO L276 IsEmpty]: Start isEmpty. Operand 10200 states and 33455 transitions. [2018-12-09 08:01:03,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 08:01:03,174 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:01:03,174 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:01:03,174 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:01:03,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:01:03,174 INFO L82 PathProgramCache]: Analyzing trace with hash 84668374, now seen corresponding path program 2 times [2018-12-09 08:01:03,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:01:03,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:01:03,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:01:03,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:01:03,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:01:03,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:01:03,282 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 08:01:03,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:01:03,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 08:01:03,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 08:01:03,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 08:01:03,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-09 08:01:03,283 INFO L87 Difference]: Start difference. First operand 10200 states and 33455 transitions. Second operand 10 states. [2018-12-09 08:01:03,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:01:03,577 INFO L93 Difference]: Finished difference Result 16942 states and 56394 transitions. [2018-12-09 08:01:03,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 08:01:03,577 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 102 [2018-12-09 08:01:03,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:01:03,585 INFO L225 Difference]: With dead ends: 16942 [2018-12-09 08:01:03,585 INFO L226 Difference]: Without dead ends: 6821 [2018-12-09 08:01:03,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-12-09 08:01:03,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6821 states. [2018-12-09 08:01:03,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6821 to 6821. [2018-12-09 08:01:03,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6821 states. [2018-12-09 08:01:03,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6821 states to 6821 states and 23131 transitions. [2018-12-09 08:01:03,652 INFO L78 Accepts]: Start accepts. Automaton has 6821 states and 23131 transitions. Word has length 102 [2018-12-09 08:01:03,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:01:03,652 INFO L480 AbstractCegarLoop]: Abstraction has 6821 states and 23131 transitions. [2018-12-09 08:01:03,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 08:01:03,653 INFO L276 IsEmpty]: Start isEmpty. Operand 6821 states and 23131 transitions. [2018-12-09 08:01:03,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 08:01:03,658 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:01:03,658 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:01:03,659 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:01:03,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:01:03,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1082345370, now seen corresponding path program 1 times [2018-12-09 08:01:03,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:01:03,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:01:03,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:01:03,660 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 08:01:03,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:01:03,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:01:03,729 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 08:01:03,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:01:03,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 08:01:03,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 08:01:03,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 08:01:03,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 08:01:03,730 INFO L87 Difference]: Start difference. First operand 6821 states and 23131 transitions. Second operand 7 states. [2018-12-09 08:01:03,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:01:03,927 INFO L93 Difference]: Finished difference Result 8957 states and 29585 transitions. [2018-12-09 08:01:03,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 08:01:03,927 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-09 08:01:03,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:01:03,936 INFO L225 Difference]: With dead ends: 8957 [2018-12-09 08:01:03,936 INFO L226 Difference]: Without dead ends: 8821 [2018-12-09 08:01:03,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-09 08:01:03,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8821 states. [2018-12-09 08:01:03,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8821 to 6805. [2018-12-09 08:01:03,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6805 states. [2018-12-09 08:01:04,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6805 states to 6805 states and 23039 transitions. [2018-12-09 08:01:04,008 INFO L78 Accepts]: Start accepts. Automaton has 6805 states and 23039 transitions. Word has length 102 [2018-12-09 08:01:04,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:01:04,008 INFO L480 AbstractCegarLoop]: Abstraction has 6805 states and 23039 transitions. [2018-12-09 08:01:04,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 08:01:04,008 INFO L276 IsEmpty]: Start isEmpty. Operand 6805 states and 23039 transitions. [2018-12-09 08:01:04,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 08:01:04,014 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:01:04,014 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:01:04,014 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:01:04,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:01:04,014 INFO L82 PathProgramCache]: Analyzing trace with hash -853314917, now seen corresponding path program 2 times [2018-12-09 08:01:04,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:01:04,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:01:04,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:01:04,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:01:04,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:01:04,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:01:04,087 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 08:01:04,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:01:04,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 08:01:04,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 08:01:04,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 08:01:04,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 08:01:04,087 INFO L87 Difference]: Start difference. First operand 6805 states and 23039 transitions. Second operand 7 states. [2018-12-09 08:01:04,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:01:04,242 INFO L93 Difference]: Finished difference Result 13593 states and 46438 transitions. [2018-12-09 08:01:04,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 08:01:04,243 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-09 08:01:04,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:01:04,259 INFO L225 Difference]: With dead ends: 13593 [2018-12-09 08:01:04,259 INFO L226 Difference]: Without dead ends: 13593 [2018-12-09 08:01:04,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-12-09 08:01:04,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13593 states. [2018-12-09 08:01:04,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13593 to 6965. [2018-12-09 08:01:04,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6965 states. [2018-12-09 08:01:04,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6965 states to 6965 states and 23455 transitions. [2018-12-09 08:01:04,355 INFO L78 Accepts]: Start accepts. Automaton has 6965 states and 23455 transitions. Word has length 102 [2018-12-09 08:01:04,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:01:04,355 INFO L480 AbstractCegarLoop]: Abstraction has 6965 states and 23455 transitions. [2018-12-09 08:01:04,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 08:01:04,355 INFO L276 IsEmpty]: Start isEmpty. Operand 6965 states and 23455 transitions. [2018-12-09 08:01:04,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 08:01:04,362 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:01:04,362 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:01:04,362 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:01:04,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:01:04,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1740911900, now seen corresponding path program 3 times [2018-12-09 08:01:04,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:01:04,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:01:04,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:01:04,363 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 08:01:04,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:01:04,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:01:04,468 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 08:01:04,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:01:04,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 08:01:04,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 08:01:04,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 08:01:04,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-09 08:01:04,469 INFO L87 Difference]: Start difference. First operand 6965 states and 23455 transitions. Second operand 12 states. [2018-12-09 08:01:04,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:01:04,833 INFO L93 Difference]: Finished difference Result 13529 states and 45706 transitions. [2018-12-09 08:01:04,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 08:01:04,834 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 102 [2018-12-09 08:01:04,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:01:04,845 INFO L225 Difference]: With dead ends: 13529 [2018-12-09 08:01:04,845 INFO L226 Difference]: Without dead ends: 9625 [2018-12-09 08:01:04,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-12-09 08:01:04,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9625 states. [2018-12-09 08:01:04,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9625 to 9017. [2018-12-09 08:01:04,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9017 states. [2018-12-09 08:01:04,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9017 states to 9017 states and 29626 transitions. [2018-12-09 08:01:04,933 INFO L78 Accepts]: Start accepts. Automaton has 9017 states and 29626 transitions. Word has length 102 [2018-12-09 08:01:04,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:01:04,933 INFO L480 AbstractCegarLoop]: Abstraction has 9017 states and 29626 transitions. [2018-12-09 08:01:04,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 08:01:04,933 INFO L276 IsEmpty]: Start isEmpty. Operand 9017 states and 29626 transitions. [2018-12-09 08:01:04,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 08:01:04,940 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:01:04,940 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:01:04,941 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:01:04,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:01:04,941 INFO L82 PathProgramCache]: Analyzing trace with hash -141622302, now seen corresponding path program 4 times [2018-12-09 08:01:04,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:01:04,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:01:04,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:01:04,942 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 08:01:04,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:01:04,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:01:04,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:01:04,979 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 08:01:05,047 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 08:01:05,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 08:01:05 BasicIcfg [2018-12-09 08:01:05,048 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 08:01:05,048 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 08:01:05,048 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 08:01:05,048 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 08:01:05,049 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:00:04" (3/4) ... [2018-12-09 08:01:05,050 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 08:01:05,119 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_25a4fdc4-0e07-446a-ab83-f7aee7f2869a/bin-2019/uautomizer/witness.graphml [2018-12-09 08:01:05,119 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 08:01:05,120 INFO L168 Benchmark]: Toolchain (without parser) took 61352.83 ms. Allocated memory was 1.0 GB in the beginning and 7.2 GB in the end (delta: 6.1 GB). Free memory was 956.0 MB in the beginning and 2.6 GB in the end (delta: -1.6 GB). Peak memory consumption was 4.5 GB. Max. memory is 11.5 GB. [2018-12-09 08:01:05,120 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 08:01:05,120 INFO L168 Benchmark]: CACSL2BoogieTranslator took 324.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -169.8 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. [2018-12-09 08:01:05,121 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.01 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-09 08:01:05,121 INFO L168 Benchmark]: Boogie Preprocessor took 19.97 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 08:01:05,121 INFO L168 Benchmark]: RCFGBuilder took 391.11 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: 57.9 MB). Peak memory consumption was 57.9 MB. Max. memory is 11.5 GB. [2018-12-09 08:01:05,121 INFO L168 Benchmark]: TraceAbstraction took 60509.38 ms. Allocated memory was 1.2 GB in the beginning and 7.2 GB in the end (delta: 6.0 GB). Free memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: -1.6 GB). Peak memory consumption was 4.4 GB. Max. memory is 11.5 GB. [2018-12-09 08:01:05,121 INFO L168 Benchmark]: Witness Printer took 70.85 ms. Allocated memory is still 7.2 GB. Free memory was 2.6 GB in the beginning and 2.6 GB in the end (delta: 34.2 MB). Peak memory consumption was 34.2 MB. Max. memory is 11.5 GB. [2018-12-09 08:01:05,122 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 324.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -169.8 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.01 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.97 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 391.11 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: 57.9 MB). Peak memory consumption was 57.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 60509.38 ms. Allocated memory was 1.2 GB in the beginning and 7.2 GB in the end (delta: 6.0 GB). Free memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: -1.6 GB). Peak memory consumption was 4.4 GB. Max. memory is 11.5 GB. * Witness Printer took 70.85 ms. Allocated memory is still 7.2 GB. Free memory was 2.6 GB in the beginning and 2.6 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: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L675] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0] [L676] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L678] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L680] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L681] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L682] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L683] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L684] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L685] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L686] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L687] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L688] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L689] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L690] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L691] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L692] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L693] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L694] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L695] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L696] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L698] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L699] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L700] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L778] -1 pthread_t t2524; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L779] FCALL, FORK -1 pthread_create(&t2524, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] -1 pthread_t t2525; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] FCALL, FORK -1 pthread_create(&t2525, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L782] -1 pthread_t t2526; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L783] FCALL, FORK -1 pthread_create(&t2526, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L741] 0 y$w_buff1 = y$w_buff0 [L742] 0 y$w_buff0 = 2 [L743] 0 y$w_buff1_used = y$w_buff0_used [L744] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L746] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L747] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L748] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L749] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L750] 0 y$r_buff0_thd3 = (_Bool)1 [L753] 0 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L704] 1 z = 2 [L709] 1 __unbuffered_p0_EAX = x [L714] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L756] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L721] 2 x = 1 [L724] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L727] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L727] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=1, z=2] [L727] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=1, z=2] [L727] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L728] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L728] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L729] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L729] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L730] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L756] 0 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L730] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L731] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L731] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L734] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L757] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L757] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L758] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L758] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L759] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L759] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L760] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L760] 0 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L763] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L785] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L789] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L789] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L789] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L789] -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) [L790] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L790] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L791] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L791] -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 [L792] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L792] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L793] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L793] -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 [L796] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L797] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L798] -1 y$flush_delayed = weak$$choice2 [L799] -1 y$mem_tmp = y VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L800] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L800] -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) [L801] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L801] -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)) [L802] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L802] -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)) [L803] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L803] -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)) [L804] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L804] -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)) [L805] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L805] -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)) [L806] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L806] -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)) [L807] -1 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L808] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L808] -1 y = y$flush_delayed ? y$mem_tmp : y [L809] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 198 locations, 3 error locations. UNSAFE Result, 60.4s OverallTime, 27 OverallIterations, 1 TraceHistogramMax, 17.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6001 SDtfs, 5997 SDslu, 13679 SDs, 0 SdLazy, 4561 SolverSat, 261 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 264 GetRequests, 79 SyntacticMatches, 16 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=186422occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 26.2s AutomataMinimizationTime, 26 MinimizatonAttempts, 281716 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 2322 NumberOfCodeBlocks, 2322 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2194 ConstructedInterpolants, 0 QuantifiedInterpolants, 485071 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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...