./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe033_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_567c340c-b360-4a06-9e08-a20b60e3cbaa/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_567c340c-b360-4a06-9e08-a20b60e3cbaa/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_567c340c-b360-4a06-9e08-a20b60e3cbaa/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_567c340c-b360-4a06-9e08-a20b60e3cbaa/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe033_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/working_dir_567c340c-b360-4a06-9e08-a20b60e3cbaa/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_567c340c-b360-4a06-9e08-a20b60e3cbaa/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0e74c12b1290288bcb109830f6a3658681748940 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-10-22 11:21:56,492 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:21:56,494 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:21:56,504 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:21:56,505 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:21:56,506 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:21:56,507 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:21:56,508 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:21:56,510 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:21:56,511 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:21:56,511 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:21:56,513 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:21:56,513 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:21:56,514 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:21:56,514 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:21:56,515 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:21:56,516 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:21:56,517 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:21:56,518 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:21:56,520 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:21:56,521 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:21:56,522 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:21:56,523 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:21:56,524 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:21:56,526 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:21:56,526 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:21:56,527 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:21:56,528 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:21:56,528 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:21:56,529 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:21:56,529 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:21:56,530 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:21:56,530 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:21:56,531 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:21:56,532 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:21:56,532 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:21:56,533 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:21:56,533 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:21:56,533 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:21:56,534 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:21:56,535 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:21:56,536 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_567c340c-b360-4a06-9e08-a20b60e3cbaa/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:21:56,556 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:21:56,557 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:21:56,559 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:21:56,559 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:21:56,559 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:21:56,559 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:21:56,560 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:21:56,560 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:21:56,560 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:21:56,560 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:21:56,561 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:21:56,561 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:21:56,562 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:21:56,562 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:21:56,562 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:21:56,562 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:21:56,563 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:21:56,563 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:21:56,563 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:21:56,563 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:21:56,564 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:21:56,564 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:21:56,564 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:21:56,564 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:21:56,565 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:21:56,565 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:21:56,571 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:21:56,571 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:21:56,572 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:21:56,572 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:21:56,572 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:21:56,572 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:21:56,572 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:21:56,573 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:21:56,573 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:21:56,573 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_567c340c-b360-4a06-9e08-a20b60e3cbaa/bin/utaipan 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 -> Taipan 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 -> 0e74c12b1290288bcb109830f6a3658681748940 [2019-10-22 11:21:56,613 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:21:56,624 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:21:56,628 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:21:56,629 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:21:56,630 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:21:56,630 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_567c340c-b360-4a06-9e08-a20b60e3cbaa/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/safe033_pso.opt.i [2019-10-22 11:21:56,680 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_567c340c-b360-4a06-9e08-a20b60e3cbaa/bin/utaipan/data/39cb3a463/ef86058780f84a779dcb5fa1cffea27c/FLAGfd0093006 [2019-10-22 11:21:57,160 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:21:57,160 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_567c340c-b360-4a06-9e08-a20b60e3cbaa/sv-benchmarks/c/pthread-wmm/safe033_pso.opt.i [2019-10-22 11:21:57,182 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_567c340c-b360-4a06-9e08-a20b60e3cbaa/bin/utaipan/data/39cb3a463/ef86058780f84a779dcb5fa1cffea27c/FLAGfd0093006 [2019-10-22 11:21:57,659 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_567c340c-b360-4a06-9e08-a20b60e3cbaa/bin/utaipan/data/39cb3a463/ef86058780f84a779dcb5fa1cffea27c [2019-10-22 11:21:57,663 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:21:57,664 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:21:57,666 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:21:57,666 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:21:57,671 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:21:57,672 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:21:57" (1/1) ... [2019-10-22 11:21:57,674 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c1ea15e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:57, skipping insertion in model container [2019-10-22 11:21:57,674 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:21:57" (1/1) ... [2019-10-22 11:21:57,682 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:21:57,727 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:21:58,192 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:21:58,213 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:21:58,290 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:21:58,344 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:21:58,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:58 WrapperNode [2019-10-22 11:21:58,344 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:21:58,345 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:21:58,345 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:21:58,346 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:21:58,354 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:58" (1/1) ... [2019-10-22 11:21:58,369 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:58" (1/1) ... [2019-10-22 11:21:58,406 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:21:58,412 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:21:58,412 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:21:58,412 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:21:58,424 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:58" (1/1) ... [2019-10-22 11:21:58,424 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:58" (1/1) ... [2019-10-22 11:21:58,430 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:58" (1/1) ... [2019-10-22 11:21:58,433 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:58" (1/1) ... [2019-10-22 11:21:58,458 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:58" (1/1) ... [2019-10-22 11:21:58,461 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:58" (1/1) ... [2019-10-22 11:21:58,464 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:58" (1/1) ... [2019-10-22 11:21:58,475 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:21:58,476 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:21:58,476 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:21:58,476 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:21:58,477 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_567c340c-b360-4a06-9e08-a20b60e3cbaa/bin/utaipan/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-10-22 11:21:58,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 11:21:58,550 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-10-22 11:21:58,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:21:58,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:21:58,552 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-10-22 11:21:58,552 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-10-22 11:21:58,552 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-10-22 11:21:58,552 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-10-22 11:21:58,553 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-10-22 11:21:58,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:21:58,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:21:58,554 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-10-22 11:21:59,243 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:21:59,243 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-22 11:21:59,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:21:59 BoogieIcfgContainer [2019-10-22 11:21:59,245 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:21:59,246 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:21:59,246 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:21:59,250 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:21:59,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:21:57" (1/3) ... [2019-10-22 11:21:59,251 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23d238d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:21:59, skipping insertion in model container [2019-10-22 11:21:59,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:58" (2/3) ... [2019-10-22 11:21:59,252 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23d238d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:21:59, skipping insertion in model container [2019-10-22 11:21:59,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:21:59" (3/3) ... [2019-10-22 11:21:59,262 INFO L109 eAbstractionObserver]: Analyzing ICFG safe033_pso.opt.i [2019-10-22 11:21:59,313 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,314 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,314 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,314 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,314 WARN L315 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,314 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,315 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,315 WARN L315 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,315 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,315 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,315 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,316 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,316 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,316 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,316 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,316 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,317 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,317 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,317 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,317 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,318 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,318 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,318 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,318 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,318 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,319 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,319 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,319 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,319 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,319 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,320 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,320 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,320 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,320 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,320 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,321 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,321 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,321 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,322 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,322 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,322 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,322 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,323 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,323 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,323 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,323 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,323 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,324 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,324 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,324 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,324 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,324 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,325 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,325 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,325 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,325 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,325 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,326 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,326 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,326 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,326 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,326 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,327 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,327 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,327 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,327 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,327 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,327 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,328 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,328 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,328 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,328 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,328 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,328 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,329 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,330 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,330 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,330 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,330 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,330 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,331 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,331 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,331 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,331 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,331 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,331 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,332 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,332 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,332 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,332 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,332 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,332 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,333 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,333 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,333 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,334 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,334 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,334 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,334 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,335 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,335 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,335 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,335 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,335 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,335 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,336 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,336 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,336 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,336 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,336 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,337 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,337 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,337 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,338 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,338 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,338 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,338 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,338 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,339 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,339 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,339 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,339 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,339 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,340 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,340 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,340 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,340 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,340 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,341 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,341 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,341 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,341 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,342 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,342 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,342 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,342 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:21:59,348 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-10-22 11:21:59,348 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:21:59,357 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-10-22 11:21:59,369 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-10-22 11:21:59,388 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:21:59,388 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:21:59,389 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:21:59,389 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:21:59,389 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:21:59,389 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:21:59,389 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:21:59,389 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:21:59,401 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 129 places, 161 transitions [2019-10-22 11:22:01,716 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27853 states. [2019-10-22 11:22:01,717 INFO L276 IsEmpty]: Start isEmpty. Operand 27853 states. [2019-10-22 11:22:01,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-22 11:22:01,727 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:01,727 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] [2019-10-22 11:22:01,730 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:01,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:01,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1948189748, now seen corresponding path program 1 times [2019-10-22 11:22:01,744 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:01,745 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454515596] [2019-10-22 11:22:01,745 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:01,745 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:01,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:01,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:01,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:01,985 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454515596] [2019-10-22 11:22:01,986 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:01,987 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:22:01,987 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025799999] [2019-10-22 11:22:01,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:22:01,993 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:02,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:22:02,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:22:02,012 INFO L87 Difference]: Start difference. First operand 27853 states. Second operand 4 states. [2019-10-22 11:22:02,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:02,502 INFO L93 Difference]: Finished difference Result 28521 states and 108878 transitions. [2019-10-22 11:22:02,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:22:02,504 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-10-22 11:22:02,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:02,719 INFO L225 Difference]: With dead ends: 28521 [2019-10-22 11:22:02,720 INFO L226 Difference]: Without dead ends: 21753 [2019-10-22 11:22:02,721 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-10-22 11:22:02,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21753 states. [2019-10-22 11:22:03,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21753 to 21753. [2019-10-22 11:22:03,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21753 states. [2019-10-22 11:22:03,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21753 states to 21753 states and 83438 transitions. [2019-10-22 11:22:03,879 INFO L78 Accepts]: Start accepts. Automaton has 21753 states and 83438 transitions. Word has length 36 [2019-10-22 11:22:03,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:03,881 INFO L462 AbstractCegarLoop]: Abstraction has 21753 states and 83438 transitions. [2019-10-22 11:22:03,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:22:03,881 INFO L276 IsEmpty]: Start isEmpty. Operand 21753 states and 83438 transitions. [2019-10-22 11:22:03,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-22 11:22:03,896 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:03,896 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] [2019-10-22 11:22:03,896 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:03,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:03,897 INFO L82 PathProgramCache]: Analyzing trace with hash -2084779232, now seen corresponding path program 1 times [2019-10-22 11:22:03,897 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:03,897 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061127924] [2019-10-22 11:22:03,897 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:03,897 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:03,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:03,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:04,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:04,062 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061127924] [2019-10-22 11:22:04,063 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:04,063 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:22:04,063 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108869551] [2019-10-22 11:22:04,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:22:04,065 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:04,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:22:04,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:22:04,065 INFO L87 Difference]: Start difference. First operand 21753 states and 83438 transitions. Second operand 5 states. [2019-10-22 11:22:05,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:05,019 INFO L93 Difference]: Finished difference Result 34167 states and 124038 transitions. [2019-10-22 11:22:05,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:22:05,019 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-10-22 11:22:05,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:05,174 INFO L225 Difference]: With dead ends: 34167 [2019-10-22 11:22:05,174 INFO L226 Difference]: Without dead ends: 33599 [2019-10-22 11:22:05,175 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-10-22 11:22:05,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33599 states. [2019-10-22 11:22:05,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33599 to 31793. [2019-10-22 11:22:05,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31793 states. [2019-10-22 11:22:06,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31793 states to 31793 states and 116816 transitions. [2019-10-22 11:22:06,103 INFO L78 Accepts]: Start accepts. Automaton has 31793 states and 116816 transitions. Word has length 44 [2019-10-22 11:22:06,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:06,104 INFO L462 AbstractCegarLoop]: Abstraction has 31793 states and 116816 transitions. [2019-10-22 11:22:06,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:22:06,105 INFO L276 IsEmpty]: Start isEmpty. Operand 31793 states and 116816 transitions. [2019-10-22 11:22:06,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-22 11:22:06,112 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:06,112 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-10-22 11:22:06,112 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:06,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:06,113 INFO L82 PathProgramCache]: Analyzing trace with hash -813435401, now seen corresponding path program 1 times [2019-10-22 11:22:06,113 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:06,113 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167864658] [2019-10-22 11:22:06,114 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:06,114 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:06,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:06,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:06,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:06,211 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167864658] [2019-10-22 11:22:06,211 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:06,211 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:22:06,212 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240545863] [2019-10-22 11:22:06,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:22:06,212 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:06,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:22:06,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:22:06,213 INFO L87 Difference]: Start difference. First operand 31793 states and 116816 transitions. Second operand 5 states. [2019-10-22 11:22:07,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:07,094 INFO L93 Difference]: Finished difference Result 41641 states and 149740 transitions. [2019-10-22 11:22:07,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:22:07,095 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-10-22 11:22:07,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:07,217 INFO L225 Difference]: With dead ends: 41641 [2019-10-22 11:22:07,217 INFO L226 Difference]: Without dead ends: 41177 [2019-10-22 11:22:07,218 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-10-22 11:22:07,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41177 states. [2019-10-22 11:22:08,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41177 to 35361. [2019-10-22 11:22:08,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35361 states. [2019-10-22 11:22:08,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35361 states to 35361 states and 128874 transitions. [2019-10-22 11:22:08,693 INFO L78 Accepts]: Start accepts. Automaton has 35361 states and 128874 transitions. Word has length 45 [2019-10-22 11:22:08,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:08,694 INFO L462 AbstractCegarLoop]: Abstraction has 35361 states and 128874 transitions. [2019-10-22 11:22:08,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:22:08,694 INFO L276 IsEmpty]: Start isEmpty. Operand 35361 states and 128874 transitions. [2019-10-22 11:22:08,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-22 11:22:08,700 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:08,700 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] [2019-10-22 11:22:08,701 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:08,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:08,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1323257433, now seen corresponding path program 1 times [2019-10-22 11:22:08,701 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:08,702 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752264975] [2019-10-22 11:22:08,702 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:08,702 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:08,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:08,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:08,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:08,755 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752264975] [2019-10-22 11:22:08,755 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:08,755 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:22:08,756 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560100010] [2019-10-22 11:22:08,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:22:08,756 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:08,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:22:08,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:22:08,757 INFO L87 Difference]: Start difference. First operand 35361 states and 128874 transitions. Second operand 3 states. [2019-10-22 11:22:08,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:08,995 INFO L93 Difference]: Finished difference Result 45907 states and 163942 transitions. [2019-10-22 11:22:08,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:22:08,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-10-22 11:22:08,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:09,092 INFO L225 Difference]: With dead ends: 45907 [2019-10-22 11:22:09,092 INFO L226 Difference]: Without dead ends: 45907 [2019-10-22 11:22:09,092 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-10-22 11:22:09,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45907 states. [2019-10-22 11:22:09,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45907 to 40244. [2019-10-22 11:22:09,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40244 states. [2019-10-22 11:22:09,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40244 states to 40244 states and 145212 transitions. [2019-10-22 11:22:09,890 INFO L78 Accepts]: Start accepts. Automaton has 40244 states and 145212 transitions. Word has length 47 [2019-10-22 11:22:09,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:09,890 INFO L462 AbstractCegarLoop]: Abstraction has 40244 states and 145212 transitions. [2019-10-22 11:22:09,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:22:09,890 INFO L276 IsEmpty]: Start isEmpty. Operand 40244 states and 145212 transitions. [2019-10-22 11:22:09,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-22 11:22:09,909 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:09,909 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] [2019-10-22 11:22:09,909 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:09,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:09,910 INFO L82 PathProgramCache]: Analyzing trace with hash 598320720, now seen corresponding path program 1 times [2019-10-22 11:22:09,910 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:09,910 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181842873] [2019-10-22 11:22:09,910 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:09,911 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:09,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:09,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:09,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:09,999 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181842873] [2019-10-22 11:22:09,999 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:09,999 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:22:10,000 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227341659] [2019-10-22 11:22:10,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:22:10,000 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:10,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:22:10,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:22:10,001 INFO L87 Difference]: Start difference. First operand 40244 states and 145212 transitions. Second operand 6 states. [2019-10-22 11:22:11,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:11,086 INFO L93 Difference]: Finished difference Result 52463 states and 185474 transitions. [2019-10-22 11:22:11,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-22 11:22:11,087 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-10-22 11:22:11,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:11,200 INFO L225 Difference]: With dead ends: 52463 [2019-10-22 11:22:11,201 INFO L226 Difference]: Without dead ends: 51927 [2019-10-22 11:22:11,201 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-10-22 11:22:11,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51927 states. [2019-10-22 11:22:11,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51927 to 40895. [2019-10-22 11:22:11,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40895 states. [2019-10-22 11:22:11,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40895 states to 40895 states and 147665 transitions. [2019-10-22 11:22:11,993 INFO L78 Accepts]: Start accepts. Automaton has 40895 states and 147665 transitions. Word has length 51 [2019-10-22 11:22:11,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:11,993 INFO L462 AbstractCegarLoop]: Abstraction has 40895 states and 147665 transitions. [2019-10-22 11:22:11,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:22:11,993 INFO L276 IsEmpty]: Start isEmpty. Operand 40895 states and 147665 transitions. [2019-10-22 11:22:12,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-22 11:22:12,007 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:12,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] [2019-10-22 11:22:12,007 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:12,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:12,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1930460229, now seen corresponding path program 1 times [2019-10-22 11:22:12,008 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:12,008 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518017194] [2019-10-22 11:22:12,008 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:12,008 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:12,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:12,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:12,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:12,121 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518017194] [2019-10-22 11:22:12,122 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:12,122 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:22:12,122 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317240393] [2019-10-22 11:22:12,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:22:12,122 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:12,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:22:12,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:22:12,123 INFO L87 Difference]: Start difference. First operand 40895 states and 147665 transitions. Second operand 6 states. [2019-10-22 11:22:13,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:13,079 INFO L93 Difference]: Finished difference Result 56596 states and 201645 transitions. [2019-10-22 11:22:13,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:22:13,079 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-10-22 11:22:13,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:13,212 INFO L225 Difference]: With dead ends: 56596 [2019-10-22 11:22:13,212 INFO L226 Difference]: Without dead ends: 55457 [2019-10-22 11:22:13,213 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-10-22 11:22:13,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55457 states. [2019-10-22 11:22:14,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55457 to 51952. [2019-10-22 11:22:14,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51952 states. [2019-10-22 11:22:14,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51952 states to 51952 states and 186004 transitions. [2019-10-22 11:22:14,202 INFO L78 Accepts]: Start accepts. Automaton has 51952 states and 186004 transitions. Word has length 51 [2019-10-22 11:22:14,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:14,202 INFO L462 AbstractCegarLoop]: Abstraction has 51952 states and 186004 transitions. [2019-10-22 11:22:14,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:22:14,202 INFO L276 IsEmpty]: Start isEmpty. Operand 51952 states and 186004 transitions. [2019-10-22 11:22:14,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-22 11:22:14,215 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:14,215 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] [2019-10-22 11:22:14,215 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:14,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:14,216 INFO L82 PathProgramCache]: Analyzing trace with hash 567555708, now seen corresponding path program 1 times [2019-10-22 11:22:14,216 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:14,216 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218927668] [2019-10-22 11:22:14,216 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:14,216 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:14,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:14,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:14,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:14,324 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218927668] [2019-10-22 11:22:14,324 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:14,324 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 11:22:14,324 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500491332] [2019-10-22 11:22:14,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 11:22:14,325 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:14,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 11:22:14,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:22:14,325 INFO L87 Difference]: Start difference. First operand 51952 states and 186004 transitions. Second operand 7 states. [2019-10-22 11:22:15,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:15,437 INFO L93 Difference]: Finished difference Result 75635 states and 260101 transitions. [2019-10-22 11:22:15,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 11:22:15,437 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-10-22 11:22:15,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:15,597 INFO L225 Difference]: With dead ends: 75635 [2019-10-22 11:22:15,597 INFO L226 Difference]: Without dead ends: 75635 [2019-10-22 11:22:15,598 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-10-22 11:22:16,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75635 states. [2019-10-22 11:22:17,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75635 to 61470. [2019-10-22 11:22:17,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61470 states. [2019-10-22 11:22:17,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61470 states to 61470 states and 215181 transitions. [2019-10-22 11:22:17,176 INFO L78 Accepts]: Start accepts. Automaton has 61470 states and 215181 transitions. Word has length 51 [2019-10-22 11:22:17,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:17,176 INFO L462 AbstractCegarLoop]: Abstraction has 61470 states and 215181 transitions. [2019-10-22 11:22:17,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 11:22:17,176 INFO L276 IsEmpty]: Start isEmpty. Operand 61470 states and 215181 transitions. [2019-10-22 11:22:17,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-22 11:22:17,188 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:17,188 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] [2019-10-22 11:22:17,188 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:17,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:17,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1455059389, now seen corresponding path program 1 times [2019-10-22 11:22:17,189 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:17,189 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483287543] [2019-10-22 11:22:17,189 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:17,189 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:17,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:17,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:17,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:17,248 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483287543] [2019-10-22 11:22:17,249 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:17,249 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:22:17,249 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086263476] [2019-10-22 11:22:17,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:22:17,250 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:17,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:22:17,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:22:17,250 INFO L87 Difference]: Start difference. First operand 61470 states and 215181 transitions. Second operand 3 states. [2019-10-22 11:22:17,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:17,430 INFO L93 Difference]: Finished difference Result 46764 states and 162431 transitions. [2019-10-22 11:22:17,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:22:17,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-10-22 11:22:17,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:17,525 INFO L225 Difference]: With dead ends: 46764 [2019-10-22 11:22:17,526 INFO L226 Difference]: Without dead ends: 46184 [2019-10-22 11:22:17,526 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:22:17,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46184 states. [2019-10-22 11:22:18,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46184 to 44419. [2019-10-22 11:22:18,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44419 states. [2019-10-22 11:22:18,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44419 states to 44419 states and 155152 transitions. [2019-10-22 11:22:18,856 INFO L78 Accepts]: Start accepts. Automaton has 44419 states and 155152 transitions. Word has length 51 [2019-10-22 11:22:18,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:18,857 INFO L462 AbstractCegarLoop]: Abstraction has 44419 states and 155152 transitions. [2019-10-22 11:22:18,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:22:18,857 INFO L276 IsEmpty]: Start isEmpty. Operand 44419 states and 155152 transitions. [2019-10-22 11:22:18,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-22 11:22:18,866 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:18,866 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-10-22 11:22:18,866 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:18,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:18,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1722946808, now seen corresponding path program 1 times [2019-10-22 11:22:18,867 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:18,867 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103224817] [2019-10-22 11:22:18,867 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:18,867 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:18,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:18,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:18,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:18,939 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103224817] [2019-10-22 11:22:18,939 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:18,940 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:22:18,940 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269027337] [2019-10-22 11:22:18,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:22:18,940 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:18,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:22:18,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:22:18,941 INFO L87 Difference]: Start difference. First operand 44419 states and 155152 transitions. Second operand 6 states. [2019-10-22 11:22:19,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:19,452 INFO L93 Difference]: Finished difference Result 78165 states and 268524 transitions. [2019-10-22 11:22:19,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:22:19,452 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-10-22 11:22:19,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:19,610 INFO L225 Difference]: With dead ends: 78165 [2019-10-22 11:22:19,610 INFO L226 Difference]: Without dead ends: 78165 [2019-10-22 11:22:19,610 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:22:19,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78165 states. [2019-10-22 11:22:20,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78165 to 54287. [2019-10-22 11:22:20,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54287 states. [2019-10-22 11:22:20,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54287 states to 54287 states and 188025 transitions. [2019-10-22 11:22:20,718 INFO L78 Accepts]: Start accepts. Automaton has 54287 states and 188025 transitions. Word has length 52 [2019-10-22 11:22:20,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:20,718 INFO L462 AbstractCegarLoop]: Abstraction has 54287 states and 188025 transitions. [2019-10-22 11:22:20,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:22:20,718 INFO L276 IsEmpty]: Start isEmpty. Operand 54287 states and 188025 transitions. [2019-10-22 11:22:20,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-22 11:22:20,730 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:20,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] [2019-10-22 11:22:20,730 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:20,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:20,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1684516807, now seen corresponding path program 1 times [2019-10-22 11:22:20,730 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:20,731 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979432582] [2019-10-22 11:22:20,731 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:20,731 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:20,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:20,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:20,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:20,825 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979432582] [2019-10-22 11:22:20,825 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:20,825 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:22:20,825 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554062456] [2019-10-22 11:22:20,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:22:20,826 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:20,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:22:20,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:22:20,826 INFO L87 Difference]: Start difference. First operand 54287 states and 188025 transitions. Second operand 4 states. [2019-10-22 11:22:20,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:20,893 INFO L93 Difference]: Finished difference Result 11681 states and 36224 transitions. [2019-10-22 11:22:20,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:22:20,893 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-10-22 11:22:20,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:20,913 INFO L225 Difference]: With dead ends: 11681 [2019-10-22 11:22:20,913 INFO L226 Difference]: Without dead ends: 10175 [2019-10-22 11:22:20,913 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-10-22 11:22:20,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10175 states. [2019-10-22 11:22:21,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10175 to 10127. [2019-10-22 11:22:21,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10127 states. [2019-10-22 11:22:21,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10127 states to 10127 states and 31169 transitions. [2019-10-22 11:22:21,049 INFO L78 Accepts]: Start accepts. Automaton has 10127 states and 31169 transitions. Word has length 52 [2019-10-22 11:22:21,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:21,049 INFO L462 AbstractCegarLoop]: Abstraction has 10127 states and 31169 transitions. [2019-10-22 11:22:21,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:22:21,049 INFO L276 IsEmpty]: Start isEmpty. Operand 10127 states and 31169 transitions. [2019-10-22 11:22:21,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-22 11:22:21,052 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:21,053 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] [2019-10-22 11:22:21,053 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:21,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:21,053 INFO L82 PathProgramCache]: Analyzing trace with hash 911252639, now seen corresponding path program 1 times [2019-10-22 11:22:21,053 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:21,053 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441741708] [2019-10-22 11:22:21,053 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:21,053 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:21,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:21,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:21,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:21,117 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441741708] [2019-10-22 11:22:21,117 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:21,117 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:22:21,118 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713402942] [2019-10-22 11:22:21,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:22:21,118 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:21,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:22:21,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:22:21,118 INFO L87 Difference]: Start difference. First operand 10127 states and 31169 transitions. Second operand 4 states. [2019-10-22 11:22:21,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:21,268 INFO L93 Difference]: Finished difference Result 11862 states and 36215 transitions. [2019-10-22 11:22:21,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:22:21,268 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-10-22 11:22:21,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:21,287 INFO L225 Difference]: With dead ends: 11862 [2019-10-22 11:22:21,287 INFO L226 Difference]: Without dead ends: 11862 [2019-10-22 11:22:21,288 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-10-22 11:22:21,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11862 states. [2019-10-22 11:22:21,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11862 to 10794. [2019-10-22 11:22:21,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10794 states. [2019-10-22 11:22:21,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10794 states to 10794 states and 33078 transitions. [2019-10-22 11:22:21,424 INFO L78 Accepts]: Start accepts. Automaton has 10794 states and 33078 transitions. Word has length 61 [2019-10-22 11:22:21,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:21,425 INFO L462 AbstractCegarLoop]: Abstraction has 10794 states and 33078 transitions. [2019-10-22 11:22:21,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:22:21,425 INFO L276 IsEmpty]: Start isEmpty. Operand 10794 states and 33078 transitions. [2019-10-22 11:22:21,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-22 11:22:21,428 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:21,428 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] [2019-10-22 11:22:21,429 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:21,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:21,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1640904322, now seen corresponding path program 1 times [2019-10-22 11:22:21,429 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:21,429 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935811461] [2019-10-22 11:22:21,429 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:21,429 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:21,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:21,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:21,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:21,511 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935811461] [2019-10-22 11:22:21,511 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:21,511 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:22:21,511 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825666871] [2019-10-22 11:22:21,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:22:21,512 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:21,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:22:21,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:22:21,512 INFO L87 Difference]: Start difference. First operand 10794 states and 33078 transitions. Second operand 6 states. [2019-10-22 11:22:21,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:21,871 INFO L93 Difference]: Finished difference Result 14219 states and 42886 transitions. [2019-10-22 11:22:21,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 11:22:21,872 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-10-22 11:22:21,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:21,898 INFO L225 Difference]: With dead ends: 14219 [2019-10-22 11:22:21,899 INFO L226 Difference]: Without dead ends: 14155 [2019-10-22 11:22:21,899 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-10-22 11:22:21,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14155 states. [2019-10-22 11:22:22,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14155 to 12163. [2019-10-22 11:22:22,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12163 states. [2019-10-22 11:22:22,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12163 states to 12163 states and 37043 transitions. [2019-10-22 11:22:22,075 INFO L78 Accepts]: Start accepts. Automaton has 12163 states and 37043 transitions. Word has length 61 [2019-10-22 11:22:22,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:22,075 INFO L462 AbstractCegarLoop]: Abstraction has 12163 states and 37043 transitions. [2019-10-22 11:22:22,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:22:22,075 INFO L276 IsEmpty]: Start isEmpty. Operand 12163 states and 37043 transitions. [2019-10-22 11:22:22,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-22 11:22:22,083 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:22,084 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] [2019-10-22 11:22:22,084 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:22,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:22,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1320481554, now seen corresponding path program 1 times [2019-10-22 11:22:22,084 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:22,084 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000167739] [2019-10-22 11:22:22,085 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:22,085 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:22,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:22,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:22,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:22,152 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000167739] [2019-10-22 11:22:22,152 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:22,152 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:22:22,152 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499386389] [2019-10-22 11:22:22,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:22:22,153 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:22,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:22:22,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:22:22,154 INFO L87 Difference]: Start difference. First operand 12163 states and 37043 transitions. Second operand 4 states. [2019-10-22 11:22:22,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:22,383 INFO L93 Difference]: Finished difference Result 15767 states and 47483 transitions. [2019-10-22 11:22:22,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:22:22,384 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-10-22 11:22:22,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:22,407 INFO L225 Difference]: With dead ends: 15767 [2019-10-22 11:22:22,407 INFO L226 Difference]: Without dead ends: 15767 [2019-10-22 11:22:22,407 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-10-22 11:22:22,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15767 states. [2019-10-22 11:22:22,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15767 to 13446. [2019-10-22 11:22:22,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13446 states. [2019-10-22 11:22:22,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13446 states to 13446 states and 40694 transitions. [2019-10-22 11:22:22,677 INFO L78 Accepts]: Start accepts. Automaton has 13446 states and 40694 transitions. Word has length 65 [2019-10-22 11:22:22,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:22,678 INFO L462 AbstractCegarLoop]: Abstraction has 13446 states and 40694 transitions. [2019-10-22 11:22:22,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:22:22,678 INFO L276 IsEmpty]: Start isEmpty. Operand 13446 states and 40694 transitions. [2019-10-22 11:22:22,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-22 11:22:22,685 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:22,685 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] [2019-10-22 11:22:22,686 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:22,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:22,686 INFO L82 PathProgramCache]: Analyzing trace with hash -75717073, now seen corresponding path program 1 times [2019-10-22 11:22:22,686 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:22,686 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988492524] [2019-10-22 11:22:22,686 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:22,686 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:22,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:22,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:22,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:22,794 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988492524] [2019-10-22 11:22:22,795 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:22,795 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:22:22,795 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415820301] [2019-10-22 11:22:22,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:22:22,795 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:22,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:22:22,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:22:22,796 INFO L87 Difference]: Start difference. First operand 13446 states and 40694 transitions. Second operand 6 states. [2019-10-22 11:22:23,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:23,331 INFO L93 Difference]: Finished difference Result 15003 states and 44681 transitions. [2019-10-22 11:22:23,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:22:23,332 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-10-22 11:22:23,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:23,351 INFO L225 Difference]: With dead ends: 15003 [2019-10-22 11:22:23,351 INFO L226 Difference]: Without dead ends: 15003 [2019-10-22 11:22:23,352 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-10-22 11:22:23,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15003 states. [2019-10-22 11:22:23,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15003 to 14615. [2019-10-22 11:22:23,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14615 states. [2019-10-22 11:22:23,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14615 states to 14615 states and 43652 transitions. [2019-10-22 11:22:23,546 INFO L78 Accepts]: Start accepts. Automaton has 14615 states and 43652 transitions. Word has length 65 [2019-10-22 11:22:23,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:23,546 INFO L462 AbstractCegarLoop]: Abstraction has 14615 states and 43652 transitions. [2019-10-22 11:22:23,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:22:23,546 INFO L276 IsEmpty]: Start isEmpty. Operand 14615 states and 43652 transitions. [2019-10-22 11:22:23,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-22 11:22:23,556 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:23,557 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] [2019-10-22 11:22:23,557 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:23,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:23,557 INFO L82 PathProgramCache]: Analyzing trace with hash 2142040880, now seen corresponding path program 1 times [2019-10-22 11:22:23,557 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:23,557 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701110275] [2019-10-22 11:22:23,557 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:23,558 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:23,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:23,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:23,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:23,654 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701110275] [2019-10-22 11:22:23,654 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:23,654 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:22:23,654 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169464567] [2019-10-22 11:22:23,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:22:23,655 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:23,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:22:23,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:22:23,655 INFO L87 Difference]: Start difference. First operand 14615 states and 43652 transitions. Second operand 6 states. [2019-10-22 11:22:23,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:23,927 INFO L93 Difference]: Finished difference Result 17296 states and 50332 transitions. [2019-10-22 11:22:23,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 11:22:23,927 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-10-22 11:22:23,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:23,948 INFO L225 Difference]: With dead ends: 17296 [2019-10-22 11:22:23,948 INFO L226 Difference]: Without dead ends: 17296 [2019-10-22 11:22:23,948 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-10-22 11:22:23,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17296 states. [2019-10-22 11:22:24,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17296 to 14618. [2019-10-22 11:22:24,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14618 states. [2019-10-22 11:22:24,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14618 states to 14618 states and 43011 transitions. [2019-10-22 11:22:24,146 INFO L78 Accepts]: Start accepts. Automaton has 14618 states and 43011 transitions. Word has length 65 [2019-10-22 11:22:24,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:24,147 INFO L462 AbstractCegarLoop]: Abstraction has 14618 states and 43011 transitions. [2019-10-22 11:22:24,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:22:24,147 INFO L276 IsEmpty]: Start isEmpty. Operand 14618 states and 43011 transitions. [2019-10-22 11:22:24,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-22 11:22:24,154 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:24,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] [2019-10-22 11:22:24,154 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:24,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:24,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1941575503, now seen corresponding path program 1 times [2019-10-22 11:22:24,155 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:24,155 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465195647] [2019-10-22 11:22:24,155 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:24,155 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:24,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:24,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:24,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:24,222 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465195647] [2019-10-22 11:22:24,222 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:24,223 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:22:24,223 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745748634] [2019-10-22 11:22:24,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:22:24,223 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:24,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:22:24,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:22:24,224 INFO L87 Difference]: Start difference. First operand 14618 states and 43011 transitions. Second operand 5 states. [2019-10-22 11:22:24,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:24,485 INFO L93 Difference]: Finished difference Result 17799 states and 52123 transitions. [2019-10-22 11:22:24,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:22:24,489 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-10-22 11:22:24,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:24,522 INFO L225 Difference]: With dead ends: 17799 [2019-10-22 11:22:24,522 INFO L226 Difference]: Without dead ends: 17799 [2019-10-22 11:22:24,522 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-10-22 11:22:24,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17799 states. [2019-10-22 11:22:24,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17799 to 15561. [2019-10-22 11:22:24,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15561 states. [2019-10-22 11:22:24,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15561 states to 15561 states and 45441 transitions. [2019-10-22 11:22:24,753 INFO L78 Accepts]: Start accepts. Automaton has 15561 states and 45441 transitions. Word has length 65 [2019-10-22 11:22:24,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:24,754 INFO L462 AbstractCegarLoop]: Abstraction has 15561 states and 45441 transitions. [2019-10-22 11:22:24,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:22:24,754 INFO L276 IsEmpty]: Start isEmpty. Operand 15561 states and 45441 transitions. [2019-10-22 11:22:24,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-22 11:22:24,762 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:24,762 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] [2019-10-22 11:22:24,762 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:24,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:24,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1842857616, now seen corresponding path program 1 times [2019-10-22 11:22:24,763 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:24,763 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288807341] [2019-10-22 11:22:24,763 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:24,763 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:24,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:24,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:24,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:24,830 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288807341] [2019-10-22 11:22:24,830 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:24,830 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:22:24,830 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967087792] [2019-10-22 11:22:24,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:22:24,831 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:24,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:22:24,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:22:24,831 INFO L87 Difference]: Start difference. First operand 15561 states and 45441 transitions. Second operand 4 states. [2019-10-22 11:22:25,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:25,177 INFO L93 Difference]: Finished difference Result 18693 states and 54346 transitions. [2019-10-22 11:22:25,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:22:25,177 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-10-22 11:22:25,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:25,202 INFO L225 Difference]: With dead ends: 18693 [2019-10-22 11:22:25,202 INFO L226 Difference]: Without dead ends: 18045 [2019-10-22 11:22:25,202 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-10-22 11:22:25,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18045 states. [2019-10-22 11:22:25,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18045 to 17317. [2019-10-22 11:22:25,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17317 states. [2019-10-22 11:22:25,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17317 states to 17317 states and 50342 transitions. [2019-10-22 11:22:25,435 INFO L78 Accepts]: Start accepts. Automaton has 17317 states and 50342 transitions. Word has length 65 [2019-10-22 11:22:25,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:25,435 INFO L462 AbstractCegarLoop]: Abstraction has 17317 states and 50342 transitions. [2019-10-22 11:22:25,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:22:25,435 INFO L276 IsEmpty]: Start isEmpty. Operand 17317 states and 50342 transitions. [2019-10-22 11:22:25,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-22 11:22:25,446 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:25,446 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:25,446 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:25,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:25,447 INFO L82 PathProgramCache]: Analyzing trace with hash -841597424, now seen corresponding path program 1 times [2019-10-22 11:22:25,447 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:25,447 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194919564] [2019-10-22 11:22:25,447 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:25,447 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:25,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:25,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:25,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-10-22 11:22:25,570 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194919564] [2019-10-22 11:22:25,570 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:25,571 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 11:22:25,571 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541793336] [2019-10-22 11:22:25,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 11:22:25,571 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:25,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 11:22:25,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:22:25,572 INFO L87 Difference]: Start difference. First operand 17317 states and 50342 transitions. Second operand 7 states. [2019-10-22 11:22:25,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:25,937 INFO L93 Difference]: Finished difference Result 19804 states and 56426 transitions. [2019-10-22 11:22:25,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 11:22:25,937 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-10-22 11:22:25,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:25,963 INFO L225 Difference]: With dead ends: 19804 [2019-10-22 11:22:25,963 INFO L226 Difference]: Without dead ends: 19804 [2019-10-22 11:22:25,963 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-10-22 11:22:25,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19804 states. [2019-10-22 11:22:26,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19804 to 15409. [2019-10-22 11:22:26,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15409 states. [2019-10-22 11:22:26,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15409 states to 15409 states and 43968 transitions. [2019-10-22 11:22:26,180 INFO L78 Accepts]: Start accepts. Automaton has 15409 states and 43968 transitions. Word has length 65 [2019-10-22 11:22:26,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:26,180 INFO L462 AbstractCegarLoop]: Abstraction has 15409 states and 43968 transitions. [2019-10-22 11:22:26,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 11:22:26,180 INFO L276 IsEmpty]: Start isEmpty. Operand 15409 states and 43968 transitions. [2019-10-22 11:22:26,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-22 11:22:26,188 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:26,188 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] [2019-10-22 11:22:26,188 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:26,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:26,189 INFO L82 PathProgramCache]: Analyzing trace with hash 45906257, now seen corresponding path program 1 times [2019-10-22 11:22:26,189 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:26,189 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614162607] [2019-10-22 11:22:26,189 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:26,189 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:26,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:26,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:26,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:26,268 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614162607] [2019-10-22 11:22:26,268 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:26,268 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:22:26,269 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241853723] [2019-10-22 11:22:26,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:22:26,270 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:26,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:22:26,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:22:26,270 INFO L87 Difference]: Start difference. First operand 15409 states and 43968 transitions. Second operand 5 states. [2019-10-22 11:22:26,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:26,317 INFO L93 Difference]: Finished difference Result 4637 states and 11013 transitions. [2019-10-22 11:22:26,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:22:26,318 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-10-22 11:22:26,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:26,322 INFO L225 Difference]: With dead ends: 4637 [2019-10-22 11:22:26,323 INFO L226 Difference]: Without dead ends: 3763 [2019-10-22 11:22:26,323 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-10-22 11:22:26,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3763 states. [2019-10-22 11:22:26,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3763 to 3476. [2019-10-22 11:22:26,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3476 states. [2019-10-22 11:22:26,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3476 states to 3476 states and 8052 transitions. [2019-10-22 11:22:26,373 INFO L78 Accepts]: Start accepts. Automaton has 3476 states and 8052 transitions. Word has length 65 [2019-10-22 11:22:26,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:26,373 INFO L462 AbstractCegarLoop]: Abstraction has 3476 states and 8052 transitions. [2019-10-22 11:22:26,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:22:26,373 INFO L276 IsEmpty]: Start isEmpty. Operand 3476 states and 8052 transitions. [2019-10-22 11:22:26,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-22 11:22:26,377 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:26,378 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] [2019-10-22 11:22:26,378 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:26,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:26,378 INFO L82 PathProgramCache]: Analyzing trace with hash 529305649, now seen corresponding path program 1 times [2019-10-22 11:22:26,379 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:26,379 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264442671] [2019-10-22 11:22:26,379 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:26,379 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:26,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:26,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:26,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:26,495 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264442671] [2019-10-22 11:22:26,495 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:26,495 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 11:22:26,496 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941977997] [2019-10-22 11:22:26,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 11:22:26,496 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:26,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 11:22:26,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:22:26,497 INFO L87 Difference]: Start difference. First operand 3476 states and 8052 transitions. Second operand 7 states. [2019-10-22 11:22:27,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:27,052 INFO L93 Difference]: Finished difference Result 4226 states and 9680 transitions. [2019-10-22 11:22:27,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-22 11:22:27,053 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2019-10-22 11:22:27,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:27,057 INFO L225 Difference]: With dead ends: 4226 [2019-10-22 11:22:27,058 INFO L226 Difference]: Without dead ends: 4192 [2019-10-22 11:22:27,058 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-10-22 11:22:27,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4192 states. [2019-10-22 11:22:27,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4192 to 3648. [2019-10-22 11:22:27,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3648 states. [2019-10-22 11:22:27,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3648 states to 3648 states and 8413 transitions. [2019-10-22 11:22:27,106 INFO L78 Accepts]: Start accepts. Automaton has 3648 states and 8413 transitions. Word has length 82 [2019-10-22 11:22:27,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:27,107 INFO L462 AbstractCegarLoop]: Abstraction has 3648 states and 8413 transitions. [2019-10-22 11:22:27,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 11:22:27,107 INFO L276 IsEmpty]: Start isEmpty. Operand 3648 states and 8413 transitions. [2019-10-22 11:22:27,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-22 11:22:27,111 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:27,112 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] [2019-10-22 11:22:27,112 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:27,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:27,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1547903694, now seen corresponding path program 1 times [2019-10-22 11:22:27,112 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:27,112 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617016912] [2019-10-22 11:22:27,112 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:27,112 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:27,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:27,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:27,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-10-22 11:22:27,232 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617016912] [2019-10-22 11:22:27,232 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:27,232 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:22:27,232 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792072851] [2019-10-22 11:22:27,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:22:27,232 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:27,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:22:27,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:22:27,233 INFO L87 Difference]: Start difference. First operand 3648 states and 8413 transitions. Second operand 6 states. [2019-10-22 11:22:27,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:27,312 INFO L93 Difference]: Finished difference Result 6224 states and 14461 transitions. [2019-10-22 11:22:27,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:22:27,312 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-10-22 11:22:27,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:27,318 INFO L225 Difference]: With dead ends: 6224 [2019-10-22 11:22:27,318 INFO L226 Difference]: Without dead ends: 5382 [2019-10-22 11:22:27,319 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:22:27,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5382 states. [2019-10-22 11:22:27,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5382 to 3552. [2019-10-22 11:22:27,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3552 states. [2019-10-22 11:22:27,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3552 states to 3552 states and 8205 transitions. [2019-10-22 11:22:27,355 INFO L78 Accepts]: Start accepts. Automaton has 3552 states and 8205 transitions. Word has length 82 [2019-10-22 11:22:27,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:27,356 INFO L462 AbstractCegarLoop]: Abstraction has 3552 states and 8205 transitions. [2019-10-22 11:22:27,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:22:27,356 INFO L276 IsEmpty]: Start isEmpty. Operand 3552 states and 8205 transitions. [2019-10-22 11:22:27,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-22 11:22:27,359 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:27,359 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] [2019-10-22 11:22:27,359 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:27,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:27,360 INFO L82 PathProgramCache]: Analyzing trace with hash -469329194, now seen corresponding path program 2 times [2019-10-22 11:22:27,360 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:27,360 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716578757] [2019-10-22 11:22:27,360 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:27,360 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:27,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:27,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:27,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:27,451 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716578757] [2019-10-22 11:22:27,452 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:27,452 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 11:22:27,452 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365645917] [2019-10-22 11:22:27,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 11:22:27,452 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:27,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 11:22:27,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:22:27,453 INFO L87 Difference]: Start difference. First operand 3552 states and 8205 transitions. Second operand 7 states. [2019-10-22 11:22:27,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:27,522 INFO L93 Difference]: Finished difference Result 6104 states and 14199 transitions. [2019-10-22 11:22:27,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:22:27,523 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2019-10-22 11:22:27,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:27,526 INFO L225 Difference]: With dead ends: 6104 [2019-10-22 11:22:27,526 INFO L226 Difference]: Without dead ends: 2656 [2019-10-22 11:22:27,526 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:22:27,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2656 states. [2019-10-22 11:22:27,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2656 to 2656. [2019-10-22 11:22:27,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2656 states. [2019-10-22 11:22:27,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2656 states to 2656 states and 6183 transitions. [2019-10-22 11:22:27,556 INFO L78 Accepts]: Start accepts. Automaton has 2656 states and 6183 transitions. Word has length 82 [2019-10-22 11:22:27,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:27,556 INFO L462 AbstractCegarLoop]: Abstraction has 2656 states and 6183 transitions. [2019-10-22 11:22:27,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 11:22:27,556 INFO L276 IsEmpty]: Start isEmpty. Operand 2656 states and 6183 transitions. [2019-10-22 11:22:27,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-22 11:22:27,559 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:27,559 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] [2019-10-22 11:22:27,559 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:27,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:27,559 INFO L82 PathProgramCache]: Analyzing trace with hash 282050159, now seen corresponding path program 2 times [2019-10-22 11:22:27,559 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:27,559 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886292005] [2019-10-22 11:22:27,560 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:27,560 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:27,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:27,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:27,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:27,689 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886292005] [2019-10-22 11:22:27,689 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:27,689 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:22:27,689 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148222894] [2019-10-22 11:22:27,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:22:27,690 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:27,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:22:27,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:22:27,690 INFO L87 Difference]: Start difference. First operand 2656 states and 6183 transitions. Second operand 6 states. [2019-10-22 11:22:27,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:27,887 INFO L93 Difference]: Finished difference Result 2935 states and 6774 transitions. [2019-10-22 11:22:27,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:22:27,887 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-10-22 11:22:27,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:27,889 INFO L225 Difference]: With dead ends: 2935 [2019-10-22 11:22:27,889 INFO L226 Difference]: Without dead ends: 2893 [2019-10-22 11:22:27,890 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:22:27,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2893 states. [2019-10-22 11:22:27,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2893 to 2607. [2019-10-22 11:22:27,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2607 states. [2019-10-22 11:22:27,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2607 states to 2607 states and 6035 transitions. [2019-10-22 11:22:27,915 INFO L78 Accepts]: Start accepts. Automaton has 2607 states and 6035 transitions. Word has length 82 [2019-10-22 11:22:27,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:27,915 INFO L462 AbstractCegarLoop]: Abstraction has 2607 states and 6035 transitions. [2019-10-22 11:22:27,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:22:27,915 INFO L276 IsEmpty]: Start isEmpty. Operand 2607 states and 6035 transitions. [2019-10-22 11:22:27,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-22 11:22:27,917 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:27,917 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] [2019-10-22 11:22:27,918 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:27,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:27,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1795159184, now seen corresponding path program 3 times [2019-10-22 11:22:27,918 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:27,918 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379606012] [2019-10-22 11:22:27,919 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:27,919 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:27,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:27,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:22:27,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:22:27,985 INFO L168 tionRefinementEngine]: Strategy TAIPAN found a feasible trace [2019-10-22 11:22:27,985 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 11:22:28,091 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-10-22 11:22:28,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:22:28 BasicIcfg [2019-10-22 11:22:28,101 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:22:28,101 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:22:28,101 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:22:28,101 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:22:28,102 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:21:59" (3/4) ... [2019-10-22 11:22:28,104 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 11:22:28,256 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_567c340c-b360-4a06-9e08-a20b60e3cbaa/bin/utaipan/witness.graphml [2019-10-22 11:22:28,259 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:22:28,261 INFO L168 Benchmark]: Toolchain (without parser) took 30595.88 ms. Allocated memory was 1.0 GB in the beginning and 4.1 GB in the end (delta: 3.0 GB). Free memory was 941.8 MB in the beginning and 3.5 GB in the end (delta: -2.6 GB). Peak memory consumption was 472.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:28,261 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:22:28,261 INFO L168 Benchmark]: CACSL2BoogieTranslator took 678.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 941.8 MB in the beginning and 1.1 GB in the end (delta: -159.7 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:28,261 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.40 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-10-22 11:22:28,262 INFO L168 Benchmark]: Boogie Preprocessor took 63.40 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-10-22 11:22:28,262 INFO L168 Benchmark]: RCFGBuilder took 768.94 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: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:28,262 INFO L168 Benchmark]: TraceAbstraction took 28855.27 ms. Allocated memory was 1.2 GB in the beginning and 4.1 GB in the end (delta: 2.9 GB). Free memory was 1.1 GB in the beginning and 3.6 GB in the end (delta: -2.5 GB). Peak memory consumption was 371.9 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:28,262 INFO L168 Benchmark]: Witness Printer took 157.62 ms. Allocated memory is still 4.1 GB. Free memory was 3.6 GB in the beginning and 3.5 GB in the end (delta: 76.1 MB). Peak memory consumption was 76.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:28,264 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 678.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 941.8 MB in the beginning and 1.1 GB in the end (delta: -159.7 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 66.40 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.40 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 768.94 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: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 28855.27 ms. Allocated memory was 1.2 GB in the beginning and 4.1 GB in the end (delta: 2.9 GB). Free memory was 1.1 GB in the beginning and 3.6 GB in the end (delta: -2.5 GB). Peak memory consumption was 371.9 MB. Max. memory is 11.5 GB. * Witness Printer took 157.62 ms. Allocated memory is still 4.1 GB. Free memory was 3.6 GB in the beginning and 3.5 GB in the end (delta: 76.1 MB). Peak memory consumption was 76.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L698] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0] [L699] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L701] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L702] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L703] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L704] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L705] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L706] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L707] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L708] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L709] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L710] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L711] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L712] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L713] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L714] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L715] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L718] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L719] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L789] 0 pthread_t t2567; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L790] FCALL, FORK 0 pthread_create(&t2567, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L791] 0 pthread_t t2568; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L792] FCALL, FORK 0 pthread_create(&t2568, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L753] 2 x$w_buff1 = x$w_buff0 [L754] 2 x$w_buff0 = 1 [L755] 2 x$w_buff1_used = x$w_buff0_used [L756] 2 x$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L758] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L759] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L760] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L761] 2 x$r_buff0_thd2 = (_Bool)1 [L764] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L723] 1 y = 2 [L728] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L729] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L730] 1 x$flush_delayed = weak$$choice2 [L731] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L733] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L733] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L734] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L734] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L735] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L735] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L736] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L737] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L737] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L738] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] 1 x = x$flush_delayed ? x$mem_tmp : x [L741] 1 x$flush_delayed = (_Bool)0 [L746] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L767] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L768] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L769] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L770] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L771] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L774] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L794] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L799] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L799] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L800] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L800] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L801] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L802] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L802] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L805] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 197 locations, 3 error locations. Result: UNSAFE, OverallTime: 28.7s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 11.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5871 SDtfs, 7158 SDslu, 12279 SDs, 0 SdLazy, 4607 SolverSat, 370 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 201 GetRequests, 57 SyntacticMatches, 9 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61470occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 12.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 86433 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1467 NumberOfCodeBlocks, 1467 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1362 ConstructedInterpolants, 0 QuantifiedInterpolants, 247305 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...