./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi004_pso.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5ddb80f6-f541-4120-ac39-bfe5f4fde71d/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5ddb80f6-f541-4120-ac39-bfe5f4fde71d/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5ddb80f6-f541-4120-ac39-bfe5f4fde71d/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5ddb80f6-f541-4120-ac39-bfe5f4fde71d/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi004_pso.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_5ddb80f6-f541-4120-ac39-bfe5f4fde71d/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5ddb80f6-f541-4120-ac39-bfe5f4fde71d/bin-2019/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 adac677e86c3589742609fbf864b49e4d47efc96 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 22:48:19,496 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 22:48:19,497 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 22:48:19,505 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 22:48:19,505 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 22:48:19,506 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 22:48:19,507 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 22:48:19,508 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 22:48:19,509 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 22:48:19,510 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 22:48:19,510 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 22:48:19,510 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 22:48:19,511 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 22:48:19,512 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 22:48:19,512 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 22:48:19,513 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 22:48:19,513 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 22:48:19,515 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 22:48:19,516 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 22:48:19,517 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 22:48:19,517 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 22:48:19,518 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 22:48:19,519 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 22:48:19,520 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 22:48:19,520 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 22:48:19,520 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 22:48:19,521 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 22:48:19,521 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 22:48:19,522 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 22:48:19,523 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 22:48:19,523 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 22:48:19,523 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 22:48:19,523 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 22:48:19,524 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 22:48:19,524 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 22:48:19,525 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 22:48:19,525 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5ddb80f6-f541-4120-ac39-bfe5f4fde71d/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 22:48:19,533 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 22:48:19,533 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 22:48:19,533 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 22:48:19,533 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 22:48:19,534 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 22:48:19,534 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 22:48:19,534 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 22:48:19,534 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 22:48:19,534 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 22:48:19,534 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 22:48:19,534 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 22:48:19,534 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 22:48:19,534 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 22:48:19,535 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 22:48:19,535 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 22:48:19,535 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 22:48:19,535 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 22:48:19,535 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 22:48:19,535 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 22:48:19,535 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 22:48:19,535 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 22:48:19,535 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 22:48:19,536 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 22:48:19,536 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 22:48:19,536 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 22:48:19,536 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 22:48:19,536 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 22:48:19,536 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 22:48:19,536 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 22:48:19,536 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 22:48:19,536 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 22:48:19,536 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 22:48:19,537 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 22:48:19,537 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 22:48:19,537 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 22:48:19,537 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 22:48:19,537 INFO L133 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_5ddb80f6-f541-4120-ac39-bfe5f4fde71d/bin-2019/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 -> adac677e86c3589742609fbf864b49e4d47efc96 [2018-12-02 22:48:19,554 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 22:48:19,561 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 22:48:19,563 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 22:48:19,564 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 22:48:19,564 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 22:48:19,564 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5ddb80f6-f541-4120-ac39-bfe5f4fde71d/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/rfi004_pso.oepc_false-unreach-call.i [2018-12-02 22:48:19,598 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5ddb80f6-f541-4120-ac39-bfe5f4fde71d/bin-2019/utaipan/data/27c2e0ae8/6d5d0df013cc40be8846ae6d887ff592/FLAG4e1e929b5 [2018-12-02 22:48:20,041 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 22:48:20,042 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5ddb80f6-f541-4120-ac39-bfe5f4fde71d/sv-benchmarks/c/pthread-wmm/rfi004_pso.oepc_false-unreach-call.i [2018-12-02 22:48:20,049 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5ddb80f6-f541-4120-ac39-bfe5f4fde71d/bin-2019/utaipan/data/27c2e0ae8/6d5d0df013cc40be8846ae6d887ff592/FLAG4e1e929b5 [2018-12-02 22:48:20,057 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5ddb80f6-f541-4120-ac39-bfe5f4fde71d/bin-2019/utaipan/data/27c2e0ae8/6d5d0df013cc40be8846ae6d887ff592 [2018-12-02 22:48:20,059 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 22:48:20,060 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 22:48:20,060 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 22:48:20,060 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 22:48:20,062 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 22:48:20,063 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:48:20" (1/1) ... [2018-12-02 22:48:20,064 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ca176b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:48:20, skipping insertion in model container [2018-12-02 22:48:20,064 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:48:20" (1/1) ... [2018-12-02 22:48:20,068 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 22:48:20,088 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 22:48:20,262 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 22:48:20,270 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 22:48:20,339 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 22:48:20,369 INFO L195 MainTranslator]: Completed translation [2018-12-02 22:48:20,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:48:20 WrapperNode [2018-12-02 22:48:20,369 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 22:48:20,370 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 22:48:20,370 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 22:48:20,370 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 22:48:20,375 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:48:20" (1/1) ... [2018-12-02 22:48:20,385 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:48:20" (1/1) ... [2018-12-02 22:48:20,401 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 22:48:20,401 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 22:48:20,401 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 22:48:20,401 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 22:48:20,407 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:48:20" (1/1) ... [2018-12-02 22:48:20,407 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:48:20" (1/1) ... [2018-12-02 22:48:20,410 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:48:20" (1/1) ... [2018-12-02 22:48:20,410 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:48:20" (1/1) ... [2018-12-02 22:48:20,415 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:48:20" (1/1) ... [2018-12-02 22:48:20,417 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:48:20" (1/1) ... [2018-12-02 22:48:20,418 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:48:20" (1/1) ... [2018-12-02 22:48:20,421 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 22:48:20,421 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 22:48:20,421 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 22:48:20,421 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 22:48:20,422 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:48:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5ddb80f6-f541-4120-ac39-bfe5f4fde71d/bin-2019/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 [2018-12-02 22:48:20,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 22:48:20,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 22:48:20,455 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 22:48:20,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 22:48:20,455 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 22:48:20,455 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 22:48:20,455 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 22:48:20,455 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 22:48:20,455 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 22:48:20,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 22:48:20,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 22:48:20,456 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-02 22:48:20,782 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 22:48:20,783 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 22:48:20,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:48:20 BoogieIcfgContainer [2018-12-02 22:48:20,783 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 22:48:20,783 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 22:48:20,784 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 22:48:20,786 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 22:48:20,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 10:48:20" (1/3) ... [2018-12-02 22:48:20,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a046eed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 10:48:20, skipping insertion in model container [2018-12-02 22:48:20,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:48:20" (2/3) ... [2018-12-02 22:48:20,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a046eed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 10:48:20, skipping insertion in model container [2018-12-02 22:48:20,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:48:20" (3/3) ... [2018-12-02 22:48:20,788 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi004_pso.oepc_false-unreach-call.i [2018-12-02 22:48:20,818 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,818 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,818 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,818 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,818 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,818 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,818 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,818 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,819 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,819 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,819 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,819 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,819 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,819 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,819 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,820 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,820 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,820 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,820 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,820 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,820 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,820 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,821 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,821 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,821 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,821 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,821 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,822 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,822 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,822 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,822 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,822 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,822 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,822 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,823 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,823 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,823 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,823 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,823 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,824 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,824 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,824 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,824 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,824 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,824 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,824 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,825 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,825 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,825 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,825 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,825 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,825 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,825 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,825 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,826 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,826 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,826 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,826 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,826 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,826 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,827 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,827 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,827 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,827 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,827 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,827 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,827 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,828 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,828 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,828 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,828 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,828 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,828 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,829 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,829 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,829 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,829 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,829 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,829 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,830 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,830 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,830 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,830 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,830 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,830 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,830 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,831 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,831 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,831 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,831 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,831 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,831 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,831 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,832 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,832 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,832 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,832 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,832 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,832 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,833 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,833 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,833 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,833 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,833 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,833 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,833 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,834 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,834 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,834 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,834 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,834 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,834 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,834 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,835 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,835 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,835 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,835 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,835 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,835 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,835 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,836 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,836 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,836 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,836 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,836 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,836 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,836 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,837 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,837 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,837 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,837 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,837 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,837 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,838 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,838 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,838 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 22:48:20,842 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 22:48:20,842 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 22:48:20,849 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 22:48:20,860 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 22:48:20,876 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 22:48:20,876 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 22:48:20,876 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 22:48:20,876 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 22:48:20,876 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 22:48:20,876 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 22:48:20,877 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 22:48:20,877 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 22:48:20,883 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 132places, 164 transitions [2018-12-02 22:48:21,965 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27856 states. [2018-12-02 22:48:21,966 INFO L276 IsEmpty]: Start isEmpty. Operand 27856 states. [2018-12-02 22:48:21,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-02 22:48:21,971 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:48:21,972 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:48:21,973 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:48:21,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:48:21,976 INFO L82 PathProgramCache]: Analyzing trace with hash -31372928, now seen corresponding path program 1 times [2018-12-02 22:48:21,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:48:22,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:48:22,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:48:22,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:48:22,012 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:48:22,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:48:22,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:48:22,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:48:22,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 22:48:22,110 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:48:22,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 22:48:22,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 22:48:22,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 22:48:22,123 INFO L87 Difference]: Start difference. First operand 27856 states. Second operand 4 states. [2018-12-02 22:48:22,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:48:22,512 INFO L93 Difference]: Finished difference Result 47768 states and 183119 transitions. [2018-12-02 22:48:22,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 22:48:22,514 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-12-02 22:48:22,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:48:22,720 INFO L225 Difference]: With dead ends: 47768 [2018-12-02 22:48:22,720 INFO L226 Difference]: Without dead ends: 34608 [2018-12-02 22:48:22,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 22:48:22,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34608 states. [2018-12-02 22:48:23,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34608 to 21756. [2018-12-02 22:48:23,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21756 states. [2018-12-02 22:48:23,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21756 states to 21756 states and 83441 transitions. [2018-12-02 22:48:23,267 INFO L78 Accepts]: Start accepts. Automaton has 21756 states and 83441 transitions. Word has length 39 [2018-12-02 22:48:23,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:48:23,267 INFO L480 AbstractCegarLoop]: Abstraction has 21756 states and 83441 transitions. [2018-12-02 22:48:23,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 22:48:23,267 INFO L276 IsEmpty]: Start isEmpty. Operand 21756 states and 83441 transitions. [2018-12-02 22:48:23,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-02 22:48:23,272 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:48:23,272 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:48:23,272 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:48:23,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:48:23,273 INFO L82 PathProgramCache]: Analyzing trace with hash -954263015, now seen corresponding path program 1 times [2018-12-02 22:48:23,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:48:23,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:48:23,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:48:23,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:48:23,276 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:48:23,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:48:23,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:48:23,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:48:23,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 22:48:23,324 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:48:23,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 22:48:23,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 22:48:23,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 22:48:23,326 INFO L87 Difference]: Start difference. First operand 21756 states and 83441 transitions. Second operand 4 states. [2018-12-02 22:48:23,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:48:23,383 INFO L93 Difference]: Finished difference Result 7170 states and 23626 transitions. [2018-12-02 22:48:23,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 22:48:23,384 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-12-02 22:48:23,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:48:23,394 INFO L225 Difference]: With dead ends: 7170 [2018-12-02 22:48:23,395 INFO L226 Difference]: Without dead ends: 6324 [2018-12-02 22:48:23,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 22:48:23,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6324 states. [2018-12-02 22:48:23,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6324 to 6324. [2018-12-02 22:48:23,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6324 states. [2018-12-02 22:48:23,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6324 states to 6324 states and 20698 transitions. [2018-12-02 22:48:23,489 INFO L78 Accepts]: Start accepts. Automaton has 6324 states and 20698 transitions. Word has length 47 [2018-12-02 22:48:23,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:48:23,489 INFO L480 AbstractCegarLoop]: Abstraction has 6324 states and 20698 transitions. [2018-12-02 22:48:23,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 22:48:23,489 INFO L276 IsEmpty]: Start isEmpty. Operand 6324 states and 20698 transitions. [2018-12-02 22:48:23,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-02 22:48:23,490 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:48:23,491 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:48:23,491 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:48:23,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:48:23,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1367871073, now seen corresponding path program 1 times [2018-12-02 22:48:23,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:48:23,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:48:23,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:48:23,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:48:23,494 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:48:23,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:48:23,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:48:23,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:48:23,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 22:48:23,616 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:48:23,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 22:48:23,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 22:48:23,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 22:48:23,617 INFO L87 Difference]: Start difference. First operand 6324 states and 20698 transitions. Second operand 5 states. [2018-12-02 22:48:23,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:48:23,791 INFO L93 Difference]: Finished difference Result 12020 states and 38784 transitions. [2018-12-02 22:48:23,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 22:48:23,792 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-12-02 22:48:23,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:48:23,809 INFO L225 Difference]: With dead ends: 12020 [2018-12-02 22:48:23,809 INFO L226 Difference]: Without dead ends: 11945 [2018-12-02 22:48:23,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 22:48:23,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11945 states. [2018-12-02 22:48:23,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11945 to 8289. [2018-12-02 22:48:23,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8289 states. [2018-12-02 22:48:23,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8289 states to 8289 states and 26551 transitions. [2018-12-02 22:48:23,913 INFO L78 Accepts]: Start accepts. Automaton has 8289 states and 26551 transitions. Word has length 48 [2018-12-02 22:48:23,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:48:23,914 INFO L480 AbstractCegarLoop]: Abstraction has 8289 states and 26551 transitions. [2018-12-02 22:48:23,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 22:48:23,914 INFO L276 IsEmpty]: Start isEmpty. Operand 8289 states and 26551 transitions. [2018-12-02 22:48:23,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-02 22:48:23,915 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:48:23,915 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:48:23,915 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:48:23,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:48:23,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1372813561, now seen corresponding path program 1 times [2018-12-02 22:48:23,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:48:23,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:48:23,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:48:23,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:48:23,918 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:48:23,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:48:23,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:48:23,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:48:23,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 22:48:23,951 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:48:23,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 22:48:23,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 22:48:23,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:48:23,952 INFO L87 Difference]: Start difference. First operand 8289 states and 26551 transitions. Second operand 3 states. [2018-12-02 22:48:23,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:48:23,994 INFO L93 Difference]: Finished difference Result 10985 states and 34706 transitions. [2018-12-02 22:48:23,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 22:48:23,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-02 22:48:23,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:48:24,012 INFO L225 Difference]: With dead ends: 10985 [2018-12-02 22:48:24,012 INFO L226 Difference]: Without dead ends: 10981 [2018-12-02 22:48:24,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:48:24,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10981 states. [2018-12-02 22:48:24,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10981 to 8507. [2018-12-02 22:48:24,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8507 states. [2018-12-02 22:48:24,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8507 states to 8507 states and 26987 transitions. [2018-12-02 22:48:24,115 INFO L78 Accepts]: Start accepts. Automaton has 8507 states and 26987 transitions. Word has length 50 [2018-12-02 22:48:24,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:48:24,115 INFO L480 AbstractCegarLoop]: Abstraction has 8507 states and 26987 transitions. [2018-12-02 22:48:24,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 22:48:24,115 INFO L276 IsEmpty]: Start isEmpty. Operand 8507 states and 26987 transitions. [2018-12-02 22:48:24,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-02 22:48:24,116 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:48:24,116 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:48:24,116 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:48:24,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:48:24,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1505170194, now seen corresponding path program 1 times [2018-12-02 22:48:24,117 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:48:24,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:48:24,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:48:24,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:48:24,118 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:48:24,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:48:24,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:48:24,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:48:24,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 22:48:24,168 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:48:24,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 22:48:24,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 22:48:24,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 22:48:24,168 INFO L87 Difference]: Start difference. First operand 8507 states and 26987 transitions. Second operand 6 states. [2018-12-02 22:48:24,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:48:24,415 INFO L93 Difference]: Finished difference Result 11923 states and 37198 transitions. [2018-12-02 22:48:24,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 22:48:24,415 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-12-02 22:48:24,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:48:24,428 INFO L225 Difference]: With dead ends: 11923 [2018-12-02 22:48:24,428 INFO L226 Difference]: Without dead ends: 11826 [2018-12-02 22:48:24,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-12-02 22:48:24,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11826 states. [2018-12-02 22:48:24,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11826 to 9281. [2018-12-02 22:48:24,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9281 states. [2018-12-02 22:48:24,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9281 states to 9281 states and 29431 transitions. [2018-12-02 22:48:24,580 INFO L78 Accepts]: Start accepts. Automaton has 9281 states and 29431 transitions. Word has length 54 [2018-12-02 22:48:24,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:48:24,581 INFO L480 AbstractCegarLoop]: Abstraction has 9281 states and 29431 transitions. [2018-12-02 22:48:24,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 22:48:24,581 INFO L276 IsEmpty]: Start isEmpty. Operand 9281 states and 29431 transitions. [2018-12-02 22:48:24,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-02 22:48:24,585 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:48:24,585 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:48:24,585 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:48:24,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:48:24,585 INFO L82 PathProgramCache]: Analyzing trace with hash 2067258406, now seen corresponding path program 1 times [2018-12-02 22:48:24,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:48:24,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:48:24,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:48:24,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:48:24,587 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:48:24,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:48:24,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:48:24,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:48:24,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 22:48:24,618 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:48:24,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 22:48:24,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 22:48:24,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 22:48:24,618 INFO L87 Difference]: Start difference. First operand 9281 states and 29431 transitions. Second operand 4 states. [2018-12-02 22:48:24,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:48:24,711 INFO L93 Difference]: Finished difference Result 10900 states and 34382 transitions. [2018-12-02 22:48:24,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 22:48:24,712 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-02 22:48:24,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:48:24,724 INFO L225 Difference]: With dead ends: 10900 [2018-12-02 22:48:24,724 INFO L226 Difference]: Without dead ends: 10900 [2018-12-02 22:48:24,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 22:48:24,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10900 states. [2018-12-02 22:48:24,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10900 to 9932. [2018-12-02 22:48:24,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9932 states. [2018-12-02 22:48:24,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9932 states to 9932 states and 31408 transitions. [2018-12-02 22:48:24,826 INFO L78 Accepts]: Start accepts. Automaton has 9932 states and 31408 transitions. Word has length 64 [2018-12-02 22:48:24,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:48:24,826 INFO L480 AbstractCegarLoop]: Abstraction has 9932 states and 31408 transitions. [2018-12-02 22:48:24,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 22:48:24,826 INFO L276 IsEmpty]: Start isEmpty. Operand 9932 states and 31408 transitions. [2018-12-02 22:48:24,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-02 22:48:24,830 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:48:24,830 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:48:24,831 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:48:24,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:48:24,831 INFO L82 PathProgramCache]: Analyzing trace with hash -484898555, now seen corresponding path program 1 times [2018-12-02 22:48:24,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:48:24,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:48:24,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:48:24,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:48:24,832 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:48:24,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:48:24,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:48:24,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:48:24,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 22:48:24,872 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:48:24,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 22:48:24,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 22:48:24,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 22:48:24,873 INFO L87 Difference]: Start difference. First operand 9932 states and 31408 transitions. Second operand 6 states. [2018-12-02 22:48:25,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:48:25,190 INFO L93 Difference]: Finished difference Result 21763 states and 67780 transitions. [2018-12-02 22:48:25,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 22:48:25,190 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-12-02 22:48:25,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:48:25,213 INFO L225 Difference]: With dead ends: 21763 [2018-12-02 22:48:25,213 INFO L226 Difference]: Without dead ends: 21699 [2018-12-02 22:48:25,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-02 22:48:25,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21699 states. [2018-12-02 22:48:25,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21699 to 13157. [2018-12-02 22:48:25,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13157 states. [2018-12-02 22:48:25,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13157 states to 13157 states and 40989 transitions. [2018-12-02 22:48:25,385 INFO L78 Accepts]: Start accepts. Automaton has 13157 states and 40989 transitions. Word has length 64 [2018-12-02 22:48:25,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:48:25,385 INFO L480 AbstractCegarLoop]: Abstraction has 13157 states and 40989 transitions. [2018-12-02 22:48:25,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 22:48:25,385 INFO L276 IsEmpty]: Start isEmpty. Operand 13157 states and 40989 transitions. [2018-12-02 22:48:25,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 22:48:25,391 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:48:25,391 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:48:25,391 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:48:25,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:48:25,391 INFO L82 PathProgramCache]: Analyzing trace with hash 708445986, now seen corresponding path program 1 times [2018-12-02 22:48:25,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:48:25,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:48:25,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:48:25,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:48:25,393 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:48:25,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:48:25,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:48:25,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:48:25,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 22:48:25,439 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:48:25,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 22:48:25,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 22:48:25,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 22:48:25,440 INFO L87 Difference]: Start difference. First operand 13157 states and 40989 transitions. Second operand 5 states. [2018-12-02 22:48:25,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:48:25,675 INFO L93 Difference]: Finished difference Result 19275 states and 58649 transitions. [2018-12-02 22:48:25,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 22:48:25,675 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-12-02 22:48:25,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:48:25,698 INFO L225 Difference]: With dead ends: 19275 [2018-12-02 22:48:25,698 INFO L226 Difference]: Without dead ends: 19275 [2018-12-02 22:48:25,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-12-02 22:48:25,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19275 states. [2018-12-02 22:48:25,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19275 to 14988. [2018-12-02 22:48:25,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14988 states. [2018-12-02 22:48:25,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14988 states to 14988 states and 46076 transitions. [2018-12-02 22:48:25,907 INFO L78 Accepts]: Start accepts. Automaton has 14988 states and 46076 transitions. Word has length 66 [2018-12-02 22:48:25,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:48:25,908 INFO L480 AbstractCegarLoop]: Abstraction has 14988 states and 46076 transitions. [2018-12-02 22:48:25,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 22:48:25,908 INFO L276 IsEmpty]: Start isEmpty. Operand 14988 states and 46076 transitions. [2018-12-02 22:48:25,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 22:48:25,916 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:48:25,916 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:48:25,916 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:48:25,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:48:25,916 INFO L82 PathProgramCache]: Analyzing trace with hash 497095073, now seen corresponding path program 1 times [2018-12-02 22:48:25,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:48:25,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:48:25,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:48:25,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:48:25,918 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:48:25,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:48:25,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:48:25,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:48:25,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 22:48:25,953 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:48:25,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 22:48:25,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 22:48:25,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 22:48:25,954 INFO L87 Difference]: Start difference. First operand 14988 states and 46076 transitions. Second operand 4 states. [2018-12-02 22:48:26,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:48:26,149 INFO L93 Difference]: Finished difference Result 18810 states and 57063 transitions. [2018-12-02 22:48:26,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 22:48:26,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-12-02 22:48:26,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:48:26,170 INFO L225 Difference]: With dead ends: 18810 [2018-12-02 22:48:26,171 INFO L226 Difference]: Without dead ends: 18810 [2018-12-02 22:48:26,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 22:48:26,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18810 states. [2018-12-02 22:48:26,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18810 to 15263. [2018-12-02 22:48:26,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15263 states. [2018-12-02 22:48:26,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15263 states to 15263 states and 46864 transitions. [2018-12-02 22:48:26,333 INFO L78 Accepts]: Start accepts. Automaton has 15263 states and 46864 transitions. Word has length 66 [2018-12-02 22:48:26,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:48:26,333 INFO L480 AbstractCegarLoop]: Abstraction has 15263 states and 46864 transitions. [2018-12-02 22:48:26,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 22:48:26,333 INFO L276 IsEmpty]: Start isEmpty. Operand 15263 states and 46864 transitions. [2018-12-02 22:48:26,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 22:48:26,340 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:48:26,340 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:48:26,340 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:48:26,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:48:26,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1580114270, now seen corresponding path program 1 times [2018-12-02 22:48:26,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:48:26,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:48:26,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:48:26,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:48:26,342 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:48:26,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:48:26,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:48:26,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:48:26,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 22:48:26,371 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:48:26,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 22:48:26,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 22:48:26,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:48:26,372 INFO L87 Difference]: Start difference. First operand 15263 states and 46864 transitions. Second operand 3 states. [2018-12-02 22:48:26,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:48:26,481 INFO L93 Difference]: Finished difference Result 15699 states and 48054 transitions. [2018-12-02 22:48:26,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 22:48:26,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-12-02 22:48:26,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:48:26,497 INFO L225 Difference]: With dead ends: 15699 [2018-12-02 22:48:26,498 INFO L226 Difference]: Without dead ends: 15699 [2018-12-02 22:48:26,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:48:26,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15699 states. [2018-12-02 22:48:26,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15699 to 15481. [2018-12-02 22:48:26,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15481 states. [2018-12-02 22:48:26,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15481 states to 15481 states and 47432 transitions. [2018-12-02 22:48:26,646 INFO L78 Accepts]: Start accepts. Automaton has 15481 states and 47432 transitions. Word has length 66 [2018-12-02 22:48:26,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:48:26,647 INFO L480 AbstractCegarLoop]: Abstraction has 15481 states and 47432 transitions. [2018-12-02 22:48:26,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 22:48:26,647 INFO L276 IsEmpty]: Start isEmpty. Operand 15481 states and 47432 transitions. [2018-12-02 22:48:26,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-02 22:48:26,655 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:48:26,655 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:48:26,655 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:48:26,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:48:26,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1496622296, now seen corresponding path program 1 times [2018-12-02 22:48:26,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:48:26,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:48:26,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:48:26,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:48:26,657 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:48:26,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:48:26,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:48:26,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:48:26,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 22:48:26,700 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:48:26,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 22:48:26,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 22:48:26,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 22:48:26,700 INFO L87 Difference]: Start difference. First operand 15481 states and 47432 transitions. Second operand 6 states. [2018-12-02 22:48:27,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:48:27,232 INFO L93 Difference]: Finished difference Result 18701 states and 56367 transitions. [2018-12-02 22:48:27,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 22:48:27,233 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-12-02 22:48:27,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:48:27,251 INFO L225 Difference]: With dead ends: 18701 [2018-12-02 22:48:27,251 INFO L226 Difference]: Without dead ends: 18701 [2018-12-02 22:48:27,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 22:48:27,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18701 states. [2018-12-02 22:48:27,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18701 to 17377. [2018-12-02 22:48:27,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17377 states. [2018-12-02 22:48:27,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17377 states to 17377 states and 52698 transitions. [2018-12-02 22:48:27,488 INFO L78 Accepts]: Start accepts. Automaton has 17377 states and 52698 transitions. Word has length 68 [2018-12-02 22:48:27,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:48:27,488 INFO L480 AbstractCegarLoop]: Abstraction has 17377 states and 52698 transitions. [2018-12-02 22:48:27,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 22:48:27,488 INFO L276 IsEmpty]: Start isEmpty. Operand 17377 states and 52698 transitions. [2018-12-02 22:48:27,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-02 22:48:27,496 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:48:27,496 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:48:27,496 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:48:27,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:48:27,496 INFO L82 PathProgramCache]: Analyzing trace with hash 721135657, now seen corresponding path program 1 times [2018-12-02 22:48:27,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:48:27,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:48:27,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:48:27,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:48:27,497 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:48:27,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:48:27,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:48:27,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:48:27,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 22:48:27,547 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:48:27,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 22:48:27,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 22:48:27,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 22:48:27,548 INFO L87 Difference]: Start difference. First operand 17377 states and 52698 transitions. Second operand 6 states. [2018-12-02 22:48:27,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:48:27,740 INFO L93 Difference]: Finished difference Result 19150 states and 57148 transitions. [2018-12-02 22:48:27,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 22:48:27,741 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-12-02 22:48:27,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:48:27,759 INFO L225 Difference]: With dead ends: 19150 [2018-12-02 22:48:27,759 INFO L226 Difference]: Without dead ends: 19150 [2018-12-02 22:48:27,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-02 22:48:27,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19150 states. [2018-12-02 22:48:27,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19150 to 17509. [2018-12-02 22:48:27,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17509 states. [2018-12-02 22:48:27,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17509 states to 17509 states and 52637 transitions. [2018-12-02 22:48:27,930 INFO L78 Accepts]: Start accepts. Automaton has 17509 states and 52637 transitions. Word has length 68 [2018-12-02 22:48:27,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:48:27,930 INFO L480 AbstractCegarLoop]: Abstraction has 17509 states and 52637 transitions. [2018-12-02 22:48:27,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 22:48:27,930 INFO L276 IsEmpty]: Start isEmpty. Operand 17509 states and 52637 transitions. [2018-12-02 22:48:27,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-02 22:48:27,939 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:48:27,939 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:48:27,939 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:48:27,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:48:27,940 INFO L82 PathProgramCache]: Analyzing trace with hash 932486570, now seen corresponding path program 1 times [2018-12-02 22:48:27,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:48:27,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:48:27,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:48:27,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:48:27,941 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:48:27,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:48:27,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:48:27,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:48:27,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 22:48:27,981 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:48:27,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 22:48:27,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 22:48:27,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 22:48:27,982 INFO L87 Difference]: Start difference. First operand 17509 states and 52637 transitions. Second operand 5 states. [2018-12-02 22:48:28,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:48:28,179 INFO L93 Difference]: Finished difference Result 21589 states and 64352 transitions. [2018-12-02 22:48:28,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 22:48:28,179 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-12-02 22:48:28,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:48:28,200 INFO L225 Difference]: With dead ends: 21589 [2018-12-02 22:48:28,200 INFO L226 Difference]: Without dead ends: 21589 [2018-12-02 22:48:28,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 22:48:28,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21589 states. [2018-12-02 22:48:28,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21589 to 18595. [2018-12-02 22:48:28,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18595 states. [2018-12-02 22:48:28,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18595 states to 18595 states and 55396 transitions. [2018-12-02 22:48:28,385 INFO L78 Accepts]: Start accepts. Automaton has 18595 states and 55396 transitions. Word has length 68 [2018-12-02 22:48:28,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:48:28,385 INFO L480 AbstractCegarLoop]: Abstraction has 18595 states and 55396 transitions. [2018-12-02 22:48:28,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 22:48:28,385 INFO L276 IsEmpty]: Start isEmpty. Operand 18595 states and 55396 transitions. [2018-12-02 22:48:28,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-02 22:48:28,394 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:48:28,394 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:48:28,394 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:48:28,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:48:28,395 INFO L82 PathProgramCache]: Analyzing trace with hash 421952393, now seen corresponding path program 1 times [2018-12-02 22:48:28,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:48:28,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:48:28,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:48:28,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:48:28,396 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:48:28,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:48:28,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:48:28,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:48:28,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 22:48:28,440 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:48:28,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 22:48:28,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 22:48:28,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 22:48:28,440 INFO L87 Difference]: Start difference. First operand 18595 states and 55396 transitions. Second operand 5 states. [2018-12-02 22:48:28,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:48:28,665 INFO L93 Difference]: Finished difference Result 27216 states and 80202 transitions. [2018-12-02 22:48:28,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 22:48:28,665 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-12-02 22:48:28,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:48:28,693 INFO L225 Difference]: With dead ends: 27216 [2018-12-02 22:48:28,693 INFO L226 Difference]: Without dead ends: 27216 [2018-12-02 22:48:28,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 22:48:28,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27216 states. [2018-12-02 22:48:28,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27216 to 21398. [2018-12-02 22:48:28,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21398 states. [2018-12-02 22:48:28,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21398 states to 21398 states and 63361 transitions. [2018-12-02 22:48:28,956 INFO L78 Accepts]: Start accepts. Automaton has 21398 states and 63361 transitions. Word has length 68 [2018-12-02 22:48:28,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:48:28,956 INFO L480 AbstractCegarLoop]: Abstraction has 21398 states and 63361 transitions. [2018-12-02 22:48:28,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 22:48:28,956 INFO L276 IsEmpty]: Start isEmpty. Operand 21398 states and 63361 transitions. [2018-12-02 22:48:28,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-02 22:48:28,965 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:48:28,965 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:48:28,965 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:48:28,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:48:28,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1385502070, now seen corresponding path program 1 times [2018-12-02 22:48:28,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:48:28,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:48:28,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:48:28,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:48:28,966 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:48:28,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:48:29,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:48:29,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:48:29,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 22:48:29,028 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:48:29,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 22:48:29,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 22:48:29,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 22:48:29,029 INFO L87 Difference]: Start difference. First operand 21398 states and 63361 transitions. Second operand 6 states. [2018-12-02 22:48:29,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:48:29,483 INFO L93 Difference]: Finished difference Result 35018 states and 103808 transitions. [2018-12-02 22:48:29,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 22:48:29,483 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-12-02 22:48:29,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:48:29,526 INFO L225 Difference]: With dead ends: 35018 [2018-12-02 22:48:29,526 INFO L226 Difference]: Without dead ends: 35018 [2018-12-02 22:48:29,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-02 22:48:29,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35018 states. [2018-12-02 22:48:29,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35018 to 27706. [2018-12-02 22:48:29,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27706 states. [2018-12-02 22:48:29,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27706 states to 27706 states and 83160 transitions. [2018-12-02 22:48:29,904 INFO L78 Accepts]: Start accepts. Automaton has 27706 states and 83160 transitions. Word has length 68 [2018-12-02 22:48:29,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:48:29,904 INFO L480 AbstractCegarLoop]: Abstraction has 27706 states and 83160 transitions. [2018-12-02 22:48:29,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 22:48:29,905 INFO L276 IsEmpty]: Start isEmpty. Operand 27706 states and 83160 transitions. [2018-12-02 22:48:29,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-02 22:48:29,918 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:48:29,919 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:48:29,919 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:48:29,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:48:29,919 INFO L82 PathProgramCache]: Analyzing trace with hash -497998389, now seen corresponding path program 1 times [2018-12-02 22:48:29,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:48:29,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:48:29,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:48:29,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:48:29,920 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:48:29,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:48:29,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:48:29,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:48:29,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 22:48:29,960 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:48:29,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 22:48:29,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 22:48:29,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 22:48:29,961 INFO L87 Difference]: Start difference. First operand 27706 states and 83160 transitions. Second operand 4 states. [2018-12-02 22:48:30,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:48:30,270 INFO L93 Difference]: Finished difference Result 30486 states and 90397 transitions. [2018-12-02 22:48:30,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 22:48:30,271 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2018-12-02 22:48:30,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:48:30,303 INFO L225 Difference]: With dead ends: 30486 [2018-12-02 22:48:30,303 INFO L226 Difference]: Without dead ends: 29906 [2018-12-02 22:48:30,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 22:48:30,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29906 states. [2018-12-02 22:48:30,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29906 to 27610. [2018-12-02 22:48:30,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27610 states. [2018-12-02 22:48:30,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27610 states to 27610 states and 82079 transitions. [2018-12-02 22:48:30,598 INFO L78 Accepts]: Start accepts. Automaton has 27610 states and 82079 transitions. Word has length 68 [2018-12-02 22:48:30,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:48:30,598 INFO L480 AbstractCegarLoop]: Abstraction has 27610 states and 82079 transitions. [2018-12-02 22:48:30,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 22:48:30,599 INFO L276 IsEmpty]: Start isEmpty. Operand 27610 states and 82079 transitions. [2018-12-02 22:48:30,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-02 22:48:30,610 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:48:30,610 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:48:30,610 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:48:30,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:48:30,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1112513867, now seen corresponding path program 1 times [2018-12-02 22:48:30,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:48:30,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:48:30,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:48:30,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:48:30,612 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:48:30,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:48:30,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:48:30,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:48:30,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 22:48:30,687 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:48:30,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 22:48:30,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 22:48:30,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-02 22:48:30,687 INFO L87 Difference]: Start difference. First operand 27610 states and 82079 transitions. Second operand 9 states. [2018-12-02 22:48:31,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:48:31,066 INFO L93 Difference]: Finished difference Result 34850 states and 102928 transitions. [2018-12-02 22:48:31,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 22:48:31,067 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2018-12-02 22:48:31,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:48:31,103 INFO L225 Difference]: With dead ends: 34850 [2018-12-02 22:48:31,104 INFO L226 Difference]: Without dead ends: 34850 [2018-12-02 22:48:31,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-02 22:48:31,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34850 states. [2018-12-02 22:48:31,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34850 to 29288. [2018-12-02 22:48:31,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29288 states. [2018-12-02 22:48:31,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29288 states to 29288 states and 87100 transitions. [2018-12-02 22:48:31,425 INFO L78 Accepts]: Start accepts. Automaton has 29288 states and 87100 transitions. Word has length 68 [2018-12-02 22:48:31,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:48:31,425 INFO L480 AbstractCegarLoop]: Abstraction has 29288 states and 87100 transitions. [2018-12-02 22:48:31,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 22:48:31,425 INFO L276 IsEmpty]: Start isEmpty. Operand 29288 states and 87100 transitions. [2018-12-02 22:48:31,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-02 22:48:31,436 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:48:31,437 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:48:31,437 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:48:31,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:48:31,437 INFO L82 PathProgramCache]: Analyzing trace with hash 2000017548, now seen corresponding path program 1 times [2018-12-02 22:48:31,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:48:31,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:48:31,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:48:31,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:48:31,438 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:48:31,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:48:31,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:48:31,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:48:31,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 22:48:31,471 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:48:31,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 22:48:31,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 22:48:31,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 22:48:31,472 INFO L87 Difference]: Start difference. First operand 29288 states and 87100 transitions. Second operand 5 states. [2018-12-02 22:48:31,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:48:31,512 INFO L93 Difference]: Finished difference Result 7664 states and 18502 transitions. [2018-12-02 22:48:31,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 22:48:31,513 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-12-02 22:48:31,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:48:31,517 INFO L225 Difference]: With dead ends: 7664 [2018-12-02 22:48:31,517 INFO L226 Difference]: Without dead ends: 5913 [2018-12-02 22:48:31,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 22:48:31,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5913 states. [2018-12-02 22:48:31,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5913 to 4971. [2018-12-02 22:48:31,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4971 states. [2018-12-02 22:48:31,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4971 states to 4971 states and 11771 transitions. [2018-12-02 22:48:31,580 INFO L78 Accepts]: Start accepts. Automaton has 4971 states and 11771 transitions. Word has length 68 [2018-12-02 22:48:31,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:48:31,580 INFO L480 AbstractCegarLoop]: Abstraction has 4971 states and 11771 transitions. [2018-12-02 22:48:31,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 22:48:31,580 INFO L276 IsEmpty]: Start isEmpty. Operand 4971 states and 11771 transitions. [2018-12-02 22:48:31,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-02 22:48:31,584 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:48:31,584 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:48:31,585 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:48:31,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:48:31,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1506475877, now seen corresponding path program 1 times [2018-12-02 22:48:31,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:48:31,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:48:31,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:48:31,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:48:31,586 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:48:31,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:48:31,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:48:31,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:48:31,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 22:48:31,619 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:48:31,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 22:48:31,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 22:48:31,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 22:48:31,620 INFO L87 Difference]: Start difference. First operand 4971 states and 11771 transitions. Second operand 5 states. [2018-12-02 22:48:31,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:48:31,758 INFO L93 Difference]: Finished difference Result 6177 states and 14425 transitions. [2018-12-02 22:48:31,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 22:48:31,758 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2018-12-02 22:48:31,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:48:31,762 INFO L225 Difference]: With dead ends: 6177 [2018-12-02 22:48:31,762 INFO L226 Difference]: Without dead ends: 6143 [2018-12-02 22:48:31,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 22:48:31,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6143 states. [2018-12-02 22:48:31,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6143 to 5262. [2018-12-02 22:48:31,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5262 states. [2018-12-02 22:48:31,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5262 states to 5262 states and 12356 transitions. [2018-12-02 22:48:31,799 INFO L78 Accepts]: Start accepts. Automaton has 5262 states and 12356 transitions. Word has length 83 [2018-12-02 22:48:31,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:48:31,800 INFO L480 AbstractCegarLoop]: Abstraction has 5262 states and 12356 transitions. [2018-12-02 22:48:31,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 22:48:31,800 INFO L276 IsEmpty]: Start isEmpty. Operand 5262 states and 12356 transitions. [2018-12-02 22:48:31,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-02 22:48:31,803 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:48:31,803 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:48:31,803 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:48:31,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:48:31,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1808148118, now seen corresponding path program 1 times [2018-12-02 22:48:31,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:48:31,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:48:31,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:48:31,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:48:31,805 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:48:31,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:48:31,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:48:31,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:48:31,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 22:48:31,853 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:48:31,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 22:48:31,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 22:48:31,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 22:48:31,853 INFO L87 Difference]: Start difference. First operand 5262 states and 12356 transitions. Second operand 6 states. [2018-12-02 22:48:32,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:48:32,026 INFO L93 Difference]: Finished difference Result 7071 states and 16571 transitions. [2018-12-02 22:48:32,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 22:48:32,027 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-12-02 22:48:32,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:48:32,031 INFO L225 Difference]: With dead ends: 7071 [2018-12-02 22:48:32,031 INFO L226 Difference]: Without dead ends: 7039 [2018-12-02 22:48:32,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 22:48:32,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7039 states. [2018-12-02 22:48:32,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7039 to 5567. [2018-12-02 22:48:32,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5567 states. [2018-12-02 22:48:32,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5567 states to 5567 states and 13121 transitions. [2018-12-02 22:48:32,073 INFO L78 Accepts]: Start accepts. Automaton has 5567 states and 13121 transitions. Word has length 83 [2018-12-02 22:48:32,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:48:32,073 INFO L480 AbstractCegarLoop]: Abstraction has 5567 states and 13121 transitions. [2018-12-02 22:48:32,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 22:48:32,073 INFO L276 IsEmpty]: Start isEmpty. Operand 5567 states and 13121 transitions. [2018-12-02 22:48:32,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-02 22:48:32,076 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:48:32,076 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:48:32,077 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:48:32,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:48:32,077 INFO L82 PathProgramCache]: Analyzing trace with hash 11196759, now seen corresponding path program 1 times [2018-12-02 22:48:32,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:48:32,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:48:32,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:48:32,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:48:32,078 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:48:32,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:48:32,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:48:32,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:48:32,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 22:48:32,122 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:48:32,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 22:48:32,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 22:48:32,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 22:48:32,123 INFO L87 Difference]: Start difference. First operand 5567 states and 13121 transitions. Second operand 7 states. [2018-12-02 22:48:32,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:48:32,358 INFO L93 Difference]: Finished difference Result 8508 states and 20474 transitions. [2018-12-02 22:48:32,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 22:48:32,358 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2018-12-02 22:48:32,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:48:32,363 INFO L225 Difference]: With dead ends: 8508 [2018-12-02 22:48:32,364 INFO L226 Difference]: Without dead ends: 8508 [2018-12-02 22:48:32,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-12-02 22:48:32,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8508 states. [2018-12-02 22:48:32,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8508 to 6212. [2018-12-02 22:48:32,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6212 states. [2018-12-02 22:48:32,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6212 states to 6212 states and 14765 transitions. [2018-12-02 22:48:32,418 INFO L78 Accepts]: Start accepts. Automaton has 6212 states and 14765 transitions. Word has length 83 [2018-12-02 22:48:32,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:48:32,418 INFO L480 AbstractCegarLoop]: Abstraction has 6212 states and 14765 transitions. [2018-12-02 22:48:32,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 22:48:32,418 INFO L276 IsEmpty]: Start isEmpty. Operand 6212 states and 14765 transitions. [2018-12-02 22:48:32,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-02 22:48:32,422 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:48:32,422 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:48:32,422 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:48:32,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:48:32,422 INFO L82 PathProgramCache]: Analyzing trace with hash 898700440, now seen corresponding path program 1 times [2018-12-02 22:48:32,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:48:32,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:48:32,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:48:32,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:48:32,423 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:48:32,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:48:32,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:48:32,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:48:32,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 22:48:32,460 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:48:32,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 22:48:32,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 22:48:32,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 22:48:32,460 INFO L87 Difference]: Start difference. First operand 6212 states and 14765 transitions. Second operand 6 states. [2018-12-02 22:48:32,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:48:32,641 INFO L93 Difference]: Finished difference Result 7643 states and 17929 transitions. [2018-12-02 22:48:32,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 22:48:32,641 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-12-02 22:48:32,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:48:32,648 INFO L225 Difference]: With dead ends: 7643 [2018-12-02 22:48:32,648 INFO L226 Difference]: Without dead ends: 7643 [2018-12-02 22:48:32,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 22:48:32,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7643 states. [2018-12-02 22:48:32,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7643 to 6085. [2018-12-02 22:48:32,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6085 states. [2018-12-02 22:48:32,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6085 states to 6085 states and 14405 transitions. [2018-12-02 22:48:32,710 INFO L78 Accepts]: Start accepts. Automaton has 6085 states and 14405 transitions. Word has length 83 [2018-12-02 22:48:32,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:48:32,710 INFO L480 AbstractCegarLoop]: Abstraction has 6085 states and 14405 transitions. [2018-12-02 22:48:32,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 22:48:32,710 INFO L276 IsEmpty]: Start isEmpty. Operand 6085 states and 14405 transitions. [2018-12-02 22:48:32,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-02 22:48:32,714 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:48:32,714 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:48:32,714 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:48:32,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:48:32,715 INFO L82 PathProgramCache]: Analyzing trace with hash -2026859530, now seen corresponding path program 1 times [2018-12-02 22:48:32,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:48:32,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:48:32,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:48:32,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:48:32,716 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:48:32,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:48:32,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:48:32,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:48:32,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 22:48:32,795 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:48:32,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 22:48:32,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 22:48:32,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 22:48:32,795 INFO L87 Difference]: Start difference. First operand 6085 states and 14405 transitions. Second operand 6 states. [2018-12-02 22:48:32,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:48:32,875 INFO L93 Difference]: Finished difference Result 5733 states and 13253 transitions. [2018-12-02 22:48:32,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 22:48:32,875 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-12-02 22:48:32,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:48:32,880 INFO L225 Difference]: With dead ends: 5733 [2018-12-02 22:48:32,881 INFO L226 Difference]: Without dead ends: 5733 [2018-12-02 22:48:32,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-02 22:48:32,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5733 states. [2018-12-02 22:48:32,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5733 to 3489. [2018-12-02 22:48:32,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3489 states. [2018-12-02 22:48:32,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3489 states to 3489 states and 8153 transitions. [2018-12-02 22:48:32,914 INFO L78 Accepts]: Start accepts. Automaton has 3489 states and 8153 transitions. Word has length 83 [2018-12-02 22:48:32,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:48:32,915 INFO L480 AbstractCegarLoop]: Abstraction has 3489 states and 8153 transitions. [2018-12-02 22:48:32,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 22:48:32,915 INFO L276 IsEmpty]: Start isEmpty. Operand 3489 states and 8153 transitions. [2018-12-02 22:48:32,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-02 22:48:32,917 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:48:32,917 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:48:32,917 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:48:32,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:48:32,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1085951564, now seen corresponding path program 1 times [2018-12-02 22:48:32,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:48:32,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:48:32,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:48:32,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:48:32,919 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:48:32,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:48:32,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:48:32,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:48:32,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 22:48:32,988 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:48:32,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 22:48:32,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 22:48:32,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 22:48:32,988 INFO L87 Difference]: Start difference. First operand 3489 states and 8153 transitions. Second operand 5 states. [2018-12-02 22:48:33,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:48:33,007 INFO L93 Difference]: Finished difference Result 3489 states and 8137 transitions. [2018-12-02 22:48:33,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 22:48:33,007 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2018-12-02 22:48:33,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:48:33,010 INFO L225 Difference]: With dead ends: 3489 [2018-12-02 22:48:33,010 INFO L226 Difference]: Without dead ends: 3489 [2018-12-02 22:48:33,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 22:48:33,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3489 states. [2018-12-02 22:48:33,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3489 to 3063. [2018-12-02 22:48:33,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3063 states. [2018-12-02 22:48:33,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3063 states to 3063 states and 7125 transitions. [2018-12-02 22:48:33,031 INFO L78 Accepts]: Start accepts. Automaton has 3063 states and 7125 transitions. Word has length 85 [2018-12-02 22:48:33,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:48:33,031 INFO L480 AbstractCegarLoop]: Abstraction has 3063 states and 7125 transitions. [2018-12-02 22:48:33,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 22:48:33,031 INFO L276 IsEmpty]: Start isEmpty. Operand 3063 states and 7125 transitions. [2018-12-02 22:48:33,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-02 22:48:33,033 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:48:33,033 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:48:33,033 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:48:33,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:48:33,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1973455245, now seen corresponding path program 1 times [2018-12-02 22:48:33,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:48:33,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:48:33,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:48:33,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:48:33,034 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:48:33,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:48:33,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:48:33,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:48:33,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 22:48:33,117 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:48:33,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 22:48:33,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 22:48:33,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-02 22:48:33,117 INFO L87 Difference]: Start difference. First operand 3063 states and 7125 transitions. Second operand 10 states. [2018-12-02 22:48:33,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:48:33,851 INFO L93 Difference]: Finished difference Result 5223 states and 12138 transitions. [2018-12-02 22:48:33,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 22:48:33,851 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 85 [2018-12-02 22:48:33,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:48:33,854 INFO L225 Difference]: With dead ends: 5223 [2018-12-02 22:48:33,854 INFO L226 Difference]: Without dead ends: 3650 [2018-12-02 22:48:33,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2018-12-02 22:48:33,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3650 states. [2018-12-02 22:48:33,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3650 to 3140. [2018-12-02 22:48:33,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2018-12-02 22:48:33,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 7230 transitions. [2018-12-02 22:48:33,876 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 7230 transitions. Word has length 85 [2018-12-02 22:48:33,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:48:33,876 INFO L480 AbstractCegarLoop]: Abstraction has 3140 states and 7230 transitions. [2018-12-02 22:48:33,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 22:48:33,876 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 7230 transitions. [2018-12-02 22:48:33,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-02 22:48:33,878 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:48:33,878 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:48:33,878 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:48:33,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:48:33,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1532642072, now seen corresponding path program 1 times [2018-12-02 22:48:33,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:48:33,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:48:33,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:48:33,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:48:33,879 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:48:33,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:48:33,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:48:33,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:48:33,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 22:48:33,932 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:48:33,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 22:48:33,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 22:48:33,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 22:48:33,932 INFO L87 Difference]: Start difference. First operand 3140 states and 7230 transitions. Second operand 6 states. [2018-12-02 22:48:34,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:48:34,020 INFO L93 Difference]: Finished difference Result 3608 states and 8201 transitions. [2018-12-02 22:48:34,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 22:48:34,020 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2018-12-02 22:48:34,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:48:34,022 INFO L225 Difference]: With dead ends: 3608 [2018-12-02 22:48:34,022 INFO L226 Difference]: Without dead ends: 3554 [2018-12-02 22:48:34,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-02 22:48:34,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3554 states. [2018-12-02 22:48:34,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3554 to 3141. [2018-12-02 22:48:34,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3141 states. [2018-12-02 22:48:34,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3141 states to 3141 states and 7165 transitions. [2018-12-02 22:48:34,043 INFO L78 Accepts]: Start accepts. Automaton has 3141 states and 7165 transitions. Word has length 85 [2018-12-02 22:48:34,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:48:34,044 INFO L480 AbstractCegarLoop]: Abstraction has 3141 states and 7165 transitions. [2018-12-02 22:48:34,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 22:48:34,044 INFO L276 IsEmpty]: Start isEmpty. Operand 3141 states and 7165 transitions. [2018-12-02 22:48:34,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-02 22:48:34,045 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:48:34,046 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:48:34,046 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:48:34,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:48:34,046 INFO L82 PathProgramCache]: Analyzing trace with hash -544567271, now seen corresponding path program 2 times [2018-12-02 22:48:34,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:48:34,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:48:34,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:48:34,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:48:34,047 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:48:34,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:48:34,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:48:34,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:48:34,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 22:48:34,135 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:48:34,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 22:48:34,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 22:48:34,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-02 22:48:34,136 INFO L87 Difference]: Start difference. First operand 3141 states and 7165 transitions. Second operand 10 states. [2018-12-02 22:48:34,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:48:34,456 INFO L93 Difference]: Finished difference Result 5998 states and 13744 transitions. [2018-12-02 22:48:34,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 22:48:34,456 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 85 [2018-12-02 22:48:34,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:48:34,458 INFO L225 Difference]: With dead ends: 5998 [2018-12-02 22:48:34,458 INFO L226 Difference]: Without dead ends: 2311 [2018-12-02 22:48:34,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-12-02 22:48:34,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2311 states. [2018-12-02 22:48:34,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2311 to 2311. [2018-12-02 22:48:34,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2311 states. [2018-12-02 22:48:34,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2311 states to 2311 states and 5296 transitions. [2018-12-02 22:48:34,471 INFO L78 Accepts]: Start accepts. Automaton has 2311 states and 5296 transitions. Word has length 85 [2018-12-02 22:48:34,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:48:34,471 INFO L480 AbstractCegarLoop]: Abstraction has 2311 states and 5296 transitions. [2018-12-02 22:48:34,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 22:48:34,471 INFO L276 IsEmpty]: Start isEmpty. Operand 2311 states and 5296 transitions. [2018-12-02 22:48:34,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-02 22:48:34,473 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:48:34,473 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:48:34,473 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:48:34,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:48:34,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1942685255, now seen corresponding path program 3 times [2018-12-02 22:48:34,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:48:34,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:48:34,474 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 22:48:34,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:48:34,474 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:48:34,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:48:34,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:48:34,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:48:34,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 22:48:34,565 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:48:34,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 22:48:34,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 22:48:34,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-02 22:48:34,565 INFO L87 Difference]: Start difference. First operand 2311 states and 5296 transitions. Second operand 11 states. [2018-12-02 22:48:35,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:48:35,053 INFO L93 Difference]: Finished difference Result 3845 states and 8830 transitions. [2018-12-02 22:48:35,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 22:48:35,054 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 85 [2018-12-02 22:48:35,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:48:35,056 INFO L225 Difference]: With dead ends: 3845 [2018-12-02 22:48:35,056 INFO L226 Difference]: Without dead ends: 2506 [2018-12-02 22:48:35,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2018-12-02 22:48:35,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2018-12-02 22:48:35,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 2305. [2018-12-02 22:48:35,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2305 states. [2018-12-02 22:48:35,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2305 states to 2305 states and 5280 transitions. [2018-12-02 22:48:35,076 INFO L78 Accepts]: Start accepts. Automaton has 2305 states and 5280 transitions. Word has length 85 [2018-12-02 22:48:35,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:48:35,076 INFO L480 AbstractCegarLoop]: Abstraction has 2305 states and 5280 transitions. [2018-12-02 22:48:35,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 22:48:35,076 INFO L276 IsEmpty]: Start isEmpty. Operand 2305 states and 5280 transitions. [2018-12-02 22:48:35,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-02 22:48:35,078 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:48:35,078 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:48:35,078 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:48:35,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:48:35,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1542877223, now seen corresponding path program 4 times [2018-12-02 22:48:35,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:48:35,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:48:35,079 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 22:48:35,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:48:35,079 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:48:35,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:48:35,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:48:35,113 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 22:48:35,178 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 22:48:35,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 10:48:35 BasicIcfg [2018-12-02 22:48:35,179 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 22:48:35,179 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 22:48:35,179 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 22:48:35,180 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 22:48:35,180 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:48:20" (3/4) ... [2018-12-02 22:48:35,182 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 22:48:35,243 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5ddb80f6-f541-4120-ac39-bfe5f4fde71d/bin-2019/utaipan/witness.graphml [2018-12-02 22:48:35,243 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 22:48:35,244 INFO L168 Benchmark]: Toolchain (without parser) took 15184.75 ms. Allocated memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: 1.6 GB). Free memory was 952.4 MB in the beginning and 776.1 MB in the end (delta: 176.3 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2018-12-02 22:48:35,245 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 22:48:35,245 INFO L168 Benchmark]: CACSL2BoogieTranslator took 309.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -177.9 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. [2018-12-02 22:48:35,245 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-02 22:48:35,245 INFO L168 Benchmark]: Boogie Preprocessor took 19.73 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 22:48:35,245 INFO L168 Benchmark]: RCFGBuilder took 362.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.4 MB). Peak memory consumption was 48.4 MB. Max. memory is 11.5 GB. [2018-12-02 22:48:35,245 INFO L168 Benchmark]: TraceAbstraction took 14395.72 ms. Allocated memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: 1.4 GB). Free memory was 1.1 GB in the beginning and 809.3 MB in the end (delta: 265.8 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2018-12-02 22:48:35,246 INFO L168 Benchmark]: Witness Printer took 63.91 ms. Allocated memory is still 2.6 GB. Free memory was 809.3 MB in the beginning and 776.1 MB in the end (delta: 33.2 MB). Peak memory consumption was 33.2 MB. Max. memory is 11.5 GB. [2018-12-02 22:48:35,247 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 309.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -177.9 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.73 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 362.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.4 MB). Peak memory consumption was 48.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14395.72 ms. Allocated memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: 1.4 GB). Free memory was 1.1 GB in the beginning and 809.3 MB in the end (delta: 265.8 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. * Witness Printer took 63.91 ms. Allocated memory is still 2.6 GB. Free memory was 809.3 MB in the beginning and 776.1 MB in the end (delta: 33.2 MB). Peak memory consumption was 33.2 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: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L678] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L679] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L680] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L682] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L684] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L685] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L686] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L687] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L688] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L689] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L690] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L691] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L692] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L693] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L694] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L695] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L696] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L697] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L698] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L700] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L701] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L702] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L778] -1 pthread_t t1655; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L779] FCALL, FORK -1 pthread_create(&t1655, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] -1 pthread_t t1656; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] FCALL, FORK -1 pthread_create(&t1656, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L736] 0 y$w_buff1 = y$w_buff0 [L737] 0 y$w_buff0 = 1 [L738] 0 y$w_buff1_used = y$w_buff0_used [L739] 0 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L741] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L742] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L743] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L744] 0 y$r_buff0_thd2 = (_Bool)1 [L747] 0 z = 1 [L750] 0 __unbuffered_p1_EAX = z [L753] 0 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L706] 1 x = 1 [L711] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L712] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L713] 1 y$flush_delayed = weak$$choice2 [L714] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L715] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 0 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L757] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L715] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L716] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L716] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L717] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L717] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L758] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L758] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L759] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 0 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L760] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] 0 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L763] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L718] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L718] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L719] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L719] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L720] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L720] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L721] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L721] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L722] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L723] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L723] 1 y = y$flush_delayed ? y$mem_tmp : y [L724] 1 y$flush_delayed = (_Bool)0 [L729] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L783] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L788] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L788] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L789] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L789] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L790] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L790] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L791] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L794] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 200 locations, 3 error locations. UNSAFE Result, 14.3s OverallTime, 29 OverallIterations, 1 TraceHistogramMax, 7.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7709 SDtfs, 8848 SDslu, 18439 SDs, 0 SdLazy, 7633 SolverSat, 345 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 272 GetRequests, 72 SyntacticMatches, 17 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29288occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 4.0s AutomataMinimizationTime, 28 MinimizatonAttempts, 76979 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 2033 NumberOfCodeBlocks, 2033 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1920 ConstructedInterpolants, 0 QuantifiedInterpolants, 359449 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...