./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe031_rmo.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3ee2cf36-a930-4cda-8b51-936aeb325dc2/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3ee2cf36-a930-4cda-8b51-936aeb325dc2/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3ee2cf36-a930-4cda-8b51-936aeb325dc2/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3ee2cf36-a930-4cda-8b51-936aeb325dc2/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe031_rmo.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3ee2cf36-a930-4cda-8b51-936aeb325dc2/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3ee2cf36-a930-4cda-8b51-936aeb325dc2/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 ae89a5f69c33bb2aef4adfeda449249d64c64d36 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-03 06:37:31,337 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 06:37:31,338 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 06:37:31,345 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 06:37:31,345 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 06:37:31,346 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 06:37:31,346 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 06:37:31,347 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 06:37:31,348 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 06:37:31,348 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 06:37:31,349 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 06:37:31,349 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 06:37:31,349 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 06:37:31,350 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 06:37:31,350 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 06:37:31,351 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 06:37:31,351 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 06:37:31,352 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 06:37:31,353 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 06:37:31,354 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 06:37:31,354 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 06:37:31,355 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 06:37:31,356 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 06:37:31,356 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 06:37:31,356 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 06:37:31,357 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 06:37:31,357 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 06:37:31,357 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 06:37:31,358 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 06:37:31,358 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 06:37:31,358 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 06:37:31,359 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 06:37:31,359 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 06:37:31,359 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 06:37:31,360 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 06:37:31,360 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 06:37:31,360 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3ee2cf36-a930-4cda-8b51-936aeb325dc2/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-03 06:37:31,367 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 06:37:31,367 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 06:37:31,367 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 06:37:31,367 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 06:37:31,367 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 06:37:31,368 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 06:37:31,368 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 06:37:31,368 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 06:37:31,368 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 06:37:31,368 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 06:37:31,368 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 06:37:31,368 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 06:37:31,368 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 06:37:31,369 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 06:37:31,369 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 06:37:31,369 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 06:37:31,369 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 06:37:31,369 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 06:37:31,369 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 06:37:31,369 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 06:37:31,370 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 06:37:31,370 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 06:37:31,370 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 06:37:31,370 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 06:37:31,370 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 06:37:31,370 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 06:37:31,370 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 06:37:31,370 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 06:37:31,371 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 06:37:31,371 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 06:37:31,371 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 06:37:31,371 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 06:37:31,371 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 06:37:31,371 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 06:37:31,371 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 06:37:31,371 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 06:37:31,371 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_3ee2cf36-a930-4cda-8b51-936aeb325dc2/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 -> ae89a5f69c33bb2aef4adfeda449249d64c64d36 [2018-12-03 06:37:31,388 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 06:37:31,395 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 06:37:31,397 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 06:37:31,398 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 06:37:31,398 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 06:37:31,399 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3ee2cf36-a930-4cda-8b51-936aeb325dc2/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/safe031_rmo.opt_false-unreach-call.i [2018-12-03 06:37:31,435 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3ee2cf36-a930-4cda-8b51-936aeb325dc2/bin-2019/utaipan/data/9fd9de74a/43af2c77dc094706baf19f5e47e7a4d4/FLAG4774b0dc0 [2018-12-03 06:37:31,760 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 06:37:31,761 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3ee2cf36-a930-4cda-8b51-936aeb325dc2/sv-benchmarks/c/pthread-wmm/safe031_rmo.opt_false-unreach-call.i [2018-12-03 06:37:31,768 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3ee2cf36-a930-4cda-8b51-936aeb325dc2/bin-2019/utaipan/data/9fd9de74a/43af2c77dc094706baf19f5e47e7a4d4/FLAG4774b0dc0 [2018-12-03 06:37:31,777 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3ee2cf36-a930-4cda-8b51-936aeb325dc2/bin-2019/utaipan/data/9fd9de74a/43af2c77dc094706baf19f5e47e7a4d4 [2018-12-03 06:37:31,779 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 06:37:31,780 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 06:37:31,780 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 06:37:31,780 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 06:37:31,782 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 06:37:31,783 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 06:37:31" (1/1) ... [2018-12-03 06:37:31,785 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@201b218f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:37:31, skipping insertion in model container [2018-12-03 06:37:31,785 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 06:37:31" (1/1) ... [2018-12-03 06:37:31,789 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 06:37:31,810 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 06:37:31,989 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 06:37:31,996 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 06:37:32,069 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 06:37:32,101 INFO L195 MainTranslator]: Completed translation [2018-12-03 06:37:32,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:37:32 WrapperNode [2018-12-03 06:37:32,101 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 06:37:32,101 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 06:37:32,102 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 06:37:32,102 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 06:37:32,107 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:37:32" (1/1) ... [2018-12-03 06:37:32,117 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:37:32" (1/1) ... [2018-12-03 06:37:32,134 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 06:37:32,135 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 06:37:32,135 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 06:37:32,135 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 06:37:32,141 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:37:32" (1/1) ... [2018-12-03 06:37:32,141 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:37:32" (1/1) ... [2018-12-03 06:37:32,144 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:37:32" (1/1) ... [2018-12-03 06:37:32,144 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:37:32" (1/1) ... [2018-12-03 06:37:32,151 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:37:32" (1/1) ... [2018-12-03 06:37:32,153 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:37:32" (1/1) ... [2018-12-03 06:37:32,155 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:37:32" (1/1) ... [2018-12-03 06:37:32,157 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 06:37:32,157 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 06:37:32,158 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 06:37:32,158 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 06:37:32,158 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:37:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3ee2cf36-a930-4cda-8b51-936aeb325dc2/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-03 06:37:32,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 06:37:32,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-03 06:37:32,192 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-03 06:37:32,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-03 06:37:32,192 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-03 06:37:32,192 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-03 06:37:32,192 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-03 06:37:32,192 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-03 06:37:32,192 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-03 06:37:32,193 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-03 06:37:32,193 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-03 06:37:32,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 06:37:32,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 06:37:32,194 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-03 06:37:32,524 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 06:37:32,524 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-03 06:37:32,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:37:32 BoogieIcfgContainer [2018-12-03 06:37:32,524 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 06:37:32,525 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 06:37:32,525 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 06:37:32,527 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 06:37:32,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 06:37:31" (1/3) ... [2018-12-03 06:37:32,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9d42b57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 06:37:32, skipping insertion in model container [2018-12-03 06:37:32,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:37:32" (2/3) ... [2018-12-03 06:37:32,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9d42b57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 06:37:32, skipping insertion in model container [2018-12-03 06:37:32,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:37:32" (3/3) ... [2018-12-03 06:37:32,528 INFO L112 eAbstractionObserver]: Analyzing ICFG safe031_rmo.opt_false-unreach-call.i [2018-12-03 06:37:32,550 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,550 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,550 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,550 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,550 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,550 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,550 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,550 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,551 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,551 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,551 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,551 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,551 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,551 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,552 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,552 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,552 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,552 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,552 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,552 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,553 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,553 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,553 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,553 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,553 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,553 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,553 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,554 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,554 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,554 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,554 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,554 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,554 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,555 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,555 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,555 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,555 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,555 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,555 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,555 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,555 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,555 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,555 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,555 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,556 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,556 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,556 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,556 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,556 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,556 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,556 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,557 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,557 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,557 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,557 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,557 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,557 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,558 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,558 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,558 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,558 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,558 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,558 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,559 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,559 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,559 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,559 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,559 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,559 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,560 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,560 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,560 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,560 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,560 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,560 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,560 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,561 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,561 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,561 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,561 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,561 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,561 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:37:32,566 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-03 06:37:32,566 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 06:37:32,573 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-03 06:37:32,586 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-03 06:37:32,601 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 06:37:32,601 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 06:37:32,601 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 06:37:32,601 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 06:37:32,601 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 06:37:32,601 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 06:37:32,601 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 06:37:32,601 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 06:37:32,609 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 155places, 192 transitions [2018-12-03 06:37:47,718 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 128912 states. [2018-12-03 06:37:47,719 INFO L276 IsEmpty]: Start isEmpty. Operand 128912 states. [2018-12-03 06:37:47,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 06:37:47,726 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:37:47,727 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:37:47,728 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:37:47,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:37:47,732 INFO L82 PathProgramCache]: Analyzing trace with hash 961127934, now seen corresponding path program 1 times [2018-12-03 06:37:47,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:37:47,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:37:47,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:37:47,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:37:47,768 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:37:47,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:37:47,869 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-03 06:37:47,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:37:47,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 06:37:47,870 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:37:47,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 06:37:47,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 06:37:47,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 06:37:47,883 INFO L87 Difference]: Start difference. First operand 128912 states. Second operand 4 states. [2018-12-03 06:37:49,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:37:49,202 INFO L93 Difference]: Finished difference Result 233472 states and 1098324 transitions. [2018-12-03 06:37:49,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 06:37:49,204 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-12-03 06:37:49,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:37:49,986 INFO L225 Difference]: With dead ends: 233472 [2018-12-03 06:37:49,986 INFO L226 Difference]: Without dead ends: 203722 [2018-12-03 06:37:49,987 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-03 06:37:52,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203722 states. [2018-12-03 06:37:54,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203722 to 118892. [2018-12-03 06:37:54,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118892 states. [2018-12-03 06:37:55,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118892 states to 118892 states and 559775 transitions. [2018-12-03 06:37:55,115 INFO L78 Accepts]: Start accepts. Automaton has 118892 states and 559775 transitions. Word has length 43 [2018-12-03 06:37:55,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:37:55,116 INFO L480 AbstractCegarLoop]: Abstraction has 118892 states and 559775 transitions. [2018-12-03 06:37:55,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 06:37:55,116 INFO L276 IsEmpty]: Start isEmpty. Operand 118892 states and 559775 transitions. [2018-12-03 06:37:55,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 06:37:55,123 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:37:55,123 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-03 06:37:55,124 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:37:55,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:37:55,124 INFO L82 PathProgramCache]: Analyzing trace with hash -94457539, now seen corresponding path program 1 times [2018-12-03 06:37:55,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:37:55,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:37:55,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:37:55,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:37:55,127 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:37:55,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:37:55,173 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-03 06:37:55,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:37:55,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 06:37:55,174 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:37:55,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 06:37:55,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 06:37:55,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 06:37:55,176 INFO L87 Difference]: Start difference. First operand 118892 states and 559775 transitions. Second operand 3 states. [2018-12-03 06:37:56,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:37:56,154 INFO L93 Difference]: Finished difference Result 118892 states and 557815 transitions. [2018-12-03 06:37:56,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 06:37:56,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-03 06:37:56,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:37:56,470 INFO L225 Difference]: With dead ends: 118892 [2018-12-03 06:37:56,470 INFO L226 Difference]: Without dead ends: 118892 [2018-12-03 06:37:56,470 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-03 06:37:57,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118892 states. [2018-12-03 06:37:58,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118892 to 118892. [2018-12-03 06:37:58,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118892 states. [2018-12-03 06:37:59,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118892 states to 118892 states and 557815 transitions. [2018-12-03 06:37:59,063 INFO L78 Accepts]: Start accepts. Automaton has 118892 states and 557815 transitions. Word has length 50 [2018-12-03 06:37:59,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:37:59,063 INFO L480 AbstractCegarLoop]: Abstraction has 118892 states and 557815 transitions. [2018-12-03 06:37:59,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 06:37:59,063 INFO L276 IsEmpty]: Start isEmpty. Operand 118892 states and 557815 transitions. [2018-12-03 06:37:59,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 06:37:59,067 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:37:59,067 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-03 06:37:59,068 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:37:59,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:37:59,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1901912002, now seen corresponding path program 1 times [2018-12-03 06:37:59,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:37:59,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:37:59,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:37:59,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:37:59,071 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:37:59,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:37:59,117 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-03 06:37:59,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:37:59,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 06:37:59,118 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:37:59,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 06:37:59,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 06:37:59,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 06:37:59,118 INFO L87 Difference]: Start difference. First operand 118892 states and 557815 transitions. Second operand 5 states. [2018-12-03 06:38:02,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:38:02,453 INFO L93 Difference]: Finished difference Result 325272 states and 1468249 transitions. [2018-12-03 06:38:02,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 06:38:02,454 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-12-03 06:38:02,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:38:03,309 INFO L225 Difference]: With dead ends: 325272 [2018-12-03 06:38:03,309 INFO L226 Difference]: Without dead ends: 324272 [2018-12-03 06:38:03,309 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-03 06:38:04,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324272 states. [2018-12-03 06:38:07,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324272 to 186422. [2018-12-03 06:38:07,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186422 states. [2018-12-03 06:38:08,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186422 states to 186422 states and 840914 transitions. [2018-12-03 06:38:08,416 INFO L78 Accepts]: Start accepts. Automaton has 186422 states and 840914 transitions. Word has length 50 [2018-12-03 06:38:08,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:38:08,417 INFO L480 AbstractCegarLoop]: Abstraction has 186422 states and 840914 transitions. [2018-12-03 06:38:08,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 06:38:08,417 INFO L276 IsEmpty]: Start isEmpty. Operand 186422 states and 840914 transitions. [2018-12-03 06:38:08,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 06:38:08,423 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:38:08,423 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:38:08,423 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:38:08,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:38:08,423 INFO L82 PathProgramCache]: Analyzing trace with hash 945118259, now seen corresponding path program 1 times [2018-12-03 06:38:08,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:38:08,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:38:08,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:38:08,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:38:08,425 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:38:08,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:38:08,467 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-03 06:38:08,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:38:08,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 06:38:08,468 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:38:08,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 06:38:08,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 06:38:08,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 06:38:08,468 INFO L87 Difference]: Start difference. First operand 186422 states and 840914 transitions. Second operand 4 states. [2018-12-03 06:38:09,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:38:09,200 INFO L93 Difference]: Finished difference Result 163598 states and 725472 transitions. [2018-12-03 06:38:09,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 06:38:09,201 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-12-03 06:38:09,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:38:09,606 INFO L225 Difference]: With dead ends: 163598 [2018-12-03 06:38:09,606 INFO L226 Difference]: Without dead ends: 160993 [2018-12-03 06:38:09,607 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-03 06:38:10,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160993 states. [2018-12-03 06:38:14,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160993 to 160993. [2018-12-03 06:38:14,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160993 states. [2018-12-03 06:38:14,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160993 states to 160993 states and 716800 transitions. [2018-12-03 06:38:14,823 INFO L78 Accepts]: Start accepts. Automaton has 160993 states and 716800 transitions. Word has length 51 [2018-12-03 06:38:14,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:38:14,824 INFO L480 AbstractCegarLoop]: Abstraction has 160993 states and 716800 transitions. [2018-12-03 06:38:14,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 06:38:14,824 INFO L276 IsEmpty]: Start isEmpty. Operand 160993 states and 716800 transitions. [2018-12-03 06:38:14,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 06:38:14,828 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:38:14,828 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:38:14,828 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:38:14,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:38:14,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1724507505, now seen corresponding path program 1 times [2018-12-03 06:38:14,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:38:14,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:38:14,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:38:14,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:38:14,831 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:38:14,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:38:14,885 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-03 06:38:14,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:38:14,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 06:38:14,885 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:38:14,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 06:38:14,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 06:38:14,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 06:38:14,886 INFO L87 Difference]: Start difference. First operand 160993 states and 716800 transitions. Second operand 5 states. [2018-12-03 06:38:15,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:38:15,396 INFO L93 Difference]: Finished difference Result 51405 states and 209121 transitions. [2018-12-03 06:38:15,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 06:38:15,397 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-12-03 06:38:15,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:38:15,492 INFO L225 Difference]: With dead ends: 51405 [2018-12-03 06:38:15,492 INFO L226 Difference]: Without dead ends: 49093 [2018-12-03 06:38:15,492 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-03 06:38:15,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49093 states. [2018-12-03 06:38:16,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49093 to 49093. [2018-12-03 06:38:16,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49093 states. [2018-12-03 06:38:16,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49093 states to 49093 states and 200467 transitions. [2018-12-03 06:38:16,173 INFO L78 Accepts]: Start accepts. Automaton has 49093 states and 200467 transitions. Word has length 52 [2018-12-03 06:38:16,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:38:16,173 INFO L480 AbstractCegarLoop]: Abstraction has 49093 states and 200467 transitions. [2018-12-03 06:38:16,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 06:38:16,173 INFO L276 IsEmpty]: Start isEmpty. Operand 49093 states and 200467 transitions. [2018-12-03 06:38:16,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 06:38:16,181 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:38:16,181 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:38:16,181 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:38:16,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:38:16,181 INFO L82 PathProgramCache]: Analyzing trace with hash 206449116, now seen corresponding path program 1 times [2018-12-03 06:38:16,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:38:16,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:38:16,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:38:16,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:38:16,183 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:38:16,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:38:16,236 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-03 06:38:16,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:38:16,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 06:38:16,237 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:38:16,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 06:38:16,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 06:38:16,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 06:38:16,238 INFO L87 Difference]: Start difference. First operand 49093 states and 200467 transitions. Second operand 4 states. [2018-12-03 06:38:16,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:38:16,622 INFO L93 Difference]: Finished difference Result 70361 states and 282256 transitions. [2018-12-03 06:38:16,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 06:38:16,623 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-12-03 06:38:16,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:38:16,760 INFO L225 Difference]: With dead ends: 70361 [2018-12-03 06:38:16,760 INFO L226 Difference]: Without dead ends: 70361 [2018-12-03 06:38:16,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 06:38:16,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70361 states. [2018-12-03 06:38:17,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70361 to 53657. [2018-12-03 06:38:17,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53657 states. [2018-12-03 06:38:18,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53657 states to 53657 states and 217408 transitions. [2018-12-03 06:38:18,008 INFO L78 Accepts]: Start accepts. Automaton has 53657 states and 217408 transitions. Word has length 65 [2018-12-03 06:38:18,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:38:18,008 INFO L480 AbstractCegarLoop]: Abstraction has 53657 states and 217408 transitions. [2018-12-03 06:38:18,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 06:38:18,008 INFO L276 IsEmpty]: Start isEmpty. Operand 53657 states and 217408 transitions. [2018-12-03 06:38:18,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 06:38:18,021 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:38:18,021 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:38:18,021 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:38:18,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:38:18,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1949259451, now seen corresponding path program 1 times [2018-12-03 06:38:18,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:38:18,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:38:18,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:38:18,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:38:18,023 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:38:18,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:38:18,072 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-03 06:38:18,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:38:18,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 06:38:18,072 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:38:18,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 06:38:18,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 06:38:18,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 06:38:18,073 INFO L87 Difference]: Start difference. First operand 53657 states and 217408 transitions. Second operand 6 states. [2018-12-03 06:38:18,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:38:18,138 INFO L93 Difference]: Finished difference Result 11001 states and 37616 transitions. [2018-12-03 06:38:18,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 06:38:18,138 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2018-12-03 06:38:18,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:38:18,150 INFO L225 Difference]: With dead ends: 11001 [2018-12-03 06:38:18,150 INFO L226 Difference]: Without dead ends: 9289 [2018-12-03 06:38:18,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-03 06:38:18,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9289 states. [2018-12-03 06:38:18,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9289 to 8774. [2018-12-03 06:38:18,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8774 states. [2018-12-03 06:38:18,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8774 states to 8774 states and 29920 transitions. [2018-12-03 06:38:18,239 INFO L78 Accepts]: Start accepts. Automaton has 8774 states and 29920 transitions. Word has length 65 [2018-12-03 06:38:18,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:38:18,239 INFO L480 AbstractCegarLoop]: Abstraction has 8774 states and 29920 transitions. [2018-12-03 06:38:18,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 06:38:18,239 INFO L276 IsEmpty]: Start isEmpty. Operand 8774 states and 29920 transitions. [2018-12-03 06:38:18,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-03 06:38:18,248 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:38:18,248 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:38:18,248 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:38:18,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:38:18,249 INFO L82 PathProgramCache]: Analyzing trace with hash 542257541, now seen corresponding path program 1 times [2018-12-03 06:38:18,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:38:18,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:38:18,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:38:18,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:38:18,250 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:38:18,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:38:18,286 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-03 06:38:18,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:38:18,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 06:38:18,287 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:38:18,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 06:38:18,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 06:38:18,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 06:38:18,287 INFO L87 Difference]: Start difference. First operand 8774 states and 29920 transitions. Second operand 3 states. [2018-12-03 06:38:18,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:38:18,395 INFO L93 Difference]: Finished difference Result 9194 states and 31201 transitions. [2018-12-03 06:38:18,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 06:38:18,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2018-12-03 06:38:18,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:38:18,405 INFO L225 Difference]: With dead ends: 9194 [2018-12-03 06:38:18,405 INFO L226 Difference]: Without dead ends: 9194 [2018-12-03 06:38:18,406 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-03 06:38:18,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9194 states. [2018-12-03 06:38:18,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9194 to 8964. [2018-12-03 06:38:18,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8964 states. [2018-12-03 06:38:18,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8964 states to 8964 states and 30502 transitions. [2018-12-03 06:38:18,494 INFO L78 Accepts]: Start accepts. Automaton has 8964 states and 30502 transitions. Word has length 98 [2018-12-03 06:38:18,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:38:18,494 INFO L480 AbstractCegarLoop]: Abstraction has 8964 states and 30502 transitions. [2018-12-03 06:38:18,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 06:38:18,494 INFO L276 IsEmpty]: Start isEmpty. Operand 8964 states and 30502 transitions. [2018-12-03 06:38:18,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-03 06:38:18,504 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:38:18,504 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:38:18,504 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:38:18,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:38:18,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1760673242, now seen corresponding path program 1 times [2018-12-03 06:38:18,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:38:18,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:38:18,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:38:18,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:38:18,506 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:38:18,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:38:18,550 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-03 06:38:18,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:38:18,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 06:38:18,550 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:38:18,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 06:38:18,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 06:38:18,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 06:38:18,550 INFO L87 Difference]: Start difference. First operand 8964 states and 30502 transitions. Second operand 5 states. [2018-12-03 06:38:18,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:38:18,702 INFO L93 Difference]: Finished difference Result 11109 states and 37218 transitions. [2018-12-03 06:38:18,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 06:38:18,703 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2018-12-03 06:38:18,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:38:18,714 INFO L225 Difference]: With dead ends: 11109 [2018-12-03 06:38:18,715 INFO L226 Difference]: Without dead ends: 11109 [2018-12-03 06:38:18,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-03 06:38:18,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11109 states. [2018-12-03 06:38:18,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11109 to 9409. [2018-12-03 06:38:18,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9409 states. [2018-12-03 06:38:18,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9409 states to 9409 states and 31868 transitions. [2018-12-03 06:38:18,813 INFO L78 Accepts]: Start accepts. Automaton has 9409 states and 31868 transitions. Word has length 98 [2018-12-03 06:38:18,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:38:18,814 INFO L480 AbstractCegarLoop]: Abstraction has 9409 states and 31868 transitions. [2018-12-03 06:38:18,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 06:38:18,814 INFO L276 IsEmpty]: Start isEmpty. Operand 9409 states and 31868 transitions. [2018-12-03 06:38:18,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-03 06:38:18,824 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:38:18,824 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:38:18,824 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:38:18,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:38:18,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1768432601, now seen corresponding path program 2 times [2018-12-03 06:38:18,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:38:18,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:38:18,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:38:18,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:38:18,825 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:38:18,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:38:18,865 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-03 06:38:18,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:38:18,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 06:38:18,865 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:38:18,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 06:38:18,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 06:38:18,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 06:38:18,866 INFO L87 Difference]: Start difference. First operand 9409 states and 31868 transitions. Second operand 4 states. [2018-12-03 06:38:19,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:38:19,030 INFO L93 Difference]: Finished difference Result 14489 states and 49265 transitions. [2018-12-03 06:38:19,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 06:38:19,031 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2018-12-03 06:38:19,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:38:19,047 INFO L225 Difference]: With dead ends: 14489 [2018-12-03 06:38:19,048 INFO L226 Difference]: Without dead ends: 14489 [2018-12-03 06:38:19,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 06:38:19,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14489 states. [2018-12-03 06:38:19,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14489 to 9619. [2018-12-03 06:38:19,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9619 states. [2018-12-03 06:38:19,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9619 states to 9619 states and 32506 transitions. [2018-12-03 06:38:19,169 INFO L78 Accepts]: Start accepts. Automaton has 9619 states and 32506 transitions. Word has length 98 [2018-12-03 06:38:19,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:38:19,169 INFO L480 AbstractCegarLoop]: Abstraction has 9619 states and 32506 transitions. [2018-12-03 06:38:19,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 06:38:19,169 INFO L276 IsEmpty]: Start isEmpty. Operand 9619 states and 32506 transitions. [2018-12-03 06:38:19,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-03 06:38:19,180 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:38:19,180 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:38:19,180 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:38:19,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:38:19,181 INFO L82 PathProgramCache]: Analyzing trace with hash 2027533343, now seen corresponding path program 1 times [2018-12-03 06:38:19,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:38:19,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:38:19,182 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 06:38:19,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:38:19,182 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:38:19,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:38:19,210 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-03 06:38:19,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:38:19,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 06:38:19,211 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:38:19,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 06:38:19,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 06:38:19,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 06:38:19,211 INFO L87 Difference]: Start difference. First operand 9619 states and 32506 transitions. Second operand 4 states. [2018-12-03 06:38:19,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:38:19,324 INFO L93 Difference]: Finished difference Result 17455 states and 58925 transitions. [2018-12-03 06:38:19,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 06:38:19,325 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-12-03 06:38:19,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:38:19,345 INFO L225 Difference]: With dead ends: 17455 [2018-12-03 06:38:19,345 INFO L226 Difference]: Without dead ends: 17455 [2018-12-03 06:38:19,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 06:38:19,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17455 states. [2018-12-03 06:38:19,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17455 to 9369. [2018-12-03 06:38:19,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9369 states. [2018-12-03 06:38:19,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9369 states to 9369 states and 31371 transitions. [2018-12-03 06:38:19,474 INFO L78 Accepts]: Start accepts. Automaton has 9369 states and 31371 transitions. Word has length 100 [2018-12-03 06:38:19,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:38:19,474 INFO L480 AbstractCegarLoop]: Abstraction has 9369 states and 31371 transitions. [2018-12-03 06:38:19,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 06:38:19,474 INFO L276 IsEmpty]: Start isEmpty. Operand 9369 states and 31371 transitions. [2018-12-03 06:38:19,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-03 06:38:19,483 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:38:19,483 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:38:19,484 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:38:19,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:38:19,484 INFO L82 PathProgramCache]: Analyzing trace with hash 844186046, now seen corresponding path program 1 times [2018-12-03 06:38:19,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:38:19,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:38:19,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:38:19,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:38:19,485 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:38:19,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:38:19,549 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-03 06:38:19,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:38:19,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 06:38:19,549 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:38:19,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 06:38:19,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 06:38:19,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 06:38:19,550 INFO L87 Difference]: Start difference. First operand 9369 states and 31371 transitions. Second operand 6 states. [2018-12-03 06:38:19,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:38:19,707 INFO L93 Difference]: Finished difference Result 11429 states and 37784 transitions. [2018-12-03 06:38:19,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 06:38:19,707 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-03 06:38:19,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:38:19,721 INFO L225 Difference]: With dead ends: 11429 [2018-12-03 06:38:19,721 INFO L226 Difference]: Without dead ends: 11429 [2018-12-03 06:38:19,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 06:38:19,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11429 states. [2018-12-03 06:38:19,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11429 to 9714. [2018-12-03 06:38:19,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9714 states. [2018-12-03 06:38:19,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9714 states to 9714 states and 32482 transitions. [2018-12-03 06:38:19,825 INFO L78 Accepts]: Start accepts. Automaton has 9714 states and 32482 transitions. Word has length 100 [2018-12-03 06:38:19,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:38:19,825 INFO L480 AbstractCegarLoop]: Abstraction has 9714 states and 32482 transitions. [2018-12-03 06:38:19,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 06:38:19,826 INFO L276 IsEmpty]: Start isEmpty. Operand 9714 states and 32482 transitions. [2018-12-03 06:38:19,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-03 06:38:19,835 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:38:19,835 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:38:19,835 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:38:19,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:38:19,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1813767069, now seen corresponding path program 1 times [2018-12-03 06:38:19,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:38:19,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:38:19,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:38:19,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:38:19,837 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:38:19,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:38:19,916 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-03 06:38:19,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:38:19,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 06:38:19,916 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:38:19,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 06:38:19,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 06:38:19,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 06:38:19,917 INFO L87 Difference]: Start difference. First operand 9714 states and 32482 transitions. Second operand 6 states. [2018-12-03 06:38:20,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:38:20,051 INFO L93 Difference]: Finished difference Result 8993 states and 29747 transitions. [2018-12-03 06:38:20,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 06:38:20,051 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-03 06:38:20,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:38:20,060 INFO L225 Difference]: With dead ends: 8993 [2018-12-03 06:38:20,061 INFO L226 Difference]: Without dead ends: 8993 [2018-12-03 06:38:20,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-03 06:38:20,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8993 states. [2018-12-03 06:38:20,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8993 to 8644. [2018-12-03 06:38:20,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8644 states. [2018-12-03 06:38:20,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8644 states to 8644 states and 28726 transitions. [2018-12-03 06:38:20,142 INFO L78 Accepts]: Start accepts. Automaton has 8644 states and 28726 transitions. Word has length 100 [2018-12-03 06:38:20,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:38:20,142 INFO L480 AbstractCegarLoop]: Abstraction has 8644 states and 28726 transitions. [2018-12-03 06:38:20,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 06:38:20,142 INFO L276 IsEmpty]: Start isEmpty. Operand 8644 states and 28726 transitions. [2018-12-03 06:38:20,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-03 06:38:20,149 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:38:20,149 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:38:20,149 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:38:20,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:38:20,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1408967776, now seen corresponding path program 1 times [2018-12-03 06:38:20,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:38:20,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:38:20,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:38:20,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:38:20,150 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:38:20,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:38:20,214 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-03 06:38:20,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:38:20,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 06:38:20,214 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:38:20,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 06:38:20,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 06:38:20,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 06:38:20,215 INFO L87 Difference]: Start difference. First operand 8644 states and 28726 transitions. Second operand 6 states. [2018-12-03 06:38:20,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:38:20,390 INFO L93 Difference]: Finished difference Result 10024 states and 32535 transitions. [2018-12-03 06:38:20,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 06:38:20,391 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-03 06:38:20,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:38:20,401 INFO L225 Difference]: With dead ends: 10024 [2018-12-03 06:38:20,401 INFO L226 Difference]: Without dead ends: 9669 [2018-12-03 06:38:20,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-03 06:38:20,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9669 states. [2018-12-03 06:38:20,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9669 to 9094. [2018-12-03 06:38:20,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9094 states. [2018-12-03 06:38:20,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9094 states to 9094 states and 29921 transitions. [2018-12-03 06:38:20,486 INFO L78 Accepts]: Start accepts. Automaton has 9094 states and 29921 transitions. Word has length 100 [2018-12-03 06:38:20,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:38:20,486 INFO L480 AbstractCegarLoop]: Abstraction has 9094 states and 29921 transitions. [2018-12-03 06:38:20,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 06:38:20,486 INFO L276 IsEmpty]: Start isEmpty. Operand 9094 states and 29921 transitions. [2018-12-03 06:38:20,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-03 06:38:20,494 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:38:20,494 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:38:20,495 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:38:20,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:38:20,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1185259041, now seen corresponding path program 1 times [2018-12-03 06:38:20,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:38:20,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:38:20,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:38:20,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:38:20,496 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:38:20,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:38:20,552 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-03 06:38:20,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:38:20,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 06:38:20,552 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:38:20,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 06:38:20,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 06:38:20,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-03 06:38:20,553 INFO L87 Difference]: Start difference. First operand 9094 states and 29921 transitions. Second operand 7 states. [2018-12-03 06:38:20,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:38:20,743 INFO L93 Difference]: Finished difference Result 10057 states and 33017 transitions. [2018-12-03 06:38:20,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 06:38:20,743 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2018-12-03 06:38:20,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:38:20,754 INFO L225 Difference]: With dead ends: 10057 [2018-12-03 06:38:20,754 INFO L226 Difference]: Without dead ends: 10057 [2018-12-03 06:38:20,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-03 06:38:20,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10057 states. [2018-12-03 06:38:20,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10057 to 9009. [2018-12-03 06:38:20,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9009 states. [2018-12-03 06:38:20,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9009 states to 9009 states and 29673 transitions. [2018-12-03 06:38:20,845 INFO L78 Accepts]: Start accepts. Automaton has 9009 states and 29673 transitions. Word has length 100 [2018-12-03 06:38:20,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:38:20,845 INFO L480 AbstractCegarLoop]: Abstraction has 9009 states and 29673 transitions. [2018-12-03 06:38:20,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 06:38:20,845 INFO L276 IsEmpty]: Start isEmpty. Operand 9009 states and 29673 transitions. [2018-12-03 06:38:20,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-03 06:38:20,853 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:38:20,853 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:38:20,854 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:38:20,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:38:20,854 INFO L82 PathProgramCache]: Analyzing trace with hash 225620479, now seen corresponding path program 1 times [2018-12-03 06:38:20,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:38:20,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:38:20,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:38:20,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:38:20,855 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:38:20,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:38:20,919 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-03 06:38:20,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:38:20,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 06:38:20,920 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:38:20,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 06:38:20,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 06:38:20,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 06:38:20,920 INFO L87 Difference]: Start difference. First operand 9009 states and 29673 transitions. Second operand 5 states. [2018-12-03 06:38:21,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:38:21,004 INFO L93 Difference]: Finished difference Result 8217 states and 26961 transitions. [2018-12-03 06:38:21,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 06:38:21,004 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2018-12-03 06:38:21,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:38:21,012 INFO L225 Difference]: With dead ends: 8217 [2018-12-03 06:38:21,012 INFO L226 Difference]: Without dead ends: 8217 [2018-12-03 06:38:21,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-03 06:38:21,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8217 states. [2018-12-03 06:38:21,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8217 to 8032. [2018-12-03 06:38:21,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8032 states. [2018-12-03 06:38:21,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8032 states to 8032 states and 26443 transitions. [2018-12-03 06:38:21,087 INFO L78 Accepts]: Start accepts. Automaton has 8032 states and 26443 transitions. Word has length 100 [2018-12-03 06:38:21,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:38:21,087 INFO L480 AbstractCegarLoop]: Abstraction has 8032 states and 26443 transitions. [2018-12-03 06:38:21,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 06:38:21,087 INFO L276 IsEmpty]: Start isEmpty. Operand 8032 states and 26443 transitions. [2018-12-03 06:38:21,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-03 06:38:21,094 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:38:21,094 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:38:21,094 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:38:21,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:38:21,094 INFO L82 PathProgramCache]: Analyzing trace with hash -223076160, now seen corresponding path program 1 times [2018-12-03 06:38:21,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:38:21,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:38:21,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:38:21,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:38:21,096 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:38:21,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:38:21,127 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-03 06:38:21,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:38:21,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 06:38:21,128 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:38:21,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 06:38:21,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 06:38:21,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 06:38:21,128 INFO L87 Difference]: Start difference. First operand 8032 states and 26443 transitions. Second operand 4 states. [2018-12-03 06:38:21,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:38:21,219 INFO L93 Difference]: Finished difference Result 9376 states and 31131 transitions. [2018-12-03 06:38:21,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 06:38:21,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-12-03 06:38:21,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:38:21,229 INFO L225 Difference]: With dead ends: 9376 [2018-12-03 06:38:21,229 INFO L226 Difference]: Without dead ends: 9376 [2018-12-03 06:38:21,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 06:38:21,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9376 states. [2018-12-03 06:38:21,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9376 to 9248. [2018-12-03 06:38:21,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9248 states. [2018-12-03 06:38:21,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9248 states to 9248 states and 30715 transitions. [2018-12-03 06:38:21,318 INFO L78 Accepts]: Start accepts. Automaton has 9248 states and 30715 transitions. Word has length 100 [2018-12-03 06:38:21,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:38:21,318 INFO L480 AbstractCegarLoop]: Abstraction has 9248 states and 30715 transitions. [2018-12-03 06:38:21,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 06:38:21,318 INFO L276 IsEmpty]: Start isEmpty. Operand 9248 states and 30715 transitions. [2018-12-03 06:38:21,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-03 06:38:21,326 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:38:21,326 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:38:21,327 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:38:21,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:38:21,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1994681793, now seen corresponding path program 1 times [2018-12-03 06:38:21,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:38:21,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:38:21,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:38:21,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:38:21,328 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:38:21,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:38:21,408 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-03 06:38:21,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:38:21,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 06:38:21,409 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:38:21,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 06:38:21,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 06:38:21,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 06:38:21,409 INFO L87 Difference]: Start difference. First operand 9248 states and 30715 transitions. Second operand 6 states. [2018-12-03 06:38:21,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:38:21,496 INFO L93 Difference]: Finished difference Result 8096 states and 26267 transitions. [2018-12-03 06:38:21,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 06:38:21,496 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-03 06:38:21,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:38:21,504 INFO L225 Difference]: With dead ends: 8096 [2018-12-03 06:38:21,505 INFO L226 Difference]: Without dead ends: 8096 [2018-12-03 06:38:21,505 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-03 06:38:21,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8096 states. [2018-12-03 06:38:21,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8096 to 6671. [2018-12-03 06:38:21,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6671 states. [2018-12-03 06:38:21,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6671 states to 6671 states and 21861 transitions. [2018-12-03 06:38:21,578 INFO L78 Accepts]: Start accepts. Automaton has 6671 states and 21861 transitions. Word has length 100 [2018-12-03 06:38:21,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:38:21,578 INFO L480 AbstractCegarLoop]: Abstraction has 6671 states and 21861 transitions. [2018-12-03 06:38:21,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 06:38:21,578 INFO L276 IsEmpty]: Start isEmpty. Operand 6671 states and 21861 transitions. [2018-12-03 06:38:21,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 06:38:21,584 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:38:21,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:38:21,585 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:38:21,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:38:21,585 INFO L82 PathProgramCache]: Analyzing trace with hash -986687851, now seen corresponding path program 1 times [2018-12-03 06:38:21,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:38:21,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:38:21,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:38:21,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:38:21,586 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:38:21,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:38:21,647 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-03 06:38:21,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:38:21,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 06:38:21,647 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:38:21,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 06:38:21,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 06:38:21,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 06:38:21,648 INFO L87 Difference]: Start difference. First operand 6671 states and 21861 transitions. Second operand 7 states. [2018-12-03 06:38:21,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:38:21,946 INFO L93 Difference]: Finished difference Result 12218 states and 39640 transitions. [2018-12-03 06:38:21,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 06:38:21,946 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-03 06:38:21,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:38:21,958 INFO L225 Difference]: With dead ends: 12218 [2018-12-03 06:38:21,958 INFO L226 Difference]: Without dead ends: 12218 [2018-12-03 06:38:21,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-03 06:38:21,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12218 states. [2018-12-03 06:38:22,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12218 to 9653. [2018-12-03 06:38:22,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9653 states. [2018-12-03 06:38:22,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9653 states to 9653 states and 31719 transitions. [2018-12-03 06:38:22,065 INFO L78 Accepts]: Start accepts. Automaton has 9653 states and 31719 transitions. Word has length 102 [2018-12-03 06:38:22,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:38:22,065 INFO L480 AbstractCegarLoop]: Abstraction has 9653 states and 31719 transitions. [2018-12-03 06:38:22,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 06:38:22,065 INFO L276 IsEmpty]: Start isEmpty. Operand 9653 states and 31719 transitions. [2018-12-03 06:38:22,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 06:38:22,074 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:38:22,074 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:38:22,074 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:38:22,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:38:22,075 INFO L82 PathProgramCache]: Analyzing trace with hash 258076630, now seen corresponding path program 1 times [2018-12-03 06:38:22,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:38:22,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:38:22,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:38:22,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:38:22,076 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:38:22,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:38:22,158 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-03 06:38:22,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:38:22,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 06:38:22,158 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:38:22,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 06:38:22,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 06:38:22,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 06:38:22,159 INFO L87 Difference]: Start difference. First operand 9653 states and 31719 transitions. Second operand 6 states. [2018-12-03 06:38:22,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:38:22,257 INFO L93 Difference]: Finished difference Result 9843 states and 32066 transitions. [2018-12-03 06:38:22,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 06:38:22,258 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-12-03 06:38:22,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:38:22,269 INFO L225 Difference]: With dead ends: 9843 [2018-12-03 06:38:22,269 INFO L226 Difference]: Without dead ends: 9843 [2018-12-03 06:38:22,270 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-03 06:38:22,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9843 states. [2018-12-03 06:38:22,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9843 to 9578. [2018-12-03 06:38:22,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9578 states. [2018-12-03 06:38:22,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9578 states to 9578 states and 31339 transitions. [2018-12-03 06:38:22,359 INFO L78 Accepts]: Start accepts. Automaton has 9578 states and 31339 transitions. Word has length 102 [2018-12-03 06:38:22,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:38:22,359 INFO L480 AbstractCegarLoop]: Abstraction has 9578 states and 31339 transitions. [2018-12-03 06:38:22,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 06:38:22,360 INFO L276 IsEmpty]: Start isEmpty. Operand 9578 states and 31339 transitions. [2018-12-03 06:38:22,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 06:38:22,367 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:38:22,367 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:38:22,368 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:38:22,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:38:22,368 INFO L82 PathProgramCache]: Analyzing trace with hash -656922090, now seen corresponding path program 1 times [2018-12-03 06:38:22,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:38:22,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:38:22,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:38:22,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:38:22,369 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:38:22,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:38:22,433 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-03 06:38:22,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:38:22,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 06:38:22,433 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:38:22,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 06:38:22,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 06:38:22,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 06:38:22,434 INFO L87 Difference]: Start difference. First operand 9578 states and 31339 transitions. Second operand 6 states. [2018-12-03 06:38:22,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:38:22,595 INFO L93 Difference]: Finished difference Result 12122 states and 38989 transitions. [2018-12-03 06:38:22,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 06:38:22,596 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-12-03 06:38:22,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:38:22,608 INFO L225 Difference]: With dead ends: 12122 [2018-12-03 06:38:22,608 INFO L226 Difference]: Without dead ends: 12122 [2018-12-03 06:38:22,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-03 06:38:22,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12122 states. [2018-12-03 06:38:22,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12122 to 9828. [2018-12-03 06:38:22,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9828 states. [2018-12-03 06:38:22,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9828 states to 9828 states and 31959 transitions. [2018-12-03 06:38:22,723 INFO L78 Accepts]: Start accepts. Automaton has 9828 states and 31959 transitions. Word has length 102 [2018-12-03 06:38:22,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:38:22,723 INFO L480 AbstractCegarLoop]: Abstraction has 9828 states and 31959 transitions. [2018-12-03 06:38:22,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 06:38:22,723 INFO L276 IsEmpty]: Start isEmpty. Operand 9828 states and 31959 transitions. [2018-12-03 06:38:22,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 06:38:22,731 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:38:22,731 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:38:22,731 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:38:22,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:38:22,731 INFO L82 PathProgramCache]: Analyzing trace with hash 476268503, now seen corresponding path program 1 times [2018-12-03 06:38:22,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:38:22,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:38:22,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:38:22,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:38:22,732 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:38:22,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:38:22,778 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-03 06:38:22,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:38:22,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 06:38:22,778 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:38:22,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 06:38:22,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 06:38:22,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 06:38:22,779 INFO L87 Difference]: Start difference. First operand 9828 states and 31959 transitions. Second operand 5 states. [2018-12-03 06:38:22,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:38:22,898 INFO L93 Difference]: Finished difference Result 11108 states and 36119 transitions. [2018-12-03 06:38:22,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 06:38:22,898 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2018-12-03 06:38:22,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:38:22,910 INFO L225 Difference]: With dead ends: 11108 [2018-12-03 06:38:22,910 INFO L226 Difference]: Without dead ends: 11108 [2018-12-03 06:38:22,910 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-03 06:38:22,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11108 states. [2018-12-03 06:38:22,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11108 to 8660. [2018-12-03 06:38:22,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8660 states. [2018-12-03 06:38:23,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8660 states to 8660 states and 28270 transitions. [2018-12-03 06:38:23,006 INFO L78 Accepts]: Start accepts. Automaton has 8660 states and 28270 transitions. Word has length 102 [2018-12-03 06:38:23,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:38:23,006 INFO L480 AbstractCegarLoop]: Abstraction has 8660 states and 28270 transitions. [2018-12-03 06:38:23,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 06:38:23,006 INFO L276 IsEmpty]: Start isEmpty. Operand 8660 states and 28270 transitions. [2018-12-03 06:38:23,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 06:38:23,014 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:38:23,014 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:38:23,014 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:38:23,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:38:23,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1721032984, now seen corresponding path program 1 times [2018-12-03 06:38:23,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:38:23,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:38:23,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:38:23,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:38:23,015 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:38:23,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:38:23,096 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-03 06:38:23,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:38:23,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 06:38:23,096 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:38:23,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 06:38:23,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 06:38:23,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 06:38:23,097 INFO L87 Difference]: Start difference. First operand 8660 states and 28270 transitions. Second operand 7 states. [2018-12-03 06:38:23,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:38:23,275 INFO L93 Difference]: Finished difference Result 15942 states and 52653 transitions. [2018-12-03 06:38:23,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 06:38:23,275 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-03 06:38:23,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:38:23,284 INFO L225 Difference]: With dead ends: 15942 [2018-12-03 06:38:23,284 INFO L226 Difference]: Without dead ends: 8030 [2018-12-03 06:38:23,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-03 06:38:23,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8030 states. [2018-12-03 06:38:23,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8030 to 8000. [2018-12-03 06:38:23,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8000 states. [2018-12-03 06:38:23,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8000 states to 8000 states and 26334 transitions. [2018-12-03 06:38:23,363 INFO L78 Accepts]: Start accepts. Automaton has 8000 states and 26334 transitions. Word has length 102 [2018-12-03 06:38:23,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:38:23,363 INFO L480 AbstractCegarLoop]: Abstraction has 8000 states and 26334 transitions. [2018-12-03 06:38:23,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 06:38:23,363 INFO L276 IsEmpty]: Start isEmpty. Operand 8000 states and 26334 transitions. [2018-12-03 06:38:23,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 06:38:23,370 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:38:23,370 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:38:23,370 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:38:23,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:38:23,370 INFO L82 PathProgramCache]: Analyzing trace with hash -538618986, now seen corresponding path program 2 times [2018-12-03 06:38:23,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:38:23,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:38:23,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:38:23,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:38:23,372 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:38:23,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:38:23,467 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-03 06:38:23,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:38:23,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-03 06:38:23,467 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:38:23,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 06:38:23,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 06:38:23,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-03 06:38:23,468 INFO L87 Difference]: Start difference. First operand 8000 states and 26334 transitions. Second operand 10 states. [2018-12-03 06:38:23,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:38:23,715 INFO L93 Difference]: Finished difference Result 14742 states and 49273 transitions. [2018-12-03 06:38:23,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 06:38:23,715 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 102 [2018-12-03 06:38:23,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:38:23,723 INFO L225 Difference]: With dead ends: 14742 [2018-12-03 06:38:23,723 INFO L226 Difference]: Without dead ends: 6821 [2018-12-03 06:38:23,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2018-12-03 06:38:23,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6821 states. [2018-12-03 06:38:23,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6821 to 6821. [2018-12-03 06:38:23,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6821 states. [2018-12-03 06:38:23,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6821 states to 6821 states and 23131 transitions. [2018-12-03 06:38:23,797 INFO L78 Accepts]: Start accepts. Automaton has 6821 states and 23131 transitions. Word has length 102 [2018-12-03 06:38:23,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:38:23,797 INFO L480 AbstractCegarLoop]: Abstraction has 6821 states and 23131 transitions. [2018-12-03 06:38:23,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 06:38:23,797 INFO L276 IsEmpty]: Start isEmpty. Operand 6821 states and 23131 transitions. [2018-12-03 06:38:23,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 06:38:23,803 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:38:23,804 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:38:23,804 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:38:23,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:38:23,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1181090854, now seen corresponding path program 1 times [2018-12-03 06:38:23,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:38:23,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:38:23,805 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 06:38:23,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:38:23,805 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:38:23,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:38:23,885 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-03 06:38:23,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:38:23,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 06:38:23,885 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:38:23,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 06:38:23,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 06:38:23,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-03 06:38:23,886 INFO L87 Difference]: Start difference. First operand 6821 states and 23131 transitions. Second operand 7 states. [2018-12-03 06:38:24,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:38:24,097 INFO L93 Difference]: Finished difference Result 8957 states and 29585 transitions. [2018-12-03 06:38:24,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 06:38:24,098 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-03 06:38:24,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:38:24,107 INFO L225 Difference]: With dead ends: 8957 [2018-12-03 06:38:24,107 INFO L226 Difference]: Without dead ends: 8821 [2018-12-03 06:38:24,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-03 06:38:24,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8821 states. [2018-12-03 06:38:24,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8821 to 6805. [2018-12-03 06:38:24,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6805 states. [2018-12-03 06:38:24,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6805 states to 6805 states and 23039 transitions. [2018-12-03 06:38:24,181 INFO L78 Accepts]: Start accepts. Automaton has 6805 states and 23039 transitions. Word has length 102 [2018-12-03 06:38:24,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:38:24,181 INFO L480 AbstractCegarLoop]: Abstraction has 6805 states and 23039 transitions. [2018-12-03 06:38:24,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 06:38:24,181 INFO L276 IsEmpty]: Start isEmpty. Operand 6805 states and 23039 transitions. [2018-12-03 06:38:24,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 06:38:24,187 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:38:24,187 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:38:24,188 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:38:24,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:38:24,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1178216155, now seen corresponding path program 1 times [2018-12-03 06:38:24,188 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:38:24,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:38:24,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:38:24,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:38:24,189 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:38:24,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:38:24,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:38:24,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:38:24,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 06:38:24,238 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:38:24,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 06:38:24,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 06:38:24,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 06:38:24,239 INFO L87 Difference]: Start difference. First operand 6805 states and 23039 transitions. Second operand 5 states. [2018-12-03 06:38:24,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:38:24,269 INFO L93 Difference]: Finished difference Result 6805 states and 22971 transitions. [2018-12-03 06:38:24,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 06:38:24,269 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2018-12-03 06:38:24,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:38:24,277 INFO L225 Difference]: With dead ends: 6805 [2018-12-03 06:38:24,277 INFO L226 Difference]: Without dead ends: 6805 [2018-12-03 06:38:24,277 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-03 06:38:24,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6805 states. [2018-12-03 06:38:24,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6805 to 6789. [2018-12-03 06:38:24,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6789 states. [2018-12-03 06:38:24,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6789 states to 6789 states and 22927 transitions. [2018-12-03 06:38:24,341 INFO L78 Accepts]: Start accepts. Automaton has 6789 states and 22927 transitions. Word has length 102 [2018-12-03 06:38:24,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:38:24,341 INFO L480 AbstractCegarLoop]: Abstraction has 6789 states and 22927 transitions. [2018-12-03 06:38:24,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 06:38:24,341 INFO L276 IsEmpty]: Start isEmpty. Operand 6789 states and 22927 transitions. [2018-12-03 06:38:24,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 06:38:24,348 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:38:24,348 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:38:24,348 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:38:24,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:38:24,348 INFO L82 PathProgramCache]: Analyzing trace with hash -522524324, now seen corresponding path program 3 times [2018-12-03 06:38:24,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:38:24,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:38:24,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:38:24,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:38:24,349 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:38:24,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:38:24,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:38:24,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:38:24,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-03 06:38:24,443 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:38:24,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 06:38:24,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 06:38:24,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-03 06:38:24,444 INFO L87 Difference]: Start difference. First operand 6789 states and 22927 transitions. Second operand 12 states. [2018-12-03 06:38:24,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:38:24,760 INFO L93 Difference]: Finished difference Result 13177 states and 44650 transitions. [2018-12-03 06:38:24,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 06:38:24,760 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 102 [2018-12-03 06:38:24,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:38:24,770 INFO L225 Difference]: With dead ends: 13177 [2018-12-03 06:38:24,770 INFO L226 Difference]: Without dead ends: 9273 [2018-12-03 06:38:24,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-12-03 06:38:24,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9273 states. [2018-12-03 06:38:24,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9273 to 8665. [2018-12-03 06:38:24,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8665 states. [2018-12-03 06:38:24,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8665 states to 8665 states and 28570 transitions. [2018-12-03 06:38:24,856 INFO L78 Accepts]: Start accepts. Automaton has 8665 states and 28570 transitions. Word has length 102 [2018-12-03 06:38:24,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:38:24,856 INFO L480 AbstractCegarLoop]: Abstraction has 8665 states and 28570 transitions. [2018-12-03 06:38:24,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 06:38:24,857 INFO L276 IsEmpty]: Start isEmpty. Operand 8665 states and 28570 transitions. [2018-12-03 06:38:24,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 06:38:24,864 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:38:24,864 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:38:24,864 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:38:24,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:38:24,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1889908770, now seen corresponding path program 4 times [2018-12-03 06:38:24,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:38:24,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:38:24,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 06:38:24,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:38:24,866 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:38:24,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 06:38:24,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 06:38:24,902 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-03 06:38:24,973 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-03 06:38:24,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 06:38:24 BasicIcfg [2018-12-03 06:38:24,974 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 06:38:24,975 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 06:38:24,975 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 06:38:24,975 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 06:38:24,975 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:37:32" (3/4) ... [2018-12-03 06:38:24,977 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-03 06:38:25,047 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3ee2cf36-a930-4cda-8b51-936aeb325dc2/bin-2019/utaipan/witness.graphml [2018-12-03 06:38:25,047 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 06:38:25,047 INFO L168 Benchmark]: Toolchain (without parser) took 53268.33 ms. Allocated memory was 1.0 GB in the beginning and 6.5 GB in the end (delta: 5.5 GB). Free memory was 945.9 MB in the beginning and 2.6 GB in the end (delta: -1.7 GB). Peak memory consumption was 3.8 GB. Max. memory is 11.5 GB. [2018-12-03 06:38:25,048 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-03 06:38:25,048 INFO L168 Benchmark]: CACSL2BoogieTranslator took 321.17 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -130.4 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. [2018-12-03 06:38:25,049 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. [2018-12-03 06:38:25,049 INFO L168 Benchmark]: Boogie Preprocessor took 22.64 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 06:38:25,049 INFO L168 Benchmark]: RCFGBuilder took 366.99 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 11.5 GB. [2018-12-03 06:38:25,049 INFO L168 Benchmark]: TraceAbstraction took 52449.72 ms. Allocated memory was 1.1 GB in the beginning and 6.5 GB in the end (delta: 5.4 GB). Free memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: -1.6 GB). Peak memory consumption was 3.7 GB. Max. memory is 11.5 GB. [2018-12-03 06:38:25,049 INFO L168 Benchmark]: Witness Printer took 72.19 ms. Allocated memory is still 6.5 GB. Free memory was 2.6 GB in the beginning and 2.6 GB in the end (delta: 32.7 MB). Peak memory consumption was 32.7 MB. Max. memory is 11.5 GB. [2018-12-03 06:38:25,050 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 321.17 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -130.4 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.64 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 366.99 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 52449.72 ms. Allocated memory was 1.1 GB in the beginning and 6.5 GB in the end (delta: 5.4 GB). Free memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: -1.6 GB). Peak memory consumption was 3.7 GB. Max. memory is 11.5 GB. * Witness Printer took 72.19 ms. Allocated memory is still 6.5 GB. Free memory was 2.6 GB in the beginning and 2.6 GB in the end (delta: 32.7 MB). Peak memory consumption was 32.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L675] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0] [L676] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L678] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L680] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L681] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L682] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L683] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L684] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L685] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L686] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L687] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L688] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L689] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L690] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L691] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L692] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L693] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L694] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L695] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L696] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L698] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L699] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L700] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L778] -1 pthread_t t2530; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L779] FCALL, FORK -1 pthread_create(&t2530, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] -1 pthread_t t2531; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] FCALL, FORK -1 pthread_create(&t2531, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L782] -1 pthread_t t2532; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L783] FCALL, FORK -1 pthread_create(&t2532, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L741] 0 y$w_buff1 = y$w_buff0 [L742] 0 y$w_buff0 = 2 [L743] 0 y$w_buff1_used = y$w_buff0_used [L744] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L746] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L747] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L748] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L749] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L750] 0 y$r_buff0_thd3 = (_Bool)1 [L753] 0 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L704] 1 z = 2 [L709] 1 __unbuffered_p0_EAX = x [L714] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L721] 2 x = 1 [L724] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L727] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L727] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=1, z=2] [L727] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=1, z=2] [L727] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L728] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L728] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L729] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L729] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L730] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L756] 0 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L730] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L731] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L731] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L734] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L757] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L757] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L758] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L758] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L759] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L759] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L760] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L760] 0 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L763] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L785] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L789] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L789] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L789] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L789] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L790] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L790] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L791] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L791] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L792] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L792] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L793] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L793] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L796] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L797] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L798] -1 y$flush_delayed = weak$$choice2 [L799] -1 y$mem_tmp = y VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L800] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L800] -1 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L801] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L801] -1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L802] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L802] -1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L803] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L803] -1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L804] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L804] -1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L805] -1 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L806] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L806] -1 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L807] -1 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L808] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L808] -1 y = y$flush_delayed ? y$mem_tmp : y [L809] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 198 locations, 3 error locations. UNSAFE Result, 52.3s OverallTime, 28 OverallIterations, 1 TraceHistogramMax, 13.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5899 SDtfs, 5692 SDslu, 13017 SDs, 0 SdLazy, 4098 SolverSat, 262 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 260 GetRequests, 80 SyntacticMatches, 19 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=186422occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 21.8s AutomataMinimizationTime, 27 MinimizatonAttempts, 270452 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 2490 NumberOfCodeBlocks, 2490 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 2361 ConstructedInterpolants, 0 QuantifiedInterpolants, 501698 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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...