./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe022_pso.oepc.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_d5f26d3c-72eb-45f6-acea-916fdfa9ddb1/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d5f26d3c-72eb-45f6-acea-916fdfa9ddb1/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d5f26d3c-72eb-45f6-acea-916fdfa9ddb1/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d5f26d3c-72eb-45f6-acea-916fdfa9ddb1/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe022_pso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_d5f26d3c-72eb-45f6-acea-916fdfa9ddb1/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d5f26d3c-72eb-45f6-acea-916fdfa9ddb1/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 7849b02df788e833596e9492b95b82c107a8b563 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 23:54:00,487 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:54:00,489 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:54:00,499 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:54:00,500 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:54:00,500 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:54:00,502 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:54:00,504 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:54:00,505 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:54:00,506 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:54:00,507 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:54:00,508 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:54:00,508 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:54:00,509 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:54:00,510 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:54:00,511 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:54:00,512 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:54:00,512 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:54:00,514 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:54:00,516 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:54:00,518 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:54:00,519 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:54:00,520 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:54:00,521 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:54:00,524 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:54:00,524 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:54:00,524 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:54:00,525 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:54:00,526 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:54:00,527 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:54:00,527 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:54:00,528 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:54:00,528 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:54:00,529 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:54:00,530 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:54:00,530 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:54:00,531 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:54:00,531 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:54:00,531 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:54:00,532 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:54:00,533 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:54:00,534 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d5f26d3c-72eb-45f6-acea-916fdfa9ddb1/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:54:00,547 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:54:00,547 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:54:00,548 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:54:00,548 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:54:00,549 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:54:00,549 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:54:00,549 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:54:00,549 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:54:00,549 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:54:00,550 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:54:00,550 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:54:00,550 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:54:00,550 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:54:00,550 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:54:00,551 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:54:00,551 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:54:00,551 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:54:00,551 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:54:00,552 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:54:00,552 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:54:00,552 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:54:00,552 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:54:00,552 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:54:00,553 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:54:00,553 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:54:00,553 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:54:00,553 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:54:00,553 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:54:00,554 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_d5f26d3c-72eb-45f6-acea-916fdfa9ddb1/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 -> 7849b02df788e833596e9492b95b82c107a8b563 [2019-11-15 23:54:00,580 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:54:00,589 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:54:00,599 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:54:00,601 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:54:00,601 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:54:00,602 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d5f26d3c-72eb-45f6-acea-916fdfa9ddb1/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe022_pso.oepc.i [2019-11-15 23:54:00,648 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d5f26d3c-72eb-45f6-acea-916fdfa9ddb1/bin/uautomizer/data/4d0c46afa/3258dc665da1465cb885f0f0c4108fec/FLAG672e9722e [2019-11-15 23:54:01,155 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:54:01,155 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d5f26d3c-72eb-45f6-acea-916fdfa9ddb1/sv-benchmarks/c/pthread-wmm/safe022_pso.oepc.i [2019-11-15 23:54:01,170 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d5f26d3c-72eb-45f6-acea-916fdfa9ddb1/bin/uautomizer/data/4d0c46afa/3258dc665da1465cb885f0f0c4108fec/FLAG672e9722e [2019-11-15 23:54:01,495 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d5f26d3c-72eb-45f6-acea-916fdfa9ddb1/bin/uautomizer/data/4d0c46afa/3258dc665da1465cb885f0f0c4108fec [2019-11-15 23:54:01,498 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:54:01,499 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:54:01,501 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:54:01,501 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:54:01,511 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:54:01,512 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:54:01" (1/1) ... [2019-11-15 23:54:01,515 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5609a17a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:54:01, skipping insertion in model container [2019-11-15 23:54:01,515 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:54:01" (1/1) ... [2019-11-15 23:54:01,522 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:54:01,565 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:54:01,990 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:54:02,001 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:54:02,063 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:54:02,146 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:54:02,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:54:02 WrapperNode [2019-11-15 23:54:02,146 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:54:02,147 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:54:02,147 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:54:02,147 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:54:02,155 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:54:02" (1/1) ... [2019-11-15 23:54:02,171 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:54:02" (1/1) ... [2019-11-15 23:54:02,218 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:54:02,220 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:54:02,220 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:54:02,220 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:54:02,227 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:54:02" (1/1) ... [2019-11-15 23:54:02,228 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:54:02" (1/1) ... [2019-11-15 23:54:02,234 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:54:02" (1/1) ... [2019-11-15 23:54:02,235 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:54:02" (1/1) ... [2019-11-15 23:54:02,244 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:54:02" (1/1) ... [2019-11-15 23:54:02,264 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:54:02" (1/1) ... [2019-11-15 23:54:02,267 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:54:02" (1/1) ... [2019-11-15 23:54:02,283 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:54:02,284 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:54:02,284 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:54:02,284 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:54:02,285 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:54:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d5f26d3c-72eb-45f6-acea-916fdfa9ddb1/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 23:54:02,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:54:02,352 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-15 23:54:02,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:54:02,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:54:02,353 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-15 23:54:02,353 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-15 23:54:02,353 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-15 23:54:02,353 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-15 23:54:02,353 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-15 23:54:02,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:54:02,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:54:02,356 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 23:54:03,104 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:54:03,107 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 23:54:03,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:54:03 BoogieIcfgContainer [2019-11-15 23:54:03,108 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:54:03,109 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:54:03,109 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:54:03,111 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:54:03,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:54:01" (1/3) ... [2019-11-15 23:54:03,112 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c0aa76c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:54:03, skipping insertion in model container [2019-11-15 23:54:03,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:54:02" (2/3) ... [2019-11-15 23:54:03,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c0aa76c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:54:03, skipping insertion in model container [2019-11-15 23:54:03,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:54:03" (3/3) ... [2019-11-15 23:54:03,115 INFO L109 eAbstractionObserver]: Analyzing ICFG safe022_pso.oepc.i [2019-11-15 23:54:03,153 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,153 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,153 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,153 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,153 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,154 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,154 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,154 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,154 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,154 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,155 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,155 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,155 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,155 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,155 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,155 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,155 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,155 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,156 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,156 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,156 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,156 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,156 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,156 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,156 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,157 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,157 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,157 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,157 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,157 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,158 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,158 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,158 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,158 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,159 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,159 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,159 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,160 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,160 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,160 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,160 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,160 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,160 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,161 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,161 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,161 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,161 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,161 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,162 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,162 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,162 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,162 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,162 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,162 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,163 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,163 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,163 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,163 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,163 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,164 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,164 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,164 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,164 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,164 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,164 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,165 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,165 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,165 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,165 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,165 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,165 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,166 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,166 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,166 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,166 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,166 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,167 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,167 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,167 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,167 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,167 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,168 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,168 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,168 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,168 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,168 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,168 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,169 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,169 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,169 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,169 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,169 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,170 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,170 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,170 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,170 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,170 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,170 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,171 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,171 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,171 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,171 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,171 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,171 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,172 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,172 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,172 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,172 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,172 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,173 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,173 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,173 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,173 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,173 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,173 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,174 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,174 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,178 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,178 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,178 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,178 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,178 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,179 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,179 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,179 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,179 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,179 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,179 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,180 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,180 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,180 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,180 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,180 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,180 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,181 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,181 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,181 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,181 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,181 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,181 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,182 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,182 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,182 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,182 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,182 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,183 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,183 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,183 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,183 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,183 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,183 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,184 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:54:03,194 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-15 23:54:03,194 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:54:03,201 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-15 23:54:03,211 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-15 23:54:03,229 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:54:03,229 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:54:03,229 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:54:03,229 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:54:03,229 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:54:03,229 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:54:03,229 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:54:03,230 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:54:03,241 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 140 places, 178 transitions [2019-11-15 23:54:05,727 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32590 states. [2019-11-15 23:54:05,729 INFO L276 IsEmpty]: Start isEmpty. Operand 32590 states. [2019-11-15 23:54:05,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-15 23:54:05,736 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:54:05,737 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] [2019-11-15 23:54:05,745 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:54:05,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:05,750 INFO L82 PathProgramCache]: Analyzing trace with hash -254800073, now seen corresponding path program 1 times [2019-11-15 23:54:05,758 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:05,759 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249417519] [2019-11-15 23:54:05,759 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:05,760 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:05,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:05,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:05,995 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 23:54:06,001 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249417519] [2019-11-15 23:54:06,003 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:54:06,003 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:54:06,003 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318927402] [2019-11-15 23:54:06,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:54:06,008 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:06,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:54:06,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:54:06,024 INFO L87 Difference]: Start difference. First operand 32590 states. Second operand 4 states. [2019-11-15 23:54:07,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:07,023 INFO L93 Difference]: Finished difference Result 33590 states and 129567 transitions. [2019-11-15 23:54:07,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:54:07,025 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-11-15 23:54:07,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:54:07,297 INFO L225 Difference]: With dead ends: 33590 [2019-11-15 23:54:07,297 INFO L226 Difference]: Without dead ends: 25702 [2019-11-15 23:54:07,299 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 23:54:07,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25702 states. [2019-11-15 23:54:08,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25702 to 25702. [2019-11-15 23:54:08,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25702 states. [2019-11-15 23:54:08,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25702 states to 25702 states and 99583 transitions. [2019-11-15 23:54:08,802 INFO L78 Accepts]: Start accepts. Automaton has 25702 states and 99583 transitions. Word has length 33 [2019-11-15 23:54:08,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:54:08,804 INFO L462 AbstractCegarLoop]: Abstraction has 25702 states and 99583 transitions. [2019-11-15 23:54:08,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:54:08,804 INFO L276 IsEmpty]: Start isEmpty. Operand 25702 states and 99583 transitions. [2019-11-15 23:54:08,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 23:54:08,816 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:54:08,816 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] [2019-11-15 23:54:08,816 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:54:08,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:08,817 INFO L82 PathProgramCache]: Analyzing trace with hash -250081261, now seen corresponding path program 1 times [2019-11-15 23:54:08,817 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:08,817 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946736351] [2019-11-15 23:54:08,818 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:08,818 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:08,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:08,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:08,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 23:54:08,986 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946736351] [2019-11-15 23:54:08,987 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:54:08,987 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:54:08,987 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620439846] [2019-11-15 23:54:08,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:54:08,989 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:08,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:54:08,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:54:08,989 INFO L87 Difference]: Start difference. First operand 25702 states and 99583 transitions. Second operand 5 states. [2019-11-15 23:54:09,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:09,936 INFO L93 Difference]: Finished difference Result 41080 states and 150430 transitions. [2019-11-15 23:54:09,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:54:09,936 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-15 23:54:09,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:54:10,109 INFO L225 Difference]: With dead ends: 41080 [2019-11-15 23:54:10,110 INFO L226 Difference]: Without dead ends: 40544 [2019-11-15 23:54:10,111 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 23:54:10,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40544 states. [2019-11-15 23:54:11,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40544 to 38924. [2019-11-15 23:54:11,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38924 states. [2019-11-15 23:54:11,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38924 states to 38924 states and 143580 transitions. [2019-11-15 23:54:11,677 INFO L78 Accepts]: Start accepts. Automaton has 38924 states and 143580 transitions. Word has length 45 [2019-11-15 23:54:11,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:54:11,679 INFO L462 AbstractCegarLoop]: Abstraction has 38924 states and 143580 transitions. [2019-11-15 23:54:11,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:54:11,679 INFO L276 IsEmpty]: Start isEmpty. Operand 38924 states and 143580 transitions. [2019-11-15 23:54:11,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-15 23:54:11,691 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:54:11,691 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] [2019-11-15 23:54:11,692 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:54:11,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:11,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1037182150, now seen corresponding path program 1 times [2019-11-15 23:54:11,692 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:11,692 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217490588] [2019-11-15 23:54:11,693 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:11,693 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:11,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:11,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:11,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 23:54:11,776 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217490588] [2019-11-15 23:54:11,776 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:54:11,776 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:54:11,776 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388523478] [2019-11-15 23:54:11,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:54:11,777 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:11,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:54:11,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:54:11,777 INFO L87 Difference]: Start difference. First operand 38924 states and 143580 transitions. Second operand 5 states. [2019-11-15 23:54:12,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:12,379 INFO L93 Difference]: Finished difference Result 49777 states and 180632 transitions. [2019-11-15 23:54:12,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:54:12,380 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-11-15 23:54:12,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:54:12,699 INFO L225 Difference]: With dead ends: 49777 [2019-11-15 23:54:12,699 INFO L226 Difference]: Without dead ends: 49273 [2019-11-15 23:54:12,700 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 23:54:13,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49273 states. [2019-11-15 23:54:14,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49273 to 42676. [2019-11-15 23:54:14,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42676 states. [2019-11-15 23:54:14,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42676 states to 42676 states and 156591 transitions. [2019-11-15 23:54:14,311 INFO L78 Accepts]: Start accepts. Automaton has 42676 states and 156591 transitions. Word has length 46 [2019-11-15 23:54:14,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:54:14,311 INFO L462 AbstractCegarLoop]: Abstraction has 42676 states and 156591 transitions. [2019-11-15 23:54:14,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:54:14,312 INFO L276 IsEmpty]: Start isEmpty. Operand 42676 states and 156591 transitions. [2019-11-15 23:54:14,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-15 23:54:14,320 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:54:14,320 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] [2019-11-15 23:54:14,320 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:54:14,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:14,321 INFO L82 PathProgramCache]: Analyzing trace with hash 671596896, now seen corresponding path program 1 times [2019-11-15 23:54:14,321 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:14,321 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654252734] [2019-11-15 23:54:14,322 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:14,322 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:14,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:14,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:14,396 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 23:54:14,396 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654252734] [2019-11-15 23:54:14,396 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:54:14,396 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:54:14,397 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702640139] [2019-11-15 23:54:14,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:54:14,397 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:14,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:54:14,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:54:14,398 INFO L87 Difference]: Start difference. First operand 42676 states and 156591 transitions. Second operand 3 states. [2019-11-15 23:54:14,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:14,734 INFO L93 Difference]: Finished difference Result 61086 states and 221429 transitions. [2019-11-15 23:54:14,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:54:14,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-11-15 23:54:14,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:54:14,906 INFO L225 Difference]: With dead ends: 61086 [2019-11-15 23:54:14,906 INFO L226 Difference]: Without dead ends: 61086 [2019-11-15 23:54:14,906 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 23:54:15,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61086 states. [2019-11-15 23:54:16,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61086 to 48015. [2019-11-15 23:54:16,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48015 states. [2019-11-15 23:54:16,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48015 states to 48015 states and 174178 transitions. [2019-11-15 23:54:16,683 INFO L78 Accepts]: Start accepts. Automaton has 48015 states and 174178 transitions. Word has length 48 [2019-11-15 23:54:16,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:54:16,683 INFO L462 AbstractCegarLoop]: Abstraction has 48015 states and 174178 transitions. [2019-11-15 23:54:16,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:54:16,684 INFO L276 IsEmpty]: Start isEmpty. Operand 48015 states and 174178 transitions. [2019-11-15 23:54:16,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 23:54:16,699 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:54:16,699 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 23:54:16,700 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:54:16,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:16,700 INFO L82 PathProgramCache]: Analyzing trace with hash -934557998, now seen corresponding path program 1 times [2019-11-15 23:54:16,700 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:16,700 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87640243] [2019-11-15 23:54:16,701 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:16,701 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:16,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:16,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:16,822 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 23:54:16,822 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87640243] [2019-11-15 23:54:16,822 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:54:16,822 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:54:16,822 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662070857] [2019-11-15 23:54:16,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:54:16,823 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:16,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:54:16,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:54:16,823 INFO L87 Difference]: Start difference. First operand 48015 states and 174178 transitions. Second operand 6 states. [2019-11-15 23:54:17,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:17,774 INFO L93 Difference]: Finished difference Result 63755 states and 229378 transitions. [2019-11-15 23:54:17,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:54:17,775 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-11-15 23:54:17,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:54:17,942 INFO L225 Difference]: With dead ends: 63755 [2019-11-15 23:54:17,942 INFO L226 Difference]: Without dead ends: 63755 [2019-11-15 23:54:17,942 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 23:54:19,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63755 states. [2019-11-15 23:54:19,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63755 to 59948. [2019-11-15 23:54:19,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59948 states. [2019-11-15 23:54:19,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59948 states to 59948 states and 215671 transitions. [2019-11-15 23:54:19,880 INFO L78 Accepts]: Start accepts. Automaton has 59948 states and 215671 transitions. Word has length 52 [2019-11-15 23:54:19,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:54:19,880 INFO L462 AbstractCegarLoop]: Abstraction has 59948 states and 215671 transitions. [2019-11-15 23:54:19,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:54:19,880 INFO L276 IsEmpty]: Start isEmpty. Operand 59948 states and 215671 transitions. [2019-11-15 23:54:19,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 23:54:19,897 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:54:19,897 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 23:54:19,898 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:54:19,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:19,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1563457939, now seen corresponding path program 1 times [2019-11-15 23:54:19,898 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:19,899 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358208942] [2019-11-15 23:54:19,899 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:19,899 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:19,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:19,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:20,007 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 23:54:20,007 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358208942] [2019-11-15 23:54:20,007 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:54:20,007 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:54:20,007 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083940057] [2019-11-15 23:54:20,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:54:20,008 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:20,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:54:20,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:54:20,008 INFO L87 Difference]: Start difference. First operand 59948 states and 215671 transitions. Second operand 7 states. [2019-11-15 23:54:21,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:21,221 INFO L93 Difference]: Finished difference Result 83684 states and 290096 transitions. [2019-11-15 23:54:21,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:54:21,222 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-11-15 23:54:21,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:54:21,412 INFO L225 Difference]: With dead ends: 83684 [2019-11-15 23:54:21,412 INFO L226 Difference]: Without dead ends: 83684 [2019-11-15 23:54:21,413 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:54:25,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83684 states. [2019-11-15 23:54:26,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83684 to 71011. [2019-11-15 23:54:26,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71011 states. [2019-11-15 23:54:26,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71011 states to 71011 states and 249885 transitions. [2019-11-15 23:54:26,247 INFO L78 Accepts]: Start accepts. Automaton has 71011 states and 249885 transitions. Word has length 52 [2019-11-15 23:54:26,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:54:26,247 INFO L462 AbstractCegarLoop]: Abstraction has 71011 states and 249885 transitions. [2019-11-15 23:54:26,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:54:26,247 INFO L276 IsEmpty]: Start isEmpty. Operand 71011 states and 249885 transitions. [2019-11-15 23:54:26,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 23:54:26,259 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:54:26,259 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 23:54:26,259 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:54:26,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:26,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1844005676, now seen corresponding path program 1 times [2019-11-15 23:54:26,259 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:26,259 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399083388] [2019-11-15 23:54:26,260 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:26,260 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:26,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:26,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:26,361 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 23:54:26,361 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399083388] [2019-11-15 23:54:26,361 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:54:26,362 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:54:26,362 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166217924] [2019-11-15 23:54:26,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:54:26,362 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:26,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:54:26,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:54:26,363 INFO L87 Difference]: Start difference. First operand 71011 states and 249885 transitions. Second operand 4 states. [2019-11-15 23:54:26,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:26,434 INFO L93 Difference]: Finished difference Result 12158 states and 37828 transitions. [2019-11-15 23:54:26,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:54:26,434 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-15 23:54:26,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:54:26,452 INFO L225 Difference]: With dead ends: 12158 [2019-11-15 23:54:26,453 INFO L226 Difference]: Without dead ends: 10673 [2019-11-15 23:54:26,453 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 23:54:26,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10673 states. [2019-11-15 23:54:26,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10673 to 10624. [2019-11-15 23:54:26,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10624 states. [2019-11-15 23:54:26,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10624 states to 10624 states and 32590 transitions. [2019-11-15 23:54:26,597 INFO L78 Accepts]: Start accepts. Automaton has 10624 states and 32590 transitions. Word has length 52 [2019-11-15 23:54:26,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:54:26,597 INFO L462 AbstractCegarLoop]: Abstraction has 10624 states and 32590 transitions. [2019-11-15 23:54:26,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:54:26,597 INFO L276 IsEmpty]: Start isEmpty. Operand 10624 states and 32590 transitions. [2019-11-15 23:54:26,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 23:54:26,599 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:54:26,599 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 23:54:26,599 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:54:26,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:26,599 INFO L82 PathProgramCache]: Analyzing trace with hash -456832597, now seen corresponding path program 1 times [2019-11-15 23:54:26,600 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:26,600 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114676493] [2019-11-15 23:54:26,600 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:26,600 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:26,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:26,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:26,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 23:54:26,668 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114676493] [2019-11-15 23:54:26,669 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:54:26,669 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:54:26,669 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077663868] [2019-11-15 23:54:26,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:54:26,669 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:26,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:54:26,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:54:26,670 INFO L87 Difference]: Start difference. First operand 10624 states and 32590 transitions. Second operand 6 states. [2019-11-15 23:54:27,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:27,047 INFO L93 Difference]: Finished difference Result 13181 states and 39871 transitions. [2019-11-15 23:54:27,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:54:27,047 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-11-15 23:54:27,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:54:27,064 INFO L225 Difference]: With dead ends: 13181 [2019-11-15 23:54:27,064 INFO L226 Difference]: Without dead ends: 13118 [2019-11-15 23:54:27,064 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:54:27,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13118 states. [2019-11-15 23:54:27,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13118 to 11047. [2019-11-15 23:54:27,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11047 states. [2019-11-15 23:54:27,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11047 states to 11047 states and 33784 transitions. [2019-11-15 23:54:27,217 INFO L78 Accepts]: Start accepts. Automaton has 11047 states and 33784 transitions. Word has length 52 [2019-11-15 23:54:27,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:54:27,217 INFO L462 AbstractCegarLoop]: Abstraction has 11047 states and 33784 transitions. [2019-11-15 23:54:27,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:54:27,218 INFO L276 IsEmpty]: Start isEmpty. Operand 11047 states and 33784 transitions. [2019-11-15 23:54:27,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-15 23:54:27,221 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:54:27,221 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] [2019-11-15 23:54:27,221 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:54:27,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:27,221 INFO L82 PathProgramCache]: Analyzing trace with hash -257891193, now seen corresponding path program 1 times [2019-11-15 23:54:27,221 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:27,222 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852091544] [2019-11-15 23:54:27,222 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:27,222 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:27,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:27,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:27,296 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 23:54:27,296 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852091544] [2019-11-15 23:54:27,296 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:54:27,296 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:54:27,296 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986613833] [2019-11-15 23:54:27,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:54:27,297 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:27,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:54:27,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:54:27,297 INFO L87 Difference]: Start difference. First operand 11047 states and 33784 transitions. Second operand 4 states. [2019-11-15 23:54:27,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:27,447 INFO L93 Difference]: Finished difference Result 12861 states and 39390 transitions. [2019-11-15 23:54:27,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:54:27,447 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-11-15 23:54:27,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:54:27,464 INFO L225 Difference]: With dead ends: 12861 [2019-11-15 23:54:27,464 INFO L226 Difference]: Without dead ends: 12861 [2019-11-15 23:54:27,464 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 23:54:27,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12861 states. [2019-11-15 23:54:28,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12861 to 11692. [2019-11-15 23:54:28,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11692 states. [2019-11-15 23:54:28,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11692 states to 11692 states and 35761 transitions. [2019-11-15 23:54:28,093 INFO L78 Accepts]: Start accepts. Automaton has 11692 states and 35761 transitions. Word has length 60 [2019-11-15 23:54:28,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:54:28,093 INFO L462 AbstractCegarLoop]: Abstraction has 11692 states and 35761 transitions. [2019-11-15 23:54:28,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:54:28,093 INFO L276 IsEmpty]: Start isEmpty. Operand 11692 states and 35761 transitions. [2019-11-15 23:54:28,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-15 23:54:28,096 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:54:28,096 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] [2019-11-15 23:54:28,097 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:54:28,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:28,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1484919142, now seen corresponding path program 1 times [2019-11-15 23:54:28,097 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:28,097 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240427083] [2019-11-15 23:54:28,098 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:28,098 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:28,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:28,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:28,251 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 23:54:28,252 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240427083] [2019-11-15 23:54:28,253 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:54:28,253 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:54:28,254 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060671551] [2019-11-15 23:54:28,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:54:28,254 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:28,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:54:28,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:54:28,255 INFO L87 Difference]: Start difference. First operand 11692 states and 35761 transitions. Second operand 6 states. [2019-11-15 23:54:28,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:28,608 INFO L93 Difference]: Finished difference Result 14218 states and 42859 transitions. [2019-11-15 23:54:28,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:54:28,609 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-11-15 23:54:28,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:54:28,626 INFO L225 Difference]: With dead ends: 14218 [2019-11-15 23:54:28,627 INFO L226 Difference]: Without dead ends: 14157 [2019-11-15 23:54:28,627 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:54:28,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14157 states. [2019-11-15 23:54:28,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14157 to 13460. [2019-11-15 23:54:28,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13460 states. [2019-11-15 23:54:28,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13460 states to 13460 states and 40778 transitions. [2019-11-15 23:54:28,792 INFO L78 Accepts]: Start accepts. Automaton has 13460 states and 40778 transitions. Word has length 60 [2019-11-15 23:54:28,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:54:28,792 INFO L462 AbstractCegarLoop]: Abstraction has 13460 states and 40778 transitions. [2019-11-15 23:54:28,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:54:28,792 INFO L276 IsEmpty]: Start isEmpty. Operand 13460 states and 40778 transitions. [2019-11-15 23:54:28,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-15 23:54:28,797 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:54:28,797 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] [2019-11-15 23:54:28,798 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:54:28,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:28,798 INFO L82 PathProgramCache]: Analyzing trace with hash -266986464, now seen corresponding path program 1 times [2019-11-15 23:54:28,798 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:28,798 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32225188] [2019-11-15 23:54:28,799 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:28,799 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:28,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:28,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:28,856 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 23:54:28,856 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32225188] [2019-11-15 23:54:28,857 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:54:28,857 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:54:28,857 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100516893] [2019-11-15 23:54:28,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:54:28,857 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:28,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:54:28,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:54:28,858 INFO L87 Difference]: Start difference. First operand 13460 states and 40778 transitions. Second operand 4 states. [2019-11-15 23:54:29,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:29,120 INFO L93 Difference]: Finished difference Result 16502 states and 49370 transitions. [2019-11-15 23:54:29,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:54:29,120 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-11-15 23:54:29,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:54:29,141 INFO L225 Difference]: With dead ends: 16502 [2019-11-15 23:54:29,141 INFO L226 Difference]: Without dead ends: 16502 [2019-11-15 23:54:29,141 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 23:54:29,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16502 states. [2019-11-15 23:54:29,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16502 to 14981. [2019-11-15 23:54:29,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14981 states. [2019-11-15 23:54:29,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14981 states to 14981 states and 44959 transitions. [2019-11-15 23:54:29,326 INFO L78 Accepts]: Start accepts. Automaton has 14981 states and 44959 transitions. Word has length 64 [2019-11-15 23:54:29,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:54:29,327 INFO L462 AbstractCegarLoop]: Abstraction has 14981 states and 44959 transitions. [2019-11-15 23:54:29,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:54:29,327 INFO L276 IsEmpty]: Start isEmpty. Operand 14981 states and 44959 transitions. [2019-11-15 23:54:29,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-15 23:54:29,333 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:54:29,333 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] [2019-11-15 23:54:29,333 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:54:29,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:29,334 INFO L82 PathProgramCache]: Analyzing trace with hash 694627553, now seen corresponding path program 1 times [2019-11-15 23:54:29,334 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:29,334 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827480121] [2019-11-15 23:54:29,334 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:29,334 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:29,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:29,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:29,376 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 23:54:29,376 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827480121] [2019-11-15 23:54:29,376 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:54:29,376 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:54:29,376 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697661824] [2019-11-15 23:54:29,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:54:29,377 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:29,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:54:29,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:54:29,377 INFO L87 Difference]: Start difference. First operand 14981 states and 44959 transitions. Second operand 3 states. [2019-11-15 23:54:29,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:29,638 INFO L93 Difference]: Finished difference Result 15529 states and 46402 transitions. [2019-11-15 23:54:29,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:54:29,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-11-15 23:54:29,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:54:29,664 INFO L225 Difference]: With dead ends: 15529 [2019-11-15 23:54:29,664 INFO L226 Difference]: Without dead ends: 15529 [2019-11-15 23:54:29,665 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 23:54:29,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15529 states. [2019-11-15 23:54:29,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15529 to 15275. [2019-11-15 23:54:29,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15275 states. [2019-11-15 23:54:29,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15275 states to 15275 states and 45727 transitions. [2019-11-15 23:54:29,862 INFO L78 Accepts]: Start accepts. Automaton has 15275 states and 45727 transitions. Word has length 64 [2019-11-15 23:54:29,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:54:29,862 INFO L462 AbstractCegarLoop]: Abstraction has 15275 states and 45727 transitions. [2019-11-15 23:54:29,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:54:29,862 INFO L276 IsEmpty]: Start isEmpty. Operand 15275 states and 45727 transitions. [2019-11-15 23:54:29,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 23:54:29,869 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:54:29,870 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 23:54:29,870 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:54:29,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:29,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1438396840, now seen corresponding path program 1 times [2019-11-15 23:54:29,870 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:29,870 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283704178] [2019-11-15 23:54:29,870 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:29,870 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:29,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:29,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:29,959 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 23:54:29,959 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283704178] [2019-11-15 23:54:29,959 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:54:29,959 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:54:29,960 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368631591] [2019-11-15 23:54:29,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:54:29,960 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:29,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:54:29,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:54:29,961 INFO L87 Difference]: Start difference. First operand 15275 states and 45727 transitions. Second operand 6 states. [2019-11-15 23:54:30,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:30,662 INFO L93 Difference]: Finished difference Result 16272 states and 48102 transitions. [2019-11-15 23:54:30,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:54:30,662 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-11-15 23:54:30,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:54:30,689 INFO L225 Difference]: With dead ends: 16272 [2019-11-15 23:54:30,689 INFO L226 Difference]: Without dead ends: 16272 [2019-11-15 23:54:30,691 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 23:54:30,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16272 states. [2019-11-15 23:54:30,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16272 to 15848. [2019-11-15 23:54:30,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15848 states. [2019-11-15 23:54:30,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15848 states to 15848 states and 47024 transitions. [2019-11-15 23:54:30,920 INFO L78 Accepts]: Start accepts. Automaton has 15848 states and 47024 transitions. Word has length 66 [2019-11-15 23:54:30,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:54:30,920 INFO L462 AbstractCegarLoop]: Abstraction has 15848 states and 47024 transitions. [2019-11-15 23:54:30,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:54:30,921 INFO L276 IsEmpty]: Start isEmpty. Operand 15848 states and 47024 transitions. [2019-11-15 23:54:30,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 23:54:30,929 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:54:30,929 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 23:54:30,929 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:54:30,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:30,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1894956439, now seen corresponding path program 1 times [2019-11-15 23:54:30,929 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:30,930 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124058677] [2019-11-15 23:54:30,930 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:30,930 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:30,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:30,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:31,036 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 23:54:31,037 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124058677] [2019-11-15 23:54:31,037 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:54:31,037 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:54:31,037 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288655778] [2019-11-15 23:54:31,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:54:31,038 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:31,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:54:31,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:54:31,038 INFO L87 Difference]: Start difference. First operand 15848 states and 47024 transitions. Second operand 6 states. [2019-11-15 23:54:31,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:31,510 INFO L93 Difference]: Finished difference Result 18159 states and 52352 transitions. [2019-11-15 23:54:31,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:54:31,511 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-11-15 23:54:31,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:54:31,532 INFO L225 Difference]: With dead ends: 18159 [2019-11-15 23:54:31,532 INFO L226 Difference]: Without dead ends: 18159 [2019-11-15 23:54:31,533 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:54:31,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18159 states. [2019-11-15 23:54:31,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18159 to 16540. [2019-11-15 23:54:31,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16540 states. [2019-11-15 23:54:31,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16540 states to 16540 states and 48244 transitions. [2019-11-15 23:54:31,732 INFO L78 Accepts]: Start accepts. Automaton has 16540 states and 48244 transitions. Word has length 66 [2019-11-15 23:54:31,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:54:31,732 INFO L462 AbstractCegarLoop]: Abstraction has 16540 states and 48244 transitions. [2019-11-15 23:54:31,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:54:31,732 INFO L276 IsEmpty]: Start isEmpty. Operand 16540 states and 48244 transitions. [2019-11-15 23:54:31,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 23:54:31,740 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:54:31,741 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 23:54:31,741 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:54:31,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:31,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1683605526, now seen corresponding path program 1 times [2019-11-15 23:54:31,741 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:31,741 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697155876] [2019-11-15 23:54:31,741 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:31,741 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:31,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:31,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:31,823 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 23:54:31,823 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697155876] [2019-11-15 23:54:31,823 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:54:31,823 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:54:31,823 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839167070] [2019-11-15 23:54:31,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:54:31,824 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:31,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:54:31,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:54:31,824 INFO L87 Difference]: Start difference. First operand 16540 states and 48244 transitions. Second operand 5 states. [2019-11-15 23:54:32,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:32,194 INFO L93 Difference]: Finished difference Result 21454 states and 62484 transitions. [2019-11-15 23:54:32,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:54:32,194 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-11-15 23:54:32,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:54:32,220 INFO L225 Difference]: With dead ends: 21454 [2019-11-15 23:54:32,220 INFO L226 Difference]: Without dead ends: 21454 [2019-11-15 23:54:32,220 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:54:32,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21454 states. [2019-11-15 23:54:32,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21454 to 19519. [2019-11-15 23:54:32,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19519 states. [2019-11-15 23:54:32,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19519 states to 19519 states and 56653 transitions. [2019-11-15 23:54:32,512 INFO L78 Accepts]: Start accepts. Automaton has 19519 states and 56653 transitions. Word has length 66 [2019-11-15 23:54:32,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:54:32,512 INFO L462 AbstractCegarLoop]: Abstraction has 19519 states and 56653 transitions. [2019-11-15 23:54:32,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:54:32,512 INFO L276 IsEmpty]: Start isEmpty. Operand 19519 states and 56653 transitions. [2019-11-15 23:54:32,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 23:54:32,525 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:54:32,526 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 23:54:32,526 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:54:32,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:32,526 INFO L82 PathProgramCache]: Analyzing trace with hash 2100827593, now seen corresponding path program 1 times [2019-11-15 23:54:32,526 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:32,526 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710422080] [2019-11-15 23:54:32,526 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:32,527 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:32,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:32,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:32,603 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 23:54:32,607 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710422080] [2019-11-15 23:54:32,608 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:54:32,611 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:54:32,611 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538344461] [2019-11-15 23:54:32,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:54:32,612 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:32,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:54:32,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:54:32,613 INFO L87 Difference]: Start difference. First operand 19519 states and 56653 transitions. Second operand 4 states. [2019-11-15 23:54:33,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:33,465 INFO L93 Difference]: Finished difference Result 25534 states and 74547 transitions. [2019-11-15 23:54:33,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:54:33,465 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-15 23:54:33,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:54:33,499 INFO L225 Difference]: With dead ends: 25534 [2019-11-15 23:54:33,499 INFO L226 Difference]: Without dead ends: 25399 [2019-11-15 23:54:33,499 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 23:54:33,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25399 states. [2019-11-15 23:54:33,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25399 to 23515. [2019-11-15 23:54:33,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23515 states. [2019-11-15 23:54:33,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23515 states to 23515 states and 68665 transitions. [2019-11-15 23:54:33,787 INFO L78 Accepts]: Start accepts. Automaton has 23515 states and 68665 transitions. Word has length 66 [2019-11-15 23:54:33,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:54:33,787 INFO L462 AbstractCegarLoop]: Abstraction has 23515 states and 68665 transitions. [2019-11-15 23:54:33,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:54:33,788 INFO L276 IsEmpty]: Start isEmpty. Operand 23515 states and 68665 transitions. [2019-11-15 23:54:33,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 23:54:33,797 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:54:33,797 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 23:54:33,798 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:54:33,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:33,798 INFO L82 PathProgramCache]: Analyzing trace with hash -386685240, now seen corresponding path program 1 times [2019-11-15 23:54:33,798 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:33,799 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527006182] [2019-11-15 23:54:33,799 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:33,799 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:33,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:33,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:33,872 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 23:54:33,872 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527006182] [2019-11-15 23:54:33,872 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:54:33,872 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:54:33,872 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433293884] [2019-11-15 23:54:33,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:54:33,873 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:33,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:54:33,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:54:33,873 INFO L87 Difference]: Start difference. First operand 23515 states and 68665 transitions. Second operand 5 states. [2019-11-15 23:54:34,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:34,384 INFO L93 Difference]: Finished difference Result 31866 states and 92305 transitions. [2019-11-15 23:54:34,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:54:34,385 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-11-15 23:54:34,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:54:34,426 INFO L225 Difference]: With dead ends: 31866 [2019-11-15 23:54:34,426 INFO L226 Difference]: Without dead ends: 31746 [2019-11-15 23:54:34,426 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 23:54:34,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31746 states. [2019-11-15 23:54:34,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31746 to 25844. [2019-11-15 23:54:34,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25844 states. [2019-11-15 23:54:34,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25844 states to 25844 states and 75187 transitions. [2019-11-15 23:54:34,778 INFO L78 Accepts]: Start accepts. Automaton has 25844 states and 75187 transitions. Word has length 66 [2019-11-15 23:54:34,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:54:34,778 INFO L462 AbstractCegarLoop]: Abstraction has 25844 states and 75187 transitions. [2019-11-15 23:54:34,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:54:34,779 INFO L276 IsEmpty]: Start isEmpty. Operand 25844 states and 75187 transitions. [2019-11-15 23:54:34,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 23:54:34,786 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:54:34,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] [2019-11-15 23:54:34,786 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:54:34,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:34,787 INFO L82 PathProgramCache]: Analyzing trace with hash 303876234, now seen corresponding path program 1 times [2019-11-15 23:54:34,787 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:34,787 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492808624] [2019-11-15 23:54:34,787 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:34,787 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:34,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:34,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:34,864 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 23:54:34,864 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492808624] [2019-11-15 23:54:34,864 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:54:34,864 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:54:34,864 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862831253] [2019-11-15 23:54:34,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:54:34,865 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:34,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:54:34,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:54:34,865 INFO L87 Difference]: Start difference. First operand 25844 states and 75187 transitions. Second operand 5 states. [2019-11-15 23:54:34,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:34,926 INFO L93 Difference]: Finished difference Result 7421 states and 17524 transitions. [2019-11-15 23:54:34,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:54:34,927 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-11-15 23:54:34,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:54:34,932 INFO L225 Difference]: With dead ends: 7421 [2019-11-15 23:54:34,932 INFO L226 Difference]: Without dead ends: 6230 [2019-11-15 23:54:34,932 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 23:54:34,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6230 states. [2019-11-15 23:54:34,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6230 to 5260. [2019-11-15 23:54:34,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5260 states. [2019-11-15 23:54:34,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5260 states to 5260 states and 12120 transitions. [2019-11-15 23:54:34,985 INFO L78 Accepts]: Start accepts. Automaton has 5260 states and 12120 transitions. Word has length 66 [2019-11-15 23:54:34,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:54:34,985 INFO L462 AbstractCegarLoop]: Abstraction has 5260 states and 12120 transitions. [2019-11-15 23:54:34,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:54:34,985 INFO L276 IsEmpty]: Start isEmpty. Operand 5260 states and 12120 transitions. [2019-11-15 23:54:34,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 23:54:34,988 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:54:34,988 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 23:54:34,989 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:54:34,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:34,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1738873321, now seen corresponding path program 1 times [2019-11-15 23:54:34,989 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:34,989 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703945531] [2019-11-15 23:54:34,989 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:34,989 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:34,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:34,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:35,022 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 23:54:35,022 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703945531] [2019-11-15 23:54:35,022 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:54:35,022 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:54:35,022 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596701725] [2019-11-15 23:54:35,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:54:35,023 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:35,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:54:35,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:54:35,023 INFO L87 Difference]: Start difference. First operand 5260 states and 12120 transitions. Second operand 3 states. [2019-11-15 23:54:35,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:35,063 INFO L93 Difference]: Finished difference Result 6917 states and 15769 transitions. [2019-11-15 23:54:35,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:54:35,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-15 23:54:35,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:54:35,071 INFO L225 Difference]: With dead ends: 6917 [2019-11-15 23:54:35,072 INFO L226 Difference]: Without dead ends: 6917 [2019-11-15 23:54:35,072 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 23:54:35,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6917 states. [2019-11-15 23:54:35,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6917 to 5195. [2019-11-15 23:54:35,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5195 states. [2019-11-15 23:54:35,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5195 states to 5195 states and 11682 transitions. [2019-11-15 23:54:35,148 INFO L78 Accepts]: Start accepts. Automaton has 5195 states and 11682 transitions. Word has length 66 [2019-11-15 23:54:35,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:54:35,149 INFO L462 AbstractCegarLoop]: Abstraction has 5195 states and 11682 transitions. [2019-11-15 23:54:35,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:54:35,149 INFO L276 IsEmpty]: Start isEmpty. Operand 5195 states and 11682 transitions. [2019-11-15 23:54:35,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-15 23:54:35,154 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:54:35,154 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] [2019-11-15 23:54:35,154 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:54:35,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:35,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1014352042, now seen corresponding path program 1 times [2019-11-15 23:54:35,155 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:35,155 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216562067] [2019-11-15 23:54:35,155 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:35,155 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:35,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:35,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:35,230 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 23:54:35,230 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216562067] [2019-11-15 23:54:35,230 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:54:35,231 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:54:35,231 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493748333] [2019-11-15 23:54:35,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:54:35,232 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:35,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:54:35,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:54:35,232 INFO L87 Difference]: Start difference. First operand 5195 states and 11682 transitions. Second operand 5 states. [2019-11-15 23:54:35,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:35,435 INFO L93 Difference]: Finished difference Result 6272 states and 14147 transitions. [2019-11-15 23:54:35,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:54:35,437 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-11-15 23:54:35,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:54:35,442 INFO L225 Difference]: With dead ends: 6272 [2019-11-15 23:54:35,442 INFO L226 Difference]: Without dead ends: 6272 [2019-11-15 23:54:35,442 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:54:35,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6272 states. [2019-11-15 23:54:35,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6272 to 5615. [2019-11-15 23:54:35,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5615 states. [2019-11-15 23:54:35,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5615 states to 5615 states and 12640 transitions. [2019-11-15 23:54:35,492 INFO L78 Accepts]: Start accepts. Automaton has 5615 states and 12640 transitions. Word has length 72 [2019-11-15 23:54:35,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:54:35,492 INFO L462 AbstractCegarLoop]: Abstraction has 5615 states and 12640 transitions. [2019-11-15 23:54:35,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:54:35,492 INFO L276 IsEmpty]: Start isEmpty. Operand 5615 states and 12640 transitions. [2019-11-15 23:54:35,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-15 23:54:35,496 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:54:35,496 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] [2019-11-15 23:54:35,497 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:54:35,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:35,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1537804919, now seen corresponding path program 1 times [2019-11-15 23:54:35,497 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:35,497 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548562097] [2019-11-15 23:54:35,497 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:35,498 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:35,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:35,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:35,570 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 23:54:35,571 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548562097] [2019-11-15 23:54:35,571 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:54:35,571 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:54:35,571 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712234612] [2019-11-15 23:54:35,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:54:35,572 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:35,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:54:35,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:54:35,573 INFO L87 Difference]: Start difference. First operand 5615 states and 12640 transitions. Second operand 7 states. [2019-11-15 23:54:35,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:35,944 INFO L93 Difference]: Finished difference Result 6482 states and 14450 transitions. [2019-11-15 23:54:35,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 23:54:35,944 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2019-11-15 23:54:35,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:54:35,949 INFO L225 Difference]: With dead ends: 6482 [2019-11-15 23:54:35,949 INFO L226 Difference]: Without dead ends: 6429 [2019-11-15 23:54:35,950 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-11-15 23:54:35,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6429 states. [2019-11-15 23:54:35,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6429 to 5702. [2019-11-15 23:54:35,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5702 states. [2019-11-15 23:54:36,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5702 states to 5702 states and 12729 transitions. [2019-11-15 23:54:36,002 INFO L78 Accepts]: Start accepts. Automaton has 5702 states and 12729 transitions. Word has length 72 [2019-11-15 23:54:36,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:54:36,002 INFO L462 AbstractCegarLoop]: Abstraction has 5702 states and 12729 transitions. [2019-11-15 23:54:36,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:54:36,002 INFO L276 IsEmpty]: Start isEmpty. Operand 5702 states and 12729 transitions. [2019-11-15 23:54:36,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-15 23:54:36,007 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:54:36,007 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, 1, 1, 1, 1] [2019-11-15 23:54:36,007 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:54:36,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:36,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1478631387, now seen corresponding path program 1 times [2019-11-15 23:54:36,008 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:36,008 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441215311] [2019-11-15 23:54:36,008 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:36,008 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:36,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:36,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:36,045 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 23:54:36,045 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441215311] [2019-11-15 23:54:36,046 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:54:36,046 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:54:36,046 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994896502] [2019-11-15 23:54:36,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:54:36,047 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:36,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:54:36,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:54:36,047 INFO L87 Difference]: Start difference. First operand 5702 states and 12729 transitions. Second operand 3 states. [2019-11-15 23:54:36,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:36,232 INFO L93 Difference]: Finished difference Result 7168 states and 15786 transitions. [2019-11-15 23:54:36,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:54:36,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2019-11-15 23:54:36,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:54:36,240 INFO L225 Difference]: With dead ends: 7168 [2019-11-15 23:54:36,240 INFO L226 Difference]: Without dead ends: 7168 [2019-11-15 23:54:36,240 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 23:54:36,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7168 states. [2019-11-15 23:54:36,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7168 to 6671. [2019-11-15 23:54:36,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6671 states. [2019-11-15 23:54:36,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6671 states to 6671 states and 14733 transitions. [2019-11-15 23:54:36,332 INFO L78 Accepts]: Start accepts. Automaton has 6671 states and 14733 transitions. Word has length 91 [2019-11-15 23:54:36,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:54:36,332 INFO L462 AbstractCegarLoop]: Abstraction has 6671 states and 14733 transitions. [2019-11-15 23:54:36,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:54:36,333 INFO L276 IsEmpty]: Start isEmpty. Operand 6671 states and 14733 transitions. [2019-11-15 23:54:36,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-15 23:54:36,340 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:54:36,340 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, 1, 1, 1, 1] [2019-11-15 23:54:36,340 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:54:36,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:36,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1740641607, now seen corresponding path program 2 times [2019-11-15 23:54:36,341 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:36,341 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376197161] [2019-11-15 23:54:36,341 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:36,341 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:36,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:36,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:36,408 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 23:54:36,409 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376197161] [2019-11-15 23:54:36,409 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:54:36,409 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:54:36,409 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689019942] [2019-11-15 23:54:36,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:54:36,410 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:36,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:54:36,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:54:36,410 INFO L87 Difference]: Start difference. First operand 6671 states and 14733 transitions. Second operand 4 states. [2019-11-15 23:54:36,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:36,508 INFO L93 Difference]: Finished difference Result 7148 states and 15815 transitions. [2019-11-15 23:54:36,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:54:36,509 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-11-15 23:54:36,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:54:36,514 INFO L225 Difference]: With dead ends: 7148 [2019-11-15 23:54:36,514 INFO L226 Difference]: Without dead ends: 7148 [2019-11-15 23:54:36,514 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:54:36,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7148 states. [2019-11-15 23:54:36,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7148 to 6569. [2019-11-15 23:54:36,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6569 states. [2019-11-15 23:54:36,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6569 states to 6569 states and 14589 transitions. [2019-11-15 23:54:36,574 INFO L78 Accepts]: Start accepts. Automaton has 6569 states and 14589 transitions. Word has length 91 [2019-11-15 23:54:36,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:54:36,575 INFO L462 AbstractCegarLoop]: Abstraction has 6569 states and 14589 transitions. [2019-11-15 23:54:36,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:54:36,575 INFO L276 IsEmpty]: Start isEmpty. Operand 6569 states and 14589 transitions. [2019-11-15 23:54:36,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-15 23:54:36,581 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:54:36,582 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, 1, 1, 1, 1, 1, 1] [2019-11-15 23:54:36,582 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:54:36,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:36,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1425461951, now seen corresponding path program 1 times [2019-11-15 23:54:36,583 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:36,583 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118978460] [2019-11-15 23:54:36,583 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:36,583 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:36,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:36,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:36,651 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 23:54:36,652 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118978460] [2019-11-15 23:54:36,652 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:54:36,652 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:54:36,652 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819935551] [2019-11-15 23:54:36,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:54:36,653 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:36,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:54:36,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:54:36,654 INFO L87 Difference]: Start difference. First operand 6569 states and 14589 transitions. Second operand 5 states. [2019-11-15 23:54:36,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:36,751 INFO L93 Difference]: Finished difference Result 7354 states and 16297 transitions. [2019-11-15 23:54:36,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:54:36,752 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-11-15 23:54:36,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:54:36,757 INFO L225 Difference]: With dead ends: 7354 [2019-11-15 23:54:36,758 INFO L226 Difference]: Without dead ends: 7354 [2019-11-15 23:54:36,759 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:54:36,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7354 states. [2019-11-15 23:54:36,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7354 to 5616. [2019-11-15 23:54:36,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5616 states. [2019-11-15 23:54:36,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5616 states to 5616 states and 12481 transitions. [2019-11-15 23:54:36,814 INFO L78 Accepts]: Start accepts. Automaton has 5616 states and 12481 transitions. Word has length 93 [2019-11-15 23:54:36,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:54:36,814 INFO L462 AbstractCegarLoop]: Abstraction has 5616 states and 12481 transitions. [2019-11-15 23:54:36,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:54:36,814 INFO L276 IsEmpty]: Start isEmpty. Operand 5616 states and 12481 transitions. [2019-11-15 23:54:36,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-15 23:54:36,820 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:54:36,820 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, 1, 1, 1, 1, 1, 1] [2019-11-15 23:54:36,820 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:54:36,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:36,821 INFO L82 PathProgramCache]: Analyzing trace with hash -758214976, now seen corresponding path program 1 times [2019-11-15 23:54:36,821 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:36,821 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908240402] [2019-11-15 23:54:36,821 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:36,821 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:36,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:36,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:36,883 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 23:54:36,883 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908240402] [2019-11-15 23:54:36,883 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:54:36,884 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:54:36,884 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856682084] [2019-11-15 23:54:36,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:54:36,884 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:36,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:54:36,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:54:36,885 INFO L87 Difference]: Start difference. First operand 5616 states and 12481 transitions. Second operand 5 states. [2019-11-15 23:54:37,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:37,456 INFO L93 Difference]: Finished difference Result 8936 states and 19961 transitions. [2019-11-15 23:54:37,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:54:37,456 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-11-15 23:54:37,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:54:37,465 INFO L225 Difference]: With dead ends: 8936 [2019-11-15 23:54:37,466 INFO L226 Difference]: Without dead ends: 8922 [2019-11-15 23:54:37,466 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:54:37,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8922 states. [2019-11-15 23:54:37,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8922 to 6544. [2019-11-15 23:54:37,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6544 states. [2019-11-15 23:54:37,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6544 states to 6544 states and 14625 transitions. [2019-11-15 23:54:37,565 INFO L78 Accepts]: Start accepts. Automaton has 6544 states and 14625 transitions. Word has length 93 [2019-11-15 23:54:37,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:54:37,566 INFO L462 AbstractCegarLoop]: Abstraction has 6544 states and 14625 transitions. [2019-11-15 23:54:37,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:54:37,566 INFO L276 IsEmpty]: Start isEmpty. Operand 6544 states and 14625 transitions. [2019-11-15 23:54:37,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-15 23:54:37,573 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:54:37,573 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, 1, 1, 1, 1, 1, 1] [2019-11-15 23:54:37,573 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:54:37,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:37,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1012951521, now seen corresponding path program 1 times [2019-11-15 23:54:37,574 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:37,574 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685079628] [2019-11-15 23:54:37,574 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:37,574 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:37,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:37,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:37,649 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 23:54:37,650 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685079628] [2019-11-15 23:54:37,650 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:54:37,650 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:54:37,650 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641591263] [2019-11-15 23:54:37,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:54:37,652 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:37,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:54:37,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:54:37,652 INFO L87 Difference]: Start difference. First operand 6544 states and 14625 transitions. Second operand 6 states. [2019-11-15 23:54:38,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:38,053 INFO L93 Difference]: Finished difference Result 8204 states and 18217 transitions. [2019-11-15 23:54:38,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 23:54:38,053 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-11-15 23:54:38,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:54:38,059 INFO L225 Difference]: With dead ends: 8204 [2019-11-15 23:54:38,059 INFO L226 Difference]: Without dead ends: 8204 [2019-11-15 23:54:38,060 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:54:38,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8204 states. [2019-11-15 23:54:38,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8204 to 6134. [2019-11-15 23:54:38,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6134 states. [2019-11-15 23:54:38,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6134 states to 6134 states and 13775 transitions. [2019-11-15 23:54:38,123 INFO L78 Accepts]: Start accepts. Automaton has 6134 states and 13775 transitions. Word has length 93 [2019-11-15 23:54:38,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:54:38,124 INFO L462 AbstractCegarLoop]: Abstraction has 6134 states and 13775 transitions. [2019-11-15 23:54:38,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:54:38,124 INFO L276 IsEmpty]: Start isEmpty. Operand 6134 states and 13775 transitions. [2019-11-15 23:54:38,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-15 23:54:38,128 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:54:38,128 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, 1, 1, 1, 1, 1, 1] [2019-11-15 23:54:38,128 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:54:38,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:38,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1822644433, now seen corresponding path program 2 times [2019-11-15 23:54:38,129 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:38,129 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421266136] [2019-11-15 23:54:38,129 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:38,129 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:38,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:38,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:38,231 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 23:54:38,232 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421266136] [2019-11-15 23:54:38,232 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:54:38,232 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:54:38,232 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547452928] [2019-11-15 23:54:38,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:54:38,233 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:38,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:54:38,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:54:38,234 INFO L87 Difference]: Start difference. First operand 6134 states and 13775 transitions. Second operand 6 states. [2019-11-15 23:54:38,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:38,584 INFO L93 Difference]: Finished difference Result 7721 states and 17275 transitions. [2019-11-15 23:54:38,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:54:38,585 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-11-15 23:54:38,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:54:38,593 INFO L225 Difference]: With dead ends: 7721 [2019-11-15 23:54:38,593 INFO L226 Difference]: Without dead ends: 7703 [2019-11-15 23:54:38,593 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:54:38,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7703 states. [2019-11-15 23:54:38,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7703 to 6311. [2019-11-15 23:54:38,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6311 states. [2019-11-15 23:54:38,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6311 states to 6311 states and 14195 transitions. [2019-11-15 23:54:38,684 INFO L78 Accepts]: Start accepts. Automaton has 6311 states and 14195 transitions. Word has length 93 [2019-11-15 23:54:38,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:54:38,684 INFO L462 AbstractCegarLoop]: Abstraction has 6311 states and 14195 transitions. [2019-11-15 23:54:38,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:54:38,685 INFO L276 IsEmpty]: Start isEmpty. Operand 6311 states and 14195 transitions. [2019-11-15 23:54:38,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-15 23:54:38,691 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:54:38,692 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, 1, 1, 1, 1, 1, 1] [2019-11-15 23:54:38,692 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:54:38,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:38,693 INFO L82 PathProgramCache]: Analyzing trace with hash 25693074, now seen corresponding path program 1 times [2019-11-15 23:54:38,693 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:38,693 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256505734] [2019-11-15 23:54:38,693 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:38,694 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:38,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:38,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:38,796 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 23:54:38,796 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256505734] [2019-11-15 23:54:38,797 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:54:38,797 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:54:38,797 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584315287] [2019-11-15 23:54:38,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:54:38,797 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:38,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:54:38,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:54:38,798 INFO L87 Difference]: Start difference. First operand 6311 states and 14195 transitions. Second operand 7 states. [2019-11-15 23:54:39,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:39,392 INFO L93 Difference]: Finished difference Result 9496 states and 21342 transitions. [2019-11-15 23:54:39,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 23:54:39,393 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-11-15 23:54:39,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:54:39,400 INFO L225 Difference]: With dead ends: 9496 [2019-11-15 23:54:39,400 INFO L226 Difference]: Without dead ends: 9496 [2019-11-15 23:54:39,400 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:54:39,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9496 states. [2019-11-15 23:54:39,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9496 to 6740. [2019-11-15 23:54:39,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6740 states. [2019-11-15 23:54:39,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6740 states to 6740 states and 15287 transitions. [2019-11-15 23:54:39,476 INFO L78 Accepts]: Start accepts. Automaton has 6740 states and 15287 transitions. Word has length 93 [2019-11-15 23:54:39,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:54:39,477 INFO L462 AbstractCegarLoop]: Abstraction has 6740 states and 15287 transitions. [2019-11-15 23:54:39,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:54:39,477 INFO L276 IsEmpty]: Start isEmpty. Operand 6740 states and 15287 transitions. [2019-11-15 23:54:39,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-15 23:54:39,482 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:54:39,482 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, 1, 1, 1, 1, 1, 1] [2019-11-15 23:54:39,482 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:54:39,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:39,482 INFO L82 PathProgramCache]: Analyzing trace with hash 913196755, now seen corresponding path program 1 times [2019-11-15 23:54:39,482 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:39,482 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832646224] [2019-11-15 23:54:39,483 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:39,483 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:39,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:39,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:39,591 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 23:54:39,591 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832646224] [2019-11-15 23:54:39,592 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:54:39,592 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:54:39,592 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492601340] [2019-11-15 23:54:39,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:54:39,593 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:39,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:54:39,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:54:39,593 INFO L87 Difference]: Start difference. First operand 6740 states and 15287 transitions. Second operand 6 states. [2019-11-15 23:54:39,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:39,654 INFO L93 Difference]: Finished difference Result 7832 states and 17477 transitions. [2019-11-15 23:54:39,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:54:39,654 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-11-15 23:54:39,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:54:39,660 INFO L225 Difference]: With dead ends: 7832 [2019-11-15 23:54:39,660 INFO L226 Difference]: Without dead ends: 7832 [2019-11-15 23:54:39,661 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 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 23:54:39,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7832 states. [2019-11-15 23:54:39,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7832 to 6493. [2019-11-15 23:54:39,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6493 states. [2019-11-15 23:54:39,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6493 states to 6493 states and 14535 transitions. [2019-11-15 23:54:39,724 INFO L78 Accepts]: Start accepts. Automaton has 6493 states and 14535 transitions. Word has length 93 [2019-11-15 23:54:39,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:54:39,724 INFO L462 AbstractCegarLoop]: Abstraction has 6493 states and 14535 transitions. [2019-11-15 23:54:39,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:54:39,724 INFO L276 IsEmpty]: Start isEmpty. Operand 6493 states and 14535 transitions. [2019-11-15 23:54:39,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-15 23:54:39,730 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:54:39,730 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, 1, 1, 1, 1, 1, 1] [2019-11-15 23:54:39,730 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:54:39,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:39,731 INFO L82 PathProgramCache]: Analyzing trace with hash -818778797, now seen corresponding path program 1 times [2019-11-15 23:54:39,731 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:39,731 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885474915] [2019-11-15 23:54:39,731 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:39,731 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:39,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:39,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:39,834 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 23:54:39,835 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885474915] [2019-11-15 23:54:39,835 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:54:39,835 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:54:39,835 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895664832] [2019-11-15 23:54:39,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:54:39,836 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:39,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:54:39,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:54:39,836 INFO L87 Difference]: Start difference. First operand 6493 states and 14535 transitions. Second operand 6 states. [2019-11-15 23:54:40,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:40,009 INFO L93 Difference]: Finished difference Result 6277 states and 13914 transitions. [2019-11-15 23:54:40,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:54:40,010 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-11-15 23:54:40,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:54:40,017 INFO L225 Difference]: With dead ends: 6277 [2019-11-15 23:54:40,017 INFO L226 Difference]: Without dead ends: 6277 [2019-11-15 23:54:40,018 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:54:40,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6277 states. [2019-11-15 23:54:40,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6277 to 5075. [2019-11-15 23:54:40,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5075 states. [2019-11-15 23:54:40,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5075 states to 5075 states and 11268 transitions. [2019-11-15 23:54:40,094 INFO L78 Accepts]: Start accepts. Automaton has 5075 states and 11268 transitions. Word has length 93 [2019-11-15 23:54:40,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:54:40,095 INFO L462 AbstractCegarLoop]: Abstraction has 5075 states and 11268 transitions. [2019-11-15 23:54:40,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:54:40,095 INFO L276 IsEmpty]: Start isEmpty. Operand 5075 states and 11268 transitions. [2019-11-15 23:54:40,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 23:54:40,100 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:54:40,101 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:54:40,101 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:54:40,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:40,101 INFO L82 PathProgramCache]: Analyzing trace with hash -281935255, now seen corresponding path program 1 times [2019-11-15 23:54:40,102 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:40,102 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428578228] [2019-11-15 23:54:40,102 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:40,102 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:40,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:40,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:40,182 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 23:54:40,182 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428578228] [2019-11-15 23:54:40,183 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:54:40,183 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:54:40,183 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926822927] [2019-11-15 23:54:40,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:54:40,184 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:40,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:54:40,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:54:40,184 INFO L87 Difference]: Start difference. First operand 5075 states and 11268 transitions. Second operand 5 states. [2019-11-15 23:54:40,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:40,627 INFO L93 Difference]: Finished difference Result 6179 states and 13636 transitions. [2019-11-15 23:54:40,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:54:40,627 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-11-15 23:54:40,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:54:40,631 INFO L225 Difference]: With dead ends: 6179 [2019-11-15 23:54:40,632 INFO L226 Difference]: Without dead ends: 6049 [2019-11-15 23:54:40,632 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:54:40,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6049 states. [2019-11-15 23:54:40,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6049 to 5222. [2019-11-15 23:54:40,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5222 states. [2019-11-15 23:54:40,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5222 states to 5222 states and 11555 transitions. [2019-11-15 23:54:40,682 INFO L78 Accepts]: Start accepts. Automaton has 5222 states and 11555 transitions. Word has length 95 [2019-11-15 23:54:40,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:54:40,682 INFO L462 AbstractCegarLoop]: Abstraction has 5222 states and 11555 transitions. [2019-11-15 23:54:40,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:54:40,682 INFO L276 IsEmpty]: Start isEmpty. Operand 5222 states and 11555 transitions. [2019-11-15 23:54:40,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 23:54:40,686 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:54:40,686 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:54:40,686 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:54:40,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:40,687 INFO L82 PathProgramCache]: Analyzing trace with hash -270619128, now seen corresponding path program 1 times [2019-11-15 23:54:40,687 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:40,687 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749893884] [2019-11-15 23:54:40,687 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:40,687 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:40,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:40,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:40,822 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 23:54:40,823 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749893884] [2019-11-15 23:54:40,823 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:54:40,823 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 23:54:40,824 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173434531] [2019-11-15 23:54:40,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:54:40,824 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:40,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:54:40,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:54:40,825 INFO L87 Difference]: Start difference. First operand 5222 states and 11555 transitions. Second operand 8 states. [2019-11-15 23:54:41,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:41,516 INFO L93 Difference]: Finished difference Result 6662 states and 14663 transitions. [2019-11-15 23:54:41,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 23:54:41,516 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2019-11-15 23:54:41,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:54:41,523 INFO L225 Difference]: With dead ends: 6662 [2019-11-15 23:54:41,524 INFO L226 Difference]: Without dead ends: 6610 [2019-11-15 23:54:41,525 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-11-15 23:54:41,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6610 states. [2019-11-15 23:54:41,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6610 to 5599. [2019-11-15 23:54:41,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5599 states. [2019-11-15 23:54:41,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5599 states to 5599 states and 12418 transitions. [2019-11-15 23:54:41,606 INFO L78 Accepts]: Start accepts. Automaton has 5599 states and 12418 transitions. Word has length 95 [2019-11-15 23:54:41,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:54:41,606 INFO L462 AbstractCegarLoop]: Abstraction has 5599 states and 12418 transitions. [2019-11-15 23:54:41,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:54:41,606 INFO L276 IsEmpty]: Start isEmpty. Operand 5599 states and 12418 transitions. [2019-11-15 23:54:41,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 23:54:41,613 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:54:41,613 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:54:41,613 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:54:41,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:41,614 INFO L82 PathProgramCache]: Analyzing trace with hash -239599321, now seen corresponding path program 1 times [2019-11-15 23:54:41,614 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:41,614 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974859918] [2019-11-15 23:54:41,614 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:41,614 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:41,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:41,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:41,732 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 23:54:41,732 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974859918] [2019-11-15 23:54:41,733 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:54:41,733 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:54:41,733 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070216320] [2019-11-15 23:54:41,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:54:41,734 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:41,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:54:41,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:54:41,734 INFO L87 Difference]: Start difference. First operand 5599 states and 12418 transitions. Second operand 6 states. [2019-11-15 23:54:41,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:41,983 INFO L93 Difference]: Finished difference Result 6107 states and 13437 transitions. [2019-11-15 23:54:41,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:54:41,983 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-11-15 23:54:41,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:54:41,989 INFO L225 Difference]: With dead ends: 6107 [2019-11-15 23:54:41,989 INFO L226 Difference]: Without dead ends: 6107 [2019-11-15 23:54:41,991 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 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 23:54:42,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6107 states. [2019-11-15 23:54:42,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6107 to 5553. [2019-11-15 23:54:42,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5553 states. [2019-11-15 23:54:42,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5553 states to 5553 states and 12324 transitions. [2019-11-15 23:54:42,063 INFO L78 Accepts]: Start accepts. Automaton has 5553 states and 12324 transitions. Word has length 95 [2019-11-15 23:54:42,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:54:42,063 INFO L462 AbstractCegarLoop]: Abstraction has 5553 states and 12324 transitions. [2019-11-15 23:54:42,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:54:42,063 INFO L276 IsEmpty]: Start isEmpty. Operand 5553 states and 12324 transitions. [2019-11-15 23:54:42,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 23:54:42,069 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:54:42,070 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:54:42,070 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:54:42,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:42,070 INFO L82 PathProgramCache]: Analyzing trace with hash -219261946, now seen corresponding path program 1 times [2019-11-15 23:54:42,070 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:42,071 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934359055] [2019-11-15 23:54:42,071 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:42,071 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:42,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:42,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:42,182 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 23:54:42,182 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934359055] [2019-11-15 23:54:42,183 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:54:42,183 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:54:42,183 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382298644] [2019-11-15 23:54:42,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:54:42,184 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:42,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:54:42,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:54:42,184 INFO L87 Difference]: Start difference. First operand 5553 states and 12324 transitions. Second operand 5 states. [2019-11-15 23:54:42,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:42,231 INFO L93 Difference]: Finished difference Result 5553 states and 12315 transitions. [2019-11-15 23:54:42,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:54:42,232 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-11-15 23:54:42,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:54:42,237 INFO L225 Difference]: With dead ends: 5553 [2019-11-15 23:54:42,237 INFO L226 Difference]: Without dead ends: 5553 [2019-11-15 23:54:42,238 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:54:42,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5553 states. [2019-11-15 23:54:42,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5553 to 5553. [2019-11-15 23:54:42,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5553 states. [2019-11-15 23:54:42,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5553 states to 5553 states and 12315 transitions. [2019-11-15 23:54:42,304 INFO L78 Accepts]: Start accepts. Automaton has 5553 states and 12315 transitions. Word has length 95 [2019-11-15 23:54:42,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:54:42,304 INFO L462 AbstractCegarLoop]: Abstraction has 5553 states and 12315 transitions. [2019-11-15 23:54:42,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:54:42,304 INFO L276 IsEmpty]: Start isEmpty. Operand 5553 states and 12315 transitions. [2019-11-15 23:54:42,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 23:54:42,310 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:54:42,310 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:54:42,311 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:54:42,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:42,311 INFO L82 PathProgramCache]: Analyzing trace with hash 668241735, now seen corresponding path program 1 times [2019-11-15 23:54:42,311 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:42,311 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423160383] [2019-11-15 23:54:42,312 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:42,312 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:42,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:42,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:42,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 23:54:42,469 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423160383] [2019-11-15 23:54:42,470 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:54:42,470 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 23:54:42,470 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467388431] [2019-11-15 23:54:42,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 23:54:42,470 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:42,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:54:42,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:54:42,471 INFO L87 Difference]: Start difference. First operand 5553 states and 12315 transitions. Second operand 10 states. [2019-11-15 23:54:42,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:42,986 INFO L93 Difference]: Finished difference Result 15942 states and 35873 transitions. [2019-11-15 23:54:42,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-15 23:54:42,986 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 95 [2019-11-15 23:54:42,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:54:42,998 INFO L225 Difference]: With dead ends: 15942 [2019-11-15 23:54:42,998 INFO L226 Difference]: Without dead ends: 11223 [2019-11-15 23:54:42,999 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-11-15 23:54:43,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11223 states. [2019-11-15 23:54:43,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11223 to 5577. [2019-11-15 23:54:43,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5577 states. [2019-11-15 23:54:43,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5577 states to 5577 states and 12285 transitions. [2019-11-15 23:54:43,103 INFO L78 Accepts]: Start accepts. Automaton has 5577 states and 12285 transitions. Word has length 95 [2019-11-15 23:54:43,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:54:43,104 INFO L462 AbstractCegarLoop]: Abstraction has 5577 states and 12285 transitions. [2019-11-15 23:54:43,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 23:54:43,104 INFO L276 IsEmpty]: Start isEmpty. Operand 5577 states and 12285 transitions. [2019-11-15 23:54:43,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 23:54:43,110 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:54:43,110 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:54:43,110 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:54:43,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:43,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1749651354, now seen corresponding path program 1 times [2019-11-15 23:54:43,111 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:43,111 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137782856] [2019-11-15 23:54:43,111 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:43,111 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:43,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:43,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:54:43,214 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 23:54:43,215 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137782856] [2019-11-15 23:54:43,215 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:54:43,215 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:54:43,215 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255586784] [2019-11-15 23:54:43,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:54:43,216 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:43,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:54:43,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:54:43,216 INFO L87 Difference]: Start difference. First operand 5577 states and 12285 transitions. Second operand 7 states. [2019-11-15 23:54:43,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:43,613 INFO L93 Difference]: Finished difference Result 5982 states and 13113 transitions. [2019-11-15 23:54:43,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 23:54:43,614 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-11-15 23:54:43,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:54:43,620 INFO L225 Difference]: With dead ends: 5982 [2019-11-15 23:54:43,620 INFO L226 Difference]: Without dead ends: 5982 [2019-11-15 23:54:43,621 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:54:43,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5982 states. [2019-11-15 23:54:43,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5982 to 5593. [2019-11-15 23:54:43,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5593 states. [2019-11-15 23:54:43,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5593 states to 5593 states and 12309 transitions. [2019-11-15 23:54:43,692 INFO L78 Accepts]: Start accepts. Automaton has 5593 states and 12309 transitions. Word has length 95 [2019-11-15 23:54:43,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:54:43,693 INFO L462 AbstractCegarLoop]: Abstraction has 5593 states and 12309 transitions. [2019-11-15 23:54:43,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:54:43,693 INFO L276 IsEmpty]: Start isEmpty. Operand 5593 states and 12309 transitions. [2019-11-15 23:54:43,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 23:54:43,699 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:54:43,699 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:54:43,699 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:54:43,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:54:43,699 INFO L82 PathProgramCache]: Analyzing trace with hash 2096619303, now seen corresponding path program 2 times [2019-11-15 23:54:43,700 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:54:43,700 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676902783] [2019-11-15 23:54:43,700 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:43,700 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:54:43,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:54:43,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:54:43,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:54:43,804 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:54:43,804 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 23:54:43,955 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-15 23:54:43,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:54:43 BasicIcfg [2019-11-15 23:54:43,962 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:54:43,962 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:54:43,962 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:54:43,962 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:54:43,963 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:54:03" (3/4) ... [2019-11-15 23:54:43,975 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 23:54:44,126 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_d5f26d3c-72eb-45f6-acea-916fdfa9ddb1/bin/uautomizer/witness.graphml [2019-11-15 23:54:44,126 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:54:44,128 INFO L168 Benchmark]: Toolchain (without parser) took 42628.58 ms. Allocated memory was 1.0 GB in the beginning and 4.7 GB in the end (delta: 3.7 GB). Free memory was 938.0 MB in the beginning and 2.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2019-11-15 23:54:44,128 INFO L168 Benchmark]: CDTParser took 0.23 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 23:54:44,129 INFO L168 Benchmark]: CACSL2BoogieTranslator took 645.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -168.8 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:54:44,130 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:54:44,130 INFO L168 Benchmark]: Boogie Preprocessor took 63.72 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 23:54:44,130 INFO L168 Benchmark]: RCFGBuilder took 824.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:54:44,131 INFO L168 Benchmark]: TraceAbstraction took 40852.45 ms. Allocated memory was 1.2 GB in the beginning and 4.7 GB in the end (delta: 3.6 GB). Free memory was 1.1 GB in the beginning and 2.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2019-11-15 23:54:44,131 INFO L168 Benchmark]: Witness Printer took 164.26 ms. Allocated memory is still 4.7 GB. Free memory was 2.5 GB in the beginning and 2.5 GB in the end (delta: 69.4 MB). Peak memory consumption was 69.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:54:44,133 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.23 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 645.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -168.8 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 72.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 63.72 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 824.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 40852.45 ms. Allocated memory was 1.2 GB in the beginning and 4.7 GB in the end (delta: 3.6 GB). Free memory was 1.1 GB in the beginning and 2.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. * Witness Printer took 164.26 ms. Allocated memory is still 4.7 GB. Free memory was 2.5 GB in the beginning and 2.5 GB in the end (delta: 69.4 MB). Peak memory consumption was 69.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L698] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L699] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L700] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L702] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L704] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L705] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L706] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L707] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L708] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L709] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L710] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L711] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L712] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L713] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L714] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L715] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L716] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L717] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L718] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L719] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L720] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L793] 0 pthread_t t2309; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L794] FCALL, FORK 0 pthread_create(&t2309, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] 0 pthread_t t2310; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L729] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L730] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L731] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L732] 1 y$r_buff0_thd1 = (_Bool)1 [L735] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L796] FCALL, FORK 0 pthread_create(&t2310, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 __unbuffered_p1_EAX = x [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=1, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L760] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L762] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L763] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L763] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L765] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L766] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L767] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=3, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L767] 2 y = y$flush_delayed ? y$mem_tmp : y [L768] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L771] 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L771] 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) [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L773] 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 [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] 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=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L775] 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 [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L741] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L742] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L745] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 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) [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L804] 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 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 [L805] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L805] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L806] 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 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 [L809] 0 main$tmp_guard1 = !(__unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 218 locations, 3 error locations. Result: UNSAFE, OverallTime: 40.7s, OverallIterations: 37, TraceHistogramMax: 1, AutomataDifference: 16.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9586 SDtfs, 9894 SDslu, 21115 SDs, 0 SdLazy, 7859 SolverSat, 528 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 343 GetRequests, 100 SyntacticMatches, 21 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71011occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 17.3s AutomataMinimizationTime, 36 MinimizatonAttempts, 81747 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 2732 NumberOfCodeBlocks, 2732 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 2601 ConstructedInterpolants, 0 QuantifiedInterpolants, 533395 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 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...