./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix031_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_5521c805-7f57-47b1-ac82-e233df256af9/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_5521c805-7f57-47b1-ac82-e233df256af9/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_5521c805-7f57-47b1-ac82-e233df256af9/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_5521c805-7f57-47b1-ac82-e233df256af9/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix031_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_5521c805-7f57-47b1-ac82-e233df256af9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_5521c805-7f57-47b1-ac82-e233df256af9/bin/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 66bd96ca17eda037d6b50686600c4452437b4688 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.24-cad4683 [2019-11-15 22:40:50,427 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:40:50,429 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:40:50,438 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:40:50,439 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:40:50,440 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:40:50,441 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:40:50,443 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:40:50,444 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:40:50,445 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:40:50,446 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:40:50,447 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:40:50,447 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:40:50,448 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:40:50,449 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:40:50,450 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:40:50,451 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:40:50,451 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:40:50,453 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:40:50,454 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:40:50,456 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:40:50,457 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:40:50,458 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:40:50,458 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:40:50,460 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:40:50,461 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:40:50,461 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:40:50,462 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:40:50,462 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:40:50,463 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:40:50,463 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:40:50,463 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:40:50,464 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:40:50,465 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:40:50,465 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:40:50,466 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:40:50,466 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:40:50,466 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:40:50,467 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:40:50,467 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:40:50,468 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:40:50,469 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_5521c805-7f57-47b1-ac82-e233df256af9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 22:40:50,480 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:40:50,480 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:40:50,481 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:40:50,482 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:40:50,482 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:40:50,482 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:40:50,482 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:40:50,483 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:40:50,483 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:40:50,483 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:40:50,483 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 22:40:50,483 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:40:50,484 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 22:40:50,484 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:40:50,484 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:40:50,484 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:40:50,484 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 22:40:50,485 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:40:50,485 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:40:50,485 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:40:50,485 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:40:50,486 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:40:50,486 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:40:50,486 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:40:50,486 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 22:40:50,486 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:40:50,487 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 22:40:50,487 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 22:40:50,487 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/run_dir_5521c805-7f57-47b1-ac82-e233df256af9/bin/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 -> 66bd96ca17eda037d6b50686600c4452437b4688 [2019-11-15 22:40:50,511 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:40:50,520 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:40:50,522 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:40:50,524 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:40:50,524 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:40:50,525 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_5521c805-7f57-47b1-ac82-e233df256af9/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix031_rmo.opt.i [2019-11-15 22:40:50,577 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5521c805-7f57-47b1-ac82-e233df256af9/bin/uautomizer/data/d99ecb95a/1e3cecac54d243dc8ad6ec4172b37535/FLAG502643c70 [2019-11-15 22:40:51,098 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:40:51,099 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_5521c805-7f57-47b1-ac82-e233df256af9/sv-benchmarks/c/pthread-wmm/mix031_rmo.opt.i [2019-11-15 22:40:51,119 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5521c805-7f57-47b1-ac82-e233df256af9/bin/uautomizer/data/d99ecb95a/1e3cecac54d243dc8ad6ec4172b37535/FLAG502643c70 [2019-11-15 22:40:51,553 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_5521c805-7f57-47b1-ac82-e233df256af9/bin/uautomizer/data/d99ecb95a/1e3cecac54d243dc8ad6ec4172b37535 [2019-11-15 22:40:51,556 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:40:51,558 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:40:51,561 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:40:51,561 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:40:51,564 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:40:51,565 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:40:51" (1/1) ... [2019-11-15 22:40:51,567 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ac1ccf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:40:51, skipping insertion in model container [2019-11-15 22:40:51,567 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:40:51" (1/1) ... [2019-11-15 22:40:51,579 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:40:51,629 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:40:52,005 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:40:52,016 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:40:52,075 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:40:52,152 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:40:52,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:40:52 WrapperNode [2019-11-15 22:40:52,153 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:40:52,154 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:40:52,154 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:40:52,154 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:40:52,162 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:40:52" (1/1) ... [2019-11-15 22:40:52,178 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:40:52" (1/1) ... [2019-11-15 22:40:52,205 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:40:52,205 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:40:52,205 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:40:52,205 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:40:52,214 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:40:52" (1/1) ... [2019-11-15 22:40:52,214 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:40:52" (1/1) ... [2019-11-15 22:40:52,218 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:40:52" (1/1) ... [2019-11-15 22:40:52,219 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:40:52" (1/1) ... [2019-11-15 22:40:52,229 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:40:52" (1/1) ... [2019-11-15 22:40:52,234 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:40:52" (1/1) ... [2019-11-15 22:40:52,237 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:40:52" (1/1) ... [2019-11-15 22:40:52,242 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:40:52,242 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:40:52,242 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:40:52,242 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:40:52,243 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:40:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5521c805-7f57-47b1-ac82-e233df256af9/bin/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 [2019-11-15 22:40:52,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 22:40:52,316 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-15 22:40:52,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:40:52,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:40:52,318 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-15 22:40:52,318 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-15 22:40:52,318 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-15 22:40:52,319 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-15 22:40:52,319 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-15 22:40:52,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:40:52,321 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:40:52,323 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-15 22:40:52,936 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:40:52,936 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 22:40:52,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:40:52 BoogieIcfgContainer [2019-11-15 22:40:52,938 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:40:52,939 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:40:52,939 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:40:52,941 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:40:52,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:40:51" (1/3) ... [2019-11-15 22:40:52,942 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e136667 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:40:52, skipping insertion in model container [2019-11-15 22:40:52,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:40:52" (2/3) ... [2019-11-15 22:40:52,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e136667 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:40:52, skipping insertion in model container [2019-11-15 22:40:52,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:40:52" (3/3) ... [2019-11-15 22:40:52,945 INFO L109 eAbstractionObserver]: Analyzing ICFG mix031_rmo.opt.i [2019-11-15 22:40:52,981 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,982 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,982 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,982 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,982 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,982 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,982 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,982 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,983 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,983 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,983 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,983 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,984 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,984 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,984 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,984 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,984 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,985 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,985 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,985 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,985 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,985 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,986 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,986 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,986 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,986 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,986 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,986 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,987 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,987 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,987 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,987 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,987 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,987 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,988 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,988 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,988 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,988 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,988 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,989 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,989 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,989 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,989 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,989 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,989 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,990 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,990 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,990 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,990 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,990 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,990 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,991 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,991 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,991 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,991 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,991 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,991 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,992 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,992 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,992 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,992 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,992 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,993 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,993 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,993 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,993 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,993 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,993 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,994 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,994 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,994 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,994 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,994 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,995 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,995 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,995 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,995 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,995 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,995 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,995 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,996 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,996 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,996 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,996 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,996 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,997 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,997 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,997 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,997 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,997 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,997 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,997 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,998 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,998 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,998 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,998 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,999 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,999 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,999 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,999 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,999 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:52,999 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:53,000 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:53,000 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:53,000 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:53,000 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:53,000 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:53,000 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:53,001 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:53,001 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:53,001 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:53,001 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:53,001 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:53,001 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:53,002 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:53,002 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:53,002 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:53,002 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:53,002 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:53,003 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:53,003 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:53,003 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:53,003 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:53,003 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:53,003 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:53,004 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:53,004 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:53,004 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:40:53,009 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-15 22:40:53,009 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:40:53,016 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-15 22:40:53,025 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-15 22:40:53,043 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:40:53,043 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 22:40:53,043 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:40:53,043 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:40:53,043 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:40:53,043 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:40:53,043 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:40:53,043 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:40:53,055 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 132 places, 164 transitions [2019-11-15 22:40:54,693 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25978 states. [2019-11-15 22:40:54,696 INFO L276 IsEmpty]: Start isEmpty. Operand 25978 states. [2019-11-15 22:40:54,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-15 22:40:54,705 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:40:54,706 INFO L380 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] [2019-11-15 22:40:54,708 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:40:54,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:40:54,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1332151771, now seen corresponding path program 1 times [2019-11-15 22:40:54,721 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:40:54,721 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061776135] [2019-11-15 22:40:54,721 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:54,721 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:54,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:40:54,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:54,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:40:54,986 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061776135] [2019-11-15 22:40:54,987 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:40:54,987 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:40:54,988 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32926755] [2019-11-15 22:40:54,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:40:54,992 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:40:55,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:40:55,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:40:55,007 INFO L87 Difference]: Start difference. First operand 25978 states. Second operand 4 states. [2019-11-15 22:40:55,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:40:55,571 INFO L93 Difference]: Finished difference Result 26618 states and 102123 transitions. [2019-11-15 22:40:55,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:40:55,573 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-11-15 22:40:55,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:40:55,759 INFO L225 Difference]: With dead ends: 26618 [2019-11-15 22:40:55,759 INFO L226 Difference]: Without dead ends: 20362 [2019-11-15 22:40:55,761 INFO L600 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 [2019-11-15 22:40:56,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20362 states. [2019-11-15 22:40:56,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20362 to 20362. [2019-11-15 22:40:56,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20362 states. [2019-11-15 22:40:57,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20362 states to 20362 states and 78427 transitions. [2019-11-15 22:40:57,023 INFO L78 Accepts]: Start accepts. Automaton has 20362 states and 78427 transitions. Word has length 41 [2019-11-15 22:40:57,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:40:57,024 INFO L462 AbstractCegarLoop]: Abstraction has 20362 states and 78427 transitions. [2019-11-15 22:40:57,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:40:57,024 INFO L276 IsEmpty]: Start isEmpty. Operand 20362 states and 78427 transitions. [2019-11-15 22:40:57,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 22:40:57,036 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:40:57,036 INFO L380 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] [2019-11-15 22:40:57,036 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:40:57,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:40:57,037 INFO L82 PathProgramCache]: Analyzing trace with hash 2021761746, now seen corresponding path program 1 times [2019-11-15 22:40:57,037 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:40:57,037 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126177658] [2019-11-15 22:40:57,038 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:57,038 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:57,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:40:57,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:57,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:40:57,147 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126177658] [2019-11-15 22:40:57,147 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:40:57,147 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:40:57,147 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893556140] [2019-11-15 22:40:57,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:40:57,149 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:40:57,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:40:57,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:40:57,149 INFO L87 Difference]: Start difference. First operand 20362 states and 78427 transitions. Second operand 5 states. [2019-11-15 22:40:58,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:40:58,230 INFO L93 Difference]: Finished difference Result 31840 states and 116044 transitions. [2019-11-15 22:40:58,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:40:58,231 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-11-15 22:40:58,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:40:58,371 INFO L225 Difference]: With dead ends: 31840 [2019-11-15 22:40:58,371 INFO L226 Difference]: Without dead ends: 31288 [2019-11-15 22:40:58,372 INFO L600 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 [2019-11-15 22:40:58,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31288 states. [2019-11-15 22:40:59,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31288 to 29707. [2019-11-15 22:40:59,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29707 states. [2019-11-15 22:40:59,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29707 states to 29707 states and 109521 transitions. [2019-11-15 22:40:59,524 INFO L78 Accepts]: Start accepts. Automaton has 29707 states and 109521 transitions. Word has length 49 [2019-11-15 22:40:59,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:40:59,525 INFO L462 AbstractCegarLoop]: Abstraction has 29707 states and 109521 transitions. [2019-11-15 22:40:59,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:40:59,526 INFO L276 IsEmpty]: Start isEmpty. Operand 29707 states and 109521 transitions. [2019-11-15 22:40:59,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-15 22:40:59,530 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:40:59,531 INFO L380 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] [2019-11-15 22:40:59,531 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:40:59,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:40:59,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1608863874, now seen corresponding path program 1 times [2019-11-15 22:40:59,532 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:40:59,532 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825683942] [2019-11-15 22:40:59,532 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:59,532 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:59,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:40:59,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:59,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:40:59,610 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825683942] [2019-11-15 22:40:59,611 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:40:59,611 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:40:59,611 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55845769] [2019-11-15 22:40:59,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:40:59,611 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:40:59,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:40:59,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:40:59,612 INFO L87 Difference]: Start difference. First operand 29707 states and 109521 transitions. Second operand 5 states. [2019-11-15 22:41:00,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:41:00,498 INFO L93 Difference]: Finished difference Result 38698 states and 139693 transitions. [2019-11-15 22:41:00,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:41:00,499 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-11-15 22:41:00,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:41:00,646 INFO L225 Difference]: With dead ends: 38698 [2019-11-15 22:41:00,646 INFO L226 Difference]: Without dead ends: 38250 [2019-11-15 22:41:00,647 INFO L600 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 [2019-11-15 22:41:00,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38250 states. [2019-11-15 22:41:01,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38250 to 32953. [2019-11-15 22:41:01,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32953 states. [2019-11-15 22:41:01,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32953 states to 32953 states and 120530 transitions. [2019-11-15 22:41:01,595 INFO L78 Accepts]: Start accepts. Automaton has 32953 states and 120530 transitions. Word has length 50 [2019-11-15 22:41:01,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:41:01,598 INFO L462 AbstractCegarLoop]: Abstraction has 32953 states and 120530 transitions. [2019-11-15 22:41:01,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:41:01,598 INFO L276 IsEmpty]: Start isEmpty. Operand 32953 states and 120530 transitions. [2019-11-15 22:41:01,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 22:41:01,607 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:41:01,607 INFO L380 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] [2019-11-15 22:41:01,608 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:41:01,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:01,608 INFO L82 PathProgramCache]: Analyzing trace with hash -321514024, now seen corresponding path program 1 times [2019-11-15 22:41:01,609 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:01,609 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272042459] [2019-11-15 22:41:01,609 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:01,609 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:01,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:01,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:01,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:01,669 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272042459] [2019-11-15 22:41:01,669 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:41:01,669 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:41:01,669 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898184886] [2019-11-15 22:41:01,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:41:01,670 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:41:01,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:41:01,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:41:01,670 INFO L87 Difference]: Start difference. First operand 32953 states and 120530 transitions. Second operand 3 states. [2019-11-15 22:41:01,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:41:01,877 INFO L93 Difference]: Finished difference Result 42414 states and 152021 transitions. [2019-11-15 22:41:01,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:41:01,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-15 22:41:01,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:41:01,997 INFO L225 Difference]: With dead ends: 42414 [2019-11-15 22:41:01,997 INFO L226 Difference]: Without dead ends: 42414 [2019-11-15 22:41:01,997 INFO L600 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 [2019-11-15 22:41:02,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42414 states. [2019-11-15 22:41:03,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42414 to 37667. [2019-11-15 22:41:03,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37667 states. [2019-11-15 22:41:03,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37667 states to 37667 states and 136334 transitions. [2019-11-15 22:41:03,274 INFO L78 Accepts]: Start accepts. Automaton has 37667 states and 136334 transitions. Word has length 52 [2019-11-15 22:41:03,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:41:03,274 INFO L462 AbstractCegarLoop]: Abstraction has 37667 states and 136334 transitions. [2019-11-15 22:41:03,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:41:03,275 INFO L276 IsEmpty]: Start isEmpty. Operand 37667 states and 136334 transitions. [2019-11-15 22:41:03,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-15 22:41:03,290 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:41:03,290 INFO L380 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] [2019-11-15 22:41:03,291 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:41:03,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:03,291 INFO L82 PathProgramCache]: Analyzing trace with hash 720601645, now seen corresponding path program 1 times [2019-11-15 22:41:03,291 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:03,292 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947511524] [2019-11-15 22:41:03,292 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:03,292 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:03,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:03,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:03,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:03,391 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947511524] [2019-11-15 22:41:03,391 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:41:03,391 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:41:03,391 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929793843] [2019-11-15 22:41:03,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:41:03,392 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:41:03,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:41:03,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:41:03,392 INFO L87 Difference]: Start difference. First operand 37667 states and 136334 transitions. Second operand 6 states. [2019-11-15 22:41:03,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:41:03,997 INFO L93 Difference]: Finished difference Result 48758 states and 172983 transitions. [2019-11-15 22:41:03,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 22:41:03,997 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-11-15 22:41:03,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:41:04,101 INFO L225 Difference]: With dead ends: 48758 [2019-11-15 22:41:04,101 INFO L226 Difference]: Without dead ends: 48238 [2019-11-15 22:41:04,102 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-11-15 22:41:04,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48238 states. [2019-11-15 22:41:05,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48238 to 38231. [2019-11-15 22:41:05,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38231 states. [2019-11-15 22:41:05,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38231 states to 38231 states and 138497 transitions. [2019-11-15 22:41:05,431 INFO L78 Accepts]: Start accepts. Automaton has 38231 states and 138497 transitions. Word has length 56 [2019-11-15 22:41:05,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:41:05,432 INFO L462 AbstractCegarLoop]: Abstraction has 38231 states and 138497 transitions. [2019-11-15 22:41:05,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:41:05,432 INFO L276 IsEmpty]: Start isEmpty. Operand 38231 states and 138497 transitions. [2019-11-15 22:41:05,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-15 22:41:05,445 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:41:05,446 INFO L380 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] [2019-11-15 22:41:05,446 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:41:05,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:05,447 INFO L82 PathProgramCache]: Analyzing trace with hash 347104516, now seen corresponding path program 1 times [2019-11-15 22:41:05,447 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:05,447 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591845991] [2019-11-15 22:41:05,447 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:05,447 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:05,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:05,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:05,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:05,567 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591845991] [2019-11-15 22:41:05,567 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:41:05,568 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:41:05,568 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309350635] [2019-11-15 22:41:05,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:41:05,569 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:41:05,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:41:05,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:41:05,569 INFO L87 Difference]: Start difference. First operand 38231 states and 138497 transitions. Second operand 6 states. [2019-11-15 22:41:06,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:41:06,321 INFO L93 Difference]: Finished difference Result 53007 states and 189573 transitions. [2019-11-15 22:41:06,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:41:06,322 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-11-15 22:41:06,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:41:06,447 INFO L225 Difference]: With dead ends: 53007 [2019-11-15 22:41:06,447 INFO L226 Difference]: Without dead ends: 52031 [2019-11-15 22:41:06,448 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:41:06,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52031 states. [2019-11-15 22:41:07,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52031 to 48784. [2019-11-15 22:41:07,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48784 states. [2019-11-15 22:41:08,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48784 states to 48784 states and 175228 transitions. [2019-11-15 22:41:08,133 INFO L78 Accepts]: Start accepts. Automaton has 48784 states and 175228 transitions. Word has length 56 [2019-11-15 22:41:08,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:41:08,134 INFO L462 AbstractCegarLoop]: Abstraction has 48784 states and 175228 transitions. [2019-11-15 22:41:08,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:41:08,134 INFO L276 IsEmpty]: Start isEmpty. Operand 48784 states and 175228 transitions. [2019-11-15 22:41:08,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-15 22:41:08,148 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:41:08,148 INFO L380 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] [2019-11-15 22:41:08,148 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:41:08,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:08,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1449846843, now seen corresponding path program 1 times [2019-11-15 22:41:08,149 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:08,149 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373854219] [2019-11-15 22:41:08,149 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:08,149 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:08,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:08,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:08,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:08,277 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373854219] [2019-11-15 22:41:08,277 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:41:08,277 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:41:08,278 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638336194] [2019-11-15 22:41:08,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:41:08,279 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:41:08,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:41:08,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:41:08,280 INFO L87 Difference]: Start difference. First operand 48784 states and 175228 transitions. Second operand 7 states. [2019-11-15 22:41:09,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:41:09,193 INFO L93 Difference]: Finished difference Result 70899 states and 244525 transitions. [2019-11-15 22:41:09,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 22:41:09,194 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-11-15 22:41:09,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:41:09,316 INFO L225 Difference]: With dead ends: 70899 [2019-11-15 22:41:09,316 INFO L226 Difference]: Without dead ends: 70899 [2019-11-15 22:41:09,317 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:41:09,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70899 states. [2019-11-15 22:41:10,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70899 to 57892. [2019-11-15 22:41:10,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57892 states. [2019-11-15 22:41:10,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57892 states to 57892 states and 203152 transitions. [2019-11-15 22:41:10,313 INFO L78 Accepts]: Start accepts. Automaton has 57892 states and 203152 transitions. Word has length 56 [2019-11-15 22:41:10,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:41:10,313 INFO L462 AbstractCegarLoop]: Abstraction has 57892 states and 203152 transitions. [2019-11-15 22:41:10,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:41:10,313 INFO L276 IsEmpty]: Start isEmpty. Operand 57892 states and 203152 transitions. [2019-11-15 22:41:10,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-15 22:41:10,324 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:41:10,325 INFO L380 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] [2019-11-15 22:41:10,325 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:41:10,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:10,325 INFO L82 PathProgramCache]: Analyzing trace with hash -562343162, now seen corresponding path program 1 times [2019-11-15 22:41:10,325 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:10,325 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415110895] [2019-11-15 22:41:10,325 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:10,325 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:10,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:10,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:10,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:10,386 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415110895] [2019-11-15 22:41:10,386 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:41:10,386 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:41:10,386 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861672451] [2019-11-15 22:41:10,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:41:10,387 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:41:10,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:41:10,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:41:10,387 INFO L87 Difference]: Start difference. First operand 57892 states and 203152 transitions. Second operand 4 states. [2019-11-15 22:41:10,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:41:10,447 INFO L93 Difference]: Finished difference Result 10862 states and 33397 transitions. [2019-11-15 22:41:10,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:41:10,448 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-11-15 22:41:10,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:41:10,463 INFO L225 Difference]: With dead ends: 10862 [2019-11-15 22:41:10,463 INFO L226 Difference]: Without dead ends: 9363 [2019-11-15 22:41:10,463 INFO L600 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 [2019-11-15 22:41:10,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9363 states. [2019-11-15 22:41:10,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9363 to 9315. [2019-11-15 22:41:10,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9315 states. [2019-11-15 22:41:10,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9315 states to 9315 states and 28347 transitions. [2019-11-15 22:41:10,605 INFO L78 Accepts]: Start accepts. Automaton has 9315 states and 28347 transitions. Word has length 56 [2019-11-15 22:41:10,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:41:10,606 INFO L462 AbstractCegarLoop]: Abstraction has 9315 states and 28347 transitions. [2019-11-15 22:41:10,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:41:10,606 INFO L276 IsEmpty]: Start isEmpty. Operand 9315 states and 28347 transitions. [2019-11-15 22:41:10,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 22:41:10,612 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:41:10,612 INFO L380 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] [2019-11-15 22:41:10,612 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:41:10,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:10,613 INFO L82 PathProgramCache]: Analyzing trace with hash 545936329, now seen corresponding path program 1 times [2019-11-15 22:41:10,613 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:10,613 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571785463] [2019-11-15 22:41:10,613 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:10,613 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:10,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:10,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:10,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:10,723 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571785463] [2019-11-15 22:41:10,723 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:41:10,724 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:41:10,724 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929017304] [2019-11-15 22:41:10,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:41:10,724 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:41:10,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:41:10,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:41:10,725 INFO L87 Difference]: Start difference. First operand 9315 states and 28347 transitions. Second operand 6 states. [2019-11-15 22:41:11,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:41:11,681 INFO L93 Difference]: Finished difference Result 12169 states and 36413 transitions. [2019-11-15 22:41:11,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 22:41:11,682 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-11-15 22:41:11,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:41:11,695 INFO L225 Difference]: With dead ends: 12169 [2019-11-15 22:41:11,695 INFO L226 Difference]: Without dead ends: 12121 [2019-11-15 22:41:11,695 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-11-15 22:41:11,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12121 states. [2019-11-15 22:41:11,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12121 to 10054. [2019-11-15 22:41:11,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10054 states. [2019-11-15 22:41:11,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10054 states to 10054 states and 30403 transitions. [2019-11-15 22:41:11,815 INFO L78 Accepts]: Start accepts. Automaton has 10054 states and 30403 transitions. Word has length 66 [2019-11-15 22:41:11,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:41:11,815 INFO L462 AbstractCegarLoop]: Abstraction has 10054 states and 30403 transitions. [2019-11-15 22:41:11,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:41:11,815 INFO L276 IsEmpty]: Start isEmpty. Operand 10054 states and 30403 transitions. [2019-11-15 22:41:11,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 22:41:11,821 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:41:11,821 INFO L380 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] [2019-11-15 22:41:11,821 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:41:11,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:11,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1184079748, now seen corresponding path program 1 times [2019-11-15 22:41:11,822 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:11,822 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059242277] [2019-11-15 22:41:11,822 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:11,822 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:11,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:11,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:11,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:11,885 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059242277] [2019-11-15 22:41:11,885 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:41:11,885 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:41:11,885 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970600275] [2019-11-15 22:41:11,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:41:11,886 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:41:11,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:41:11,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:41:11,886 INFO L87 Difference]: Start difference. First operand 10054 states and 30403 transitions. Second operand 4 states. [2019-11-15 22:41:12,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:41:12,114 INFO L93 Difference]: Finished difference Result 12503 states and 37312 transitions. [2019-11-15 22:41:12,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:41:12,130 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-11-15 22:41:12,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:41:12,146 INFO L225 Difference]: With dead ends: 12503 [2019-11-15 22:41:12,147 INFO L226 Difference]: Without dead ends: 12503 [2019-11-15 22:41:12,147 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:41:12,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12503 states. [2019-11-15 22:41:12,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12503 to 11357. [2019-11-15 22:41:12,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11357 states. [2019-11-15 22:41:12,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11357 states to 11357 states and 34001 transitions. [2019-11-15 22:41:12,272 INFO L78 Accepts]: Start accepts. Automaton has 11357 states and 34001 transitions. Word has length 68 [2019-11-15 22:41:12,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:41:12,272 INFO L462 AbstractCegarLoop]: Abstraction has 11357 states and 34001 transitions. [2019-11-15 22:41:12,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:41:12,272 INFO L276 IsEmpty]: Start isEmpty. Operand 11357 states and 34001 transitions. [2019-11-15 22:41:12,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 22:41:12,278 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:41:12,279 INFO L380 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] [2019-11-15 22:41:12,279 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:41:12,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:12,279 INFO L82 PathProgramCache]: Analyzing trace with hash -893129595, now seen corresponding path program 1 times [2019-11-15 22:41:12,280 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:12,280 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076984179] [2019-11-15 22:41:12,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:12,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:12,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:12,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:12,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:12,314 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076984179] [2019-11-15 22:41:12,314 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:41:12,314 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:41:12,314 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716105689] [2019-11-15 22:41:12,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:41:12,315 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:41:12,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:41:12,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:41:12,315 INFO L87 Difference]: Start difference. First operand 11357 states and 34001 transitions. Second operand 3 states. [2019-11-15 22:41:12,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:41:12,494 INFO L93 Difference]: Finished difference Result 11826 states and 35256 transitions. [2019-11-15 22:41:12,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:41:12,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-11-15 22:41:12,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:41:12,507 INFO L225 Difference]: With dead ends: 11826 [2019-11-15 22:41:12,507 INFO L226 Difference]: Without dead ends: 11826 [2019-11-15 22:41:12,507 INFO L600 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 [2019-11-15 22:41:12,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11826 states. [2019-11-15 22:41:12,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11826 to 11607. [2019-11-15 22:41:12,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11607 states. [2019-11-15 22:41:12,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11607 states to 11607 states and 34665 transitions. [2019-11-15 22:41:12,629 INFO L78 Accepts]: Start accepts. Automaton has 11607 states and 34665 transitions. Word has length 68 [2019-11-15 22:41:12,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:41:12,629 INFO L462 AbstractCegarLoop]: Abstraction has 11607 states and 34665 transitions. [2019-11-15 22:41:12,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:41:12,630 INFO L276 IsEmpty]: Start isEmpty. Operand 11607 states and 34665 transitions. [2019-11-15 22:41:12,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-15 22:41:12,638 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:41:12,638 INFO L380 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] [2019-11-15 22:41:12,638 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:41:12,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:12,639 INFO L82 PathProgramCache]: Analyzing trace with hash -786414864, now seen corresponding path program 1 times [2019-11-15 22:41:12,639 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:12,639 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868125492] [2019-11-15 22:41:12,639 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:12,639 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:12,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:12,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:12,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:12,729 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868125492] [2019-11-15 22:41:12,729 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:41:12,729 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:41:12,730 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809046509] [2019-11-15 22:41:12,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:41:12,730 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:41:12,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:41:12,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:41:12,731 INFO L87 Difference]: Start difference. First operand 11607 states and 34665 transitions. Second operand 6 states. [2019-11-15 22:41:13,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:41:13,231 INFO L93 Difference]: Finished difference Result 12859 states and 37854 transitions. [2019-11-15 22:41:13,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:41:13,232 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-11-15 22:41:13,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:41:13,252 INFO L225 Difference]: With dead ends: 12859 [2019-11-15 22:41:13,252 INFO L226 Difference]: Without dead ends: 12859 [2019-11-15 22:41:13,252 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:41:13,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12859 states. [2019-11-15 22:41:13,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12859 to 12392. [2019-11-15 22:41:13,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12392 states. [2019-11-15 22:41:13,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12392 states to 12392 states and 36620 transitions. [2019-11-15 22:41:13,421 INFO L78 Accepts]: Start accepts. Automaton has 12392 states and 36620 transitions. Word has length 70 [2019-11-15 22:41:13,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:41:13,422 INFO L462 AbstractCegarLoop]: Abstraction has 12392 states and 36620 transitions. [2019-11-15 22:41:13,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:41:13,422 INFO L276 IsEmpty]: Start isEmpty. Operand 12392 states and 36620 transitions. [2019-11-15 22:41:13,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-15 22:41:13,434 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:41:13,434 INFO L380 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] [2019-11-15 22:41:13,435 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:41:13,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:13,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1431343089, now seen corresponding path program 1 times [2019-11-15 22:41:13,435 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:13,435 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867670453] [2019-11-15 22:41:13,436 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:13,436 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:13,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:13,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:13,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:13,579 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867670453] [2019-11-15 22:41:13,579 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:41:13,579 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:41:13,579 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052734716] [2019-11-15 22:41:13,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:41:13,580 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:41:13,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:41:13,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:41:13,581 INFO L87 Difference]: Start difference. First operand 12392 states and 36620 transitions. Second operand 6 states. [2019-11-15 22:41:13,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:41:13,912 INFO L93 Difference]: Finished difference Result 14551 states and 41773 transitions. [2019-11-15 22:41:13,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:41:13,913 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-11-15 22:41:13,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:41:13,928 INFO L225 Difference]: With dead ends: 14551 [2019-11-15 22:41:13,929 INFO L226 Difference]: Without dead ends: 14551 [2019-11-15 22:41:13,929 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:41:13,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14551 states. [2019-11-15 22:41:14,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14551 to 13003. [2019-11-15 22:41:14,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13003 states. [2019-11-15 22:41:14,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13003 states to 13003 states and 37704 transitions. [2019-11-15 22:41:14,073 INFO L78 Accepts]: Start accepts. Automaton has 13003 states and 37704 transitions. Word has length 70 [2019-11-15 22:41:14,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:41:14,073 INFO L462 AbstractCegarLoop]: Abstraction has 13003 states and 37704 transitions. [2019-11-15 22:41:14,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:41:14,073 INFO L276 IsEmpty]: Start isEmpty. Operand 13003 states and 37704 transitions. [2019-11-15 22:41:14,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-15 22:41:14,082 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:41:14,082 INFO L380 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] [2019-11-15 22:41:14,083 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:41:14,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:14,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1642694002, now seen corresponding path program 1 times [2019-11-15 22:41:14,083 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:14,083 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283931080] [2019-11-15 22:41:14,083 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:14,083 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:14,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:14,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:14,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:14,142 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283931080] [2019-11-15 22:41:14,142 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:41:14,142 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:41:14,142 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842197739] [2019-11-15 22:41:14,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:41:14,143 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:41:14,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:41:14,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:41:14,143 INFO L87 Difference]: Start difference. First operand 13003 states and 37704 transitions. Second operand 5 states. [2019-11-15 22:41:14,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:41:14,511 INFO L93 Difference]: Finished difference Result 17566 states and 50786 transitions. [2019-11-15 22:41:14,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:41:14,511 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-11-15 22:41:14,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:41:14,531 INFO L225 Difference]: With dead ends: 17566 [2019-11-15 22:41:14,531 INFO L226 Difference]: Without dead ends: 17566 [2019-11-15 22:41:14,531 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:41:14,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17566 states. [2019-11-15 22:41:14,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17566 to 13782. [2019-11-15 22:41:14,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13782 states. [2019-11-15 22:41:14,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13782 states to 13782 states and 39962 transitions. [2019-11-15 22:41:14,713 INFO L78 Accepts]: Start accepts. Automaton has 13782 states and 39962 transitions. Word has length 70 [2019-11-15 22:41:14,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:41:14,713 INFO L462 AbstractCegarLoop]: Abstraction has 13782 states and 39962 transitions. [2019-11-15 22:41:14,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:41:14,714 INFO L276 IsEmpty]: Start isEmpty. Operand 13782 states and 39962 transitions. [2019-11-15 22:41:14,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-15 22:41:14,723 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:41:14,723 INFO L380 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] [2019-11-15 22:41:14,723 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:41:14,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:14,724 INFO L82 PathProgramCache]: Analyzing trace with hash -164760461, now seen corresponding path program 1 times [2019-11-15 22:41:14,724 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:14,724 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111110083] [2019-11-15 22:41:14,724 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:14,724 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:14,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:14,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:14,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:14,775 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111110083] [2019-11-15 22:41:14,776 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:41:14,776 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:41:14,776 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369030887] [2019-11-15 22:41:14,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:41:14,776 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:41:14,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:41:14,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:41:14,776 INFO L87 Difference]: Start difference. First operand 13782 states and 39962 transitions. Second operand 4 states. [2019-11-15 22:41:15,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:41:15,116 INFO L93 Difference]: Finished difference Result 19773 states and 57600 transitions. [2019-11-15 22:41:15,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:41:15,117 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2019-11-15 22:41:15,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:41:15,138 INFO L225 Difference]: With dead ends: 19773 [2019-11-15 22:41:15,138 INFO L226 Difference]: Without dead ends: 19497 [2019-11-15 22:41:15,139 INFO L600 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 [2019-11-15 22:41:15,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19497 states. [2019-11-15 22:41:15,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19497 to 17877. [2019-11-15 22:41:15,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17877 states. [2019-11-15 22:41:15,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17877 states to 17877 states and 52151 transitions. [2019-11-15 22:41:15,342 INFO L78 Accepts]: Start accepts. Automaton has 17877 states and 52151 transitions. Word has length 70 [2019-11-15 22:41:15,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:41:15,343 INFO L462 AbstractCegarLoop]: Abstraction has 17877 states and 52151 transitions. [2019-11-15 22:41:15,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:41:15,343 INFO L276 IsEmpty]: Start isEmpty. Operand 17877 states and 52151 transitions. [2019-11-15 22:41:15,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-15 22:41:15,351 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:41:15,351 INFO L380 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] [2019-11-15 22:41:15,351 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:41:15,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:15,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1961711820, now seen corresponding path program 1 times [2019-11-15 22:41:15,352 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:15,352 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169859683] [2019-11-15 22:41:15,352 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:15,352 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:15,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:15,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:15,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:15,472 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169859683] [2019-11-15 22:41:15,472 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:41:15,472 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:41:15,472 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351425323] [2019-11-15 22:41:15,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:41:15,472 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:41:15,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:41:15,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:41:15,473 INFO L87 Difference]: Start difference. First operand 17877 states and 52151 transitions. Second operand 7 states. [2019-11-15 22:41:15,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:41:15,792 INFO L93 Difference]: Finished difference Result 15643 states and 43105 transitions. [2019-11-15 22:41:15,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 22:41:15,793 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2019-11-15 22:41:15,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:41:15,808 INFO L225 Difference]: With dead ends: 15643 [2019-11-15 22:41:15,808 INFO L226 Difference]: Without dead ends: 15643 [2019-11-15 22:41:15,808 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:41:15,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15643 states. [2019-11-15 22:41:15,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15643 to 12478. [2019-11-15 22:41:15,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12478 states. [2019-11-15 22:41:15,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12478 states to 12478 states and 34355 transitions. [2019-11-15 22:41:15,953 INFO L78 Accepts]: Start accepts. Automaton has 12478 states and 34355 transitions. Word has length 70 [2019-11-15 22:41:15,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:41:15,953 INFO L462 AbstractCegarLoop]: Abstraction has 12478 states and 34355 transitions. [2019-11-15 22:41:15,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:41:15,953 INFO L276 IsEmpty]: Start isEmpty. Operand 12478 states and 34355 transitions. [2019-11-15 22:41:15,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-15 22:41:15,958 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:41:15,959 INFO L380 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] [2019-11-15 22:41:15,959 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:41:15,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:15,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1074208139, now seen corresponding path program 1 times [2019-11-15 22:41:15,959 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:15,959 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119857201] [2019-11-15 22:41:15,960 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:15,960 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:15,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:15,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:16,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:16,039 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119857201] [2019-11-15 22:41:16,039 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:41:16,039 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:41:16,039 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717641331] [2019-11-15 22:41:16,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:41:16,039 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:41:16,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:41:16,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:41:16,039 INFO L87 Difference]: Start difference. First operand 12478 states and 34355 transitions. Second operand 5 states. [2019-11-15 22:41:16,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:41:16,072 INFO L93 Difference]: Finished difference Result 4027 states and 9374 transitions. [2019-11-15 22:41:16,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:41:16,072 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-11-15 22:41:16,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:41:16,074 INFO L225 Difference]: With dead ends: 4027 [2019-11-15 22:41:16,075 INFO L226 Difference]: Without dead ends: 3354 [2019-11-15 22:41:16,075 INFO L600 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 [2019-11-15 22:41:16,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3354 states. [2019-11-15 22:41:16,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3354 to 3094. [2019-11-15 22:41:16,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3094 states. [2019-11-15 22:41:16,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3094 states to 3094 states and 7080 transitions. [2019-11-15 22:41:16,099 INFO L78 Accepts]: Start accepts. Automaton has 3094 states and 7080 transitions. Word has length 70 [2019-11-15 22:41:16,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:41:16,099 INFO L462 AbstractCegarLoop]: Abstraction has 3094 states and 7080 transitions. [2019-11-15 22:41:16,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:41:16,100 INFO L276 IsEmpty]: Start isEmpty. Operand 3094 states and 7080 transitions. [2019-11-15 22:41:16,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 22:41:16,102 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:41:16,102 INFO L380 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] [2019-11-15 22:41:16,102 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:41:16,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:16,103 INFO L82 PathProgramCache]: Analyzing trace with hash 605353181, now seen corresponding path program 1 times [2019-11-15 22:41:16,103 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:16,103 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694661292] [2019-11-15 22:41:16,103 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:16,103 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:16,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:16,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:17,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:17,253 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694661292] [2019-11-15 22:41:17,253 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:41:17,253 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:41:17,254 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479456556] [2019-11-15 22:41:17,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:41:17,254 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:41:17,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:41:17,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:41:17,254 INFO L87 Difference]: Start difference. First operand 3094 states and 7080 transitions. Second operand 7 states. [2019-11-15 22:41:17,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:41:17,753 INFO L93 Difference]: Finished difference Result 3733 states and 8441 transitions. [2019-11-15 22:41:17,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 22:41:17,753 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 87 [2019-11-15 22:41:17,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:41:17,756 INFO L225 Difference]: With dead ends: 3733 [2019-11-15 22:41:17,756 INFO L226 Difference]: Without dead ends: 3702 [2019-11-15 22:41:17,757 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-11-15 22:41:17,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3702 states. [2019-11-15 22:41:17,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3702 to 3248. [2019-11-15 22:41:17,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3248 states. [2019-11-15 22:41:17,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3248 states to 3248 states and 7403 transitions. [2019-11-15 22:41:17,783 INFO L78 Accepts]: Start accepts. Automaton has 3248 states and 7403 transitions. Word has length 87 [2019-11-15 22:41:17,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:41:17,783 INFO L462 AbstractCegarLoop]: Abstraction has 3248 states and 7403 transitions. [2019-11-15 22:41:17,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:41:17,783 INFO L276 IsEmpty]: Start isEmpty. Operand 3248 states and 7403 transitions. [2019-11-15 22:41:17,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 22:41:17,786 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:41:17,786 INFO L380 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] [2019-11-15 22:41:17,787 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:41:17,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:17,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1471856162, now seen corresponding path program 1 times [2019-11-15 22:41:17,787 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:17,787 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148807989] [2019-11-15 22:41:17,788 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:17,788 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:17,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:17,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:17,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:17,918 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148807989] [2019-11-15 22:41:17,918 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:41:17,918 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:41:17,918 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801121488] [2019-11-15 22:41:17,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:41:17,919 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:41:17,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:41:17,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:41:17,920 INFO L87 Difference]: Start difference. First operand 3248 states and 7403 transitions. Second operand 7 states. [2019-11-15 22:41:18,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:41:18,117 INFO L93 Difference]: Finished difference Result 5472 states and 12557 transitions. [2019-11-15 22:41:18,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:41:18,118 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 87 [2019-11-15 22:41:18,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:41:18,121 INFO L225 Difference]: With dead ends: 5472 [2019-11-15 22:41:18,122 INFO L226 Difference]: Without dead ends: 4906 [2019-11-15 22:41:18,122 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-15 22:41:18,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4906 states. [2019-11-15 22:41:18,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4906 to 3168. [2019-11-15 22:41:18,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3168 states. [2019-11-15 22:41:18,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3168 states to 3168 states and 7227 transitions. [2019-11-15 22:41:18,155 INFO L78 Accepts]: Start accepts. Automaton has 3168 states and 7227 transitions. Word has length 87 [2019-11-15 22:41:18,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:41:18,155 INFO L462 AbstractCegarLoop]: Abstraction has 3168 states and 7227 transitions. [2019-11-15 22:41:18,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:41:18,155 INFO L276 IsEmpty]: Start isEmpty. Operand 3168 states and 7227 transitions. [2019-11-15 22:41:18,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 22:41:18,158 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:41:18,158 INFO L380 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] [2019-11-15 22:41:18,158 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:41:18,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:18,159 INFO L82 PathProgramCache]: Analyzing trace with hash -2073694820, now seen corresponding path program 2 times [2019-11-15 22:41:18,159 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:18,159 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822778154] [2019-11-15 22:41:18,159 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:18,159 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:18,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:18,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:18,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:18,312 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822778154] [2019-11-15 22:41:18,312 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:41:18,312 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 22:41:18,312 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299124182] [2019-11-15 22:41:18,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 22:41:18,313 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:41:18,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 22:41:18,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:41:18,313 INFO L87 Difference]: Start difference. First operand 3168 states and 7227 transitions. Second operand 9 states. [2019-11-15 22:41:18,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:41:18,662 INFO L93 Difference]: Finished difference Result 8430 states and 19336 transitions. [2019-11-15 22:41:18,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-15 22:41:18,663 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-11-15 22:41:18,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:41:18,667 INFO L225 Difference]: With dead ends: 8430 [2019-11-15 22:41:18,667 INFO L226 Difference]: Without dead ends: 5551 [2019-11-15 22:41:18,667 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2019-11-15 22:41:18,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5551 states. [2019-11-15 22:41:18,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5551 to 3326. [2019-11-15 22:41:18,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3326 states. [2019-11-15 22:41:18,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3326 states to 3326 states and 7551 transitions. [2019-11-15 22:41:18,703 INFO L78 Accepts]: Start accepts. Automaton has 3326 states and 7551 transitions. Word has length 87 [2019-11-15 22:41:18,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:41:18,703 INFO L462 AbstractCegarLoop]: Abstraction has 3326 states and 7551 transitions. [2019-11-15 22:41:18,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 22:41:18,704 INFO L276 IsEmpty]: Start isEmpty. Operand 3326 states and 7551 transitions. [2019-11-15 22:41:18,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 22:41:18,705 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:41:18,706 INFO L380 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] [2019-11-15 22:41:18,706 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:41:18,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:18,706 INFO L82 PathProgramCache]: Analyzing trace with hash 653867470, now seen corresponding path program 3 times [2019-11-15 22:41:18,706 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:18,706 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903711726] [2019-11-15 22:41:18,706 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:18,706 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:18,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:18,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:18,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:18,819 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903711726] [2019-11-15 22:41:18,819 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:41:18,819 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:41:18,819 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879238226] [2019-11-15 22:41:18,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:41:18,820 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:41:18,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:41:18,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:41:18,820 INFO L87 Difference]: Start difference. First operand 3326 states and 7551 transitions. Second operand 7 states. [2019-11-15 22:41:18,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:41:18,887 INFO L93 Difference]: Finished difference Result 5585 states and 12729 transitions. [2019-11-15 22:41:18,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:41:18,888 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 87 [2019-11-15 22:41:18,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:41:18,889 INFO L225 Difference]: With dead ends: 5585 [2019-11-15 22:41:18,889 INFO L226 Difference]: Without dead ends: 2352 [2019-11-15 22:41:18,890 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-15 22:41:18,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2352 states. [2019-11-15 22:41:18,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2352 to 2352. [2019-11-15 22:41:18,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2352 states. [2019-11-15 22:41:18,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2352 states to 2352 states and 5330 transitions. [2019-11-15 22:41:18,906 INFO L78 Accepts]: Start accepts. Automaton has 2352 states and 5330 transitions. Word has length 87 [2019-11-15 22:41:18,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:41:18,906 INFO L462 AbstractCegarLoop]: Abstraction has 2352 states and 5330 transitions. [2019-11-15 22:41:18,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:41:18,906 INFO L276 IsEmpty]: Start isEmpty. Operand 2352 states and 5330 transitions. [2019-11-15 22:41:18,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 22:41:18,908 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:41:18,908 INFO L380 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] [2019-11-15 22:41:18,908 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:41:18,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:18,909 INFO L82 PathProgramCache]: Analyzing trace with hash -143330158, now seen corresponding path program 1 times [2019-11-15 22:41:18,909 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:18,909 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771981390] [2019-11-15 22:41:18,909 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:18,909 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:18,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:18,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:18,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:18,976 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771981390] [2019-11-15 22:41:18,976 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:41:18,976 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:41:18,976 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900293164] [2019-11-15 22:41:18,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:41:18,977 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:41:18,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:41:18,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:41:18,977 INFO L87 Difference]: Start difference. First operand 2352 states and 5330 transitions. Second operand 5 states. [2019-11-15 22:41:19,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:41:19,207 INFO L93 Difference]: Finished difference Result 2651 states and 5949 transitions. [2019-11-15 22:41:19,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:41:19,208 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2019-11-15 22:41:19,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:41:19,211 INFO L225 Difference]: With dead ends: 2651 [2019-11-15 22:41:19,211 INFO L226 Difference]: Without dead ends: 2629 [2019-11-15 22:41:19,211 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:41:19,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2629 states. [2019-11-15 22:41:19,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2629 to 2376. [2019-11-15 22:41:19,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2376 states. [2019-11-15 22:41:19,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2376 states to 2376 states and 5387 transitions. [2019-11-15 22:41:19,240 INFO L78 Accepts]: Start accepts. Automaton has 2376 states and 5387 transitions. Word has length 87 [2019-11-15 22:41:19,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:41:19,240 INFO L462 AbstractCegarLoop]: Abstraction has 2376 states and 5387 transitions. [2019-11-15 22:41:19,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:41:19,241 INFO L276 IsEmpty]: Start isEmpty. Operand 2376 states and 5387 transitions. [2019-11-15 22:41:19,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 22:41:19,243 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:41:19,243 INFO L380 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] [2019-11-15 22:41:19,244 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:41:19,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:19,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1267873548, now seen corresponding path program 1 times [2019-11-15 22:41:19,244 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:19,244 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620748539] [2019-11-15 22:41:19,244 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:19,245 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:19,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:19,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:19,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:19,336 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620748539] [2019-11-15 22:41:19,336 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:41:19,336 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:41:19,336 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779676208] [2019-11-15 22:41:19,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:41:19,337 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:41:19,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:41:19,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:41:19,338 INFO L87 Difference]: Start difference. First operand 2376 states and 5387 transitions. Second operand 6 states. [2019-11-15 22:41:19,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:41:19,586 INFO L93 Difference]: Finished difference Result 2577 states and 5823 transitions. [2019-11-15 22:41:19,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:41:19,587 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2019-11-15 22:41:19,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:41:19,589 INFO L225 Difference]: With dead ends: 2577 [2019-11-15 22:41:19,590 INFO L226 Difference]: Without dead ends: 2577 [2019-11-15 22:41:19,590 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:41:19,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2577 states. [2019-11-15 22:41:19,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2577 to 2318. [2019-11-15 22:41:19,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2318 states. [2019-11-15 22:41:19,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 5265 transitions. [2019-11-15 22:41:19,617 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 5265 transitions. Word has length 87 [2019-11-15 22:41:19,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:41:19,618 INFO L462 AbstractCegarLoop]: Abstraction has 2318 states and 5265 transitions. [2019-11-15 22:41:19,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:41:19,618 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 5265 transitions. [2019-11-15 22:41:19,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 22:41:19,620 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:41:19,621 INFO L380 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] [2019-11-15 22:41:19,621 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:41:19,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:19,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1565513749, now seen corresponding path program 1 times [2019-11-15 22:41:19,622 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:19,622 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946221022] [2019-11-15 22:41:19,622 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:19,622 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:19,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:19,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:19,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:19,785 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946221022] [2019-11-15 22:41:19,785 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:41:19,785 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 22:41:19,785 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218217756] [2019-11-15 22:41:19,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 22:41:19,786 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:41:19,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:41:19,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:41:19,787 INFO L87 Difference]: Start difference. First operand 2318 states and 5265 transitions. Second operand 8 states. [2019-11-15 22:41:20,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:41:20,140 INFO L93 Difference]: Finished difference Result 2603 states and 5874 transitions. [2019-11-15 22:41:20,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 22:41:20,141 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 87 [2019-11-15 22:41:20,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:41:20,144 INFO L225 Difference]: With dead ends: 2603 [2019-11-15 22:41:20,144 INFO L226 Difference]: Without dead ends: 2603 [2019-11-15 22:41:20,144 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2019-11-15 22:41:20,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2603 states. [2019-11-15 22:41:20,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2603 to 2359. [2019-11-15 22:41:20,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2359 states. [2019-11-15 22:41:20,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2359 states to 2359 states and 5344 transitions. [2019-11-15 22:41:20,174 INFO L78 Accepts]: Start accepts. Automaton has 2359 states and 5344 transitions. Word has length 87 [2019-11-15 22:41:20,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:41:20,174 INFO L462 AbstractCegarLoop]: Abstraction has 2359 states and 5344 transitions. [2019-11-15 22:41:20,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 22:41:20,175 INFO L276 IsEmpty]: Start isEmpty. Operand 2359 states and 5344 transitions. [2019-11-15 22:41:20,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 22:41:20,177 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:41:20,177 INFO L380 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] [2019-11-15 22:41:20,178 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:41:20,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:20,178 INFO L82 PathProgramCache]: Analyzing trace with hash -678010068, now seen corresponding path program 4 times [2019-11-15 22:41:20,178 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:20,179 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741455779] [2019-11-15 22:41:20,179 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:20,179 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:20,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:20,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:20,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:20,342 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741455779] [2019-11-15 22:41:20,342 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:41:20,342 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 22:41:20,343 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779169913] [2019-11-15 22:41:20,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 22:41:20,344 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:41:20,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 22:41:20,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:41:20,344 INFO L87 Difference]: Start difference. First operand 2359 states and 5344 transitions. Second operand 10 states. [2019-11-15 22:41:20,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:41:20,585 INFO L93 Difference]: Finished difference Result 3950 states and 8970 transitions. [2019-11-15 22:41:20,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 22:41:20,586 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 87 [2019-11-15 22:41:20,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:41:20,588 INFO L225 Difference]: With dead ends: 3950 [2019-11-15 22:41:20,588 INFO L226 Difference]: Without dead ends: 2571 [2019-11-15 22:41:20,588 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-11-15 22:41:20,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2571 states. [2019-11-15 22:41:20,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2571 to 2341. [2019-11-15 22:41:20,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2341 states. [2019-11-15 22:41:20,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2341 states to 2341 states and 5306 transitions. [2019-11-15 22:41:20,607 INFO L78 Accepts]: Start accepts. Automaton has 2341 states and 5306 transitions. Word has length 87 [2019-11-15 22:41:20,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:41:20,607 INFO L462 AbstractCegarLoop]: Abstraction has 2341 states and 5306 transitions. [2019-11-15 22:41:20,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 22:41:20,607 INFO L276 IsEmpty]: Start isEmpty. Operand 2341 states and 5306 transitions. [2019-11-15 22:41:20,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 22:41:20,609 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:41:20,609 INFO L380 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] [2019-11-15 22:41:20,609 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:41:20,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:20,610 INFO L82 PathProgramCache]: Analyzing trace with hash -619279510, now seen corresponding path program 5 times [2019-11-15 22:41:20,610 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:20,610 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097713548] [2019-11-15 22:41:20,610 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:20,610 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:20,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:20,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:41:20,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:41:20,682 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:41:20,682 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 22:41:20,800 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-15 22:41:20,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 10:41:20 BasicIcfg [2019-11-15 22:41:20,802 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 22:41:20,802 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:41:20,802 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:41:20,803 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:41:20,803 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:40:52" (3/4) ... [2019-11-15 22:41:20,805 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 22:41:20,936 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_5521c805-7f57-47b1-ac82-e233df256af9/bin/uautomizer/witness.graphml [2019-11-15 22:41:20,937 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:41:20,939 INFO L168 Benchmark]: Toolchain (without parser) took 29380.46 ms. Allocated memory was 1.0 GB in the beginning and 3.7 GB in the end (delta: 2.7 GB). Free memory was 943.4 MB in the beginning and 2.7 GB in the end (delta: -1.7 GB). Peak memory consumption was 984.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:41:20,939 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:41:20,939 INFO L168 Benchmark]: CACSL2BoogieTranslator took 592.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -181.7 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-11-15 22:41:20,940 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-15 22:41:20,940 INFO L168 Benchmark]: Boogie Preprocessor took 36.80 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. [2019-11-15 22:41:20,941 INFO L168 Benchmark]: RCFGBuilder took 695.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 47.1 MB). Peak memory consumption was 47.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:41:20,941 INFO L168 Benchmark]: TraceAbstraction took 27863.40 ms. Allocated memory was 1.2 GB in the beginning and 3.7 GB in the end (delta: 2.6 GB). Free memory was 1.1 GB in the beginning and 2.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 938.0 MB. Max. memory is 11.5 GB. [2019-11-15 22:41:20,941 INFO L168 Benchmark]: Witness Printer took 134.41 ms. Allocated memory is still 3.7 GB. Free memory was 2.7 GB in the beginning and 2.7 GB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2019-11-15 22:41:20,943 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 592.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -181.7 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.80 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 695.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 47.1 MB). Peak memory consumption was 47.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 27863.40 ms. Allocated memory was 1.2 GB in the beginning and 3.7 GB in the end (delta: 2.6 GB). Free memory was 1.1 GB in the beginning and 2.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 938.0 MB. Max. memory is 11.5 GB. * Witness Printer took 134.41 ms. Allocated memory is still 3.7 GB. Free memory was 2.7 GB in the beginning and 2.7 GB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L699] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L701] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L703] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L705] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0] [L706] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0] [L707] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L709] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L711] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L712] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L713] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L714] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L715] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L716] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L717] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L718] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L719] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L720] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L721] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L722] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L723] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L724] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L725] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L727] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L728] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L729] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L809] 0 pthread_t t843; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L810] FCALL, FORK 0 pthread_create(&t843, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L811] 0 pthread_t t844; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L812] FCALL, FORK 0 pthread_create(&t844, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L767] 2 y$w_buff1 = y$w_buff0 [L768] 2 y$w_buff0 = 1 [L769] 2 y$w_buff1_used = y$w_buff0_used [L770] 2 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L772] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L773] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L774] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L775] 2 y$r_buff0_thd2 = (_Bool)1 [L778] 2 z = 1 [L781] 2 __unbuffered_p1_EAX = z [L784] 2 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] 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=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 1 a = 1 [L736] 1 x = 1 [L739] 1 __unbuffered_p0_EAX = x [L742] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L743] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L744] 1 y$flush_delayed = weak$$choice2 [L745] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] 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) [L788] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L788] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L789] 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 [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L747] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L747] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L748] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L789] 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 [L749] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L750] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L751] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L751] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L752] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L752] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L753] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 1 y = y$flush_delayed ? y$mem_tmp : y [L755] 1 y$flush_delayed = (_Bool)0 [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L790] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L791] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] 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 [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L819] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L819] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L820] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L820] 0 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 [L821] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] 0 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 [L825] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 198 locations, 3 error locations. Result: UNSAFE, OverallTime: 27.7s, OverallIterations: 26, TraceHistogramMax: 1, AutomataDifference: 11.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6848 SDtfs, 8197 SDslu, 17186 SDs, 0 SdLazy, 5580 SolverSat, 371 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 255 GetRequests, 63 SyntacticMatches, 13 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57892occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.2s AutomataMinimizationTime, 25 MinimizatonAttempts, 57613 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1821 NumberOfCodeBlocks, 1821 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1709 ConstructedInterpolants, 0 QuantifiedInterpolants, 366090 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...