./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi010_pso.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c6618223-c0e0-401e-a64b-f7287a32d79d/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c6618223-c0e0-401e-a64b-f7287a32d79d/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c6618223-c0e0-401e-a64b-f7287a32d79d/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c6618223-c0e0-401e-a64b-f7287a32d79d/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi010_pso.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c6618223-c0e0-401e-a64b-f7287a32d79d/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c6618223-c0e0-401e-a64b-f7287a32d79d/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 b910ec3d796efdb357aa7d437dc2d916bc02b112 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-09 19:08:44,419 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 19:08:44,420 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 19:08:44,426 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 19:08:44,426 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 19:08:44,426 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 19:08:44,427 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 19:08:44,428 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 19:08:44,429 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 19:08:44,430 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 19:08:44,430 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 19:08:44,430 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 19:08:44,431 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 19:08:44,431 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 19:08:44,432 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 19:08:44,433 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 19:08:44,433 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 19:08:44,434 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 19:08:44,435 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 19:08:44,436 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 19:08:44,436 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 19:08:44,437 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 19:08:44,438 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 19:08:44,439 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 19:08:44,439 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 19:08:44,439 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 19:08:44,440 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 19:08:44,440 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 19:08:44,441 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 19:08:44,441 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 19:08:44,441 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 19:08:44,442 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 19:08:44,442 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 19:08:44,442 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 19:08:44,443 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 19:08:44,443 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 19:08:44,443 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c6618223-c0e0-401e-a64b-f7287a32d79d/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 19:08:44,451 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 19:08:44,451 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 19:08:44,451 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 19:08:44,452 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 19:08:44,452 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 19:08:44,452 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 19:08:44,452 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 19:08:44,452 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 19:08:44,452 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 19:08:44,452 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 19:08:44,452 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 19:08:44,452 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 19:08:44,453 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 19:08:44,453 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 19:08:44,453 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 19:08:44,453 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 19:08:44,453 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 19:08:44,453 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 19:08:44,453 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 19:08:44,454 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 19:08:44,454 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 19:08:44,454 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 19:08:44,454 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 19:08:44,454 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 19:08:44,454 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 19:08:44,454 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 19:08:44,454 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 19:08:44,454 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 19:08:44,454 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 19:08:44,455 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 19:08:44,455 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 19:08:44,455 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 19:08:44,455 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 19:08:44,455 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 19:08:44,455 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 19:08:44,455 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 19:08:44,455 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_c6618223-c0e0-401e-a64b-f7287a32d79d/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 -> b910ec3d796efdb357aa7d437dc2d916bc02b112 [2018-12-09 19:08:44,473 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 19:08:44,482 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 19:08:44,484 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 19:08:44,485 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 19:08:44,486 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 19:08:44,486 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c6618223-c0e0-401e-a64b-f7287a32d79d/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/rfi010_pso.oepc_false-unreach-call.i [2018-12-09 19:08:44,522 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c6618223-c0e0-401e-a64b-f7287a32d79d/bin-2019/utaipan/data/ee12a3138/a42a0d8c35ad480eab62a4243fbdeee8/FLAG1a09707c8 [2018-12-09 19:08:44,987 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 19:08:44,987 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c6618223-c0e0-401e-a64b-f7287a32d79d/sv-benchmarks/c/pthread-wmm/rfi010_pso.oepc_false-unreach-call.i [2018-12-09 19:08:44,996 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c6618223-c0e0-401e-a64b-f7287a32d79d/bin-2019/utaipan/data/ee12a3138/a42a0d8c35ad480eab62a4243fbdeee8/FLAG1a09707c8 [2018-12-09 19:08:45,505 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c6618223-c0e0-401e-a64b-f7287a32d79d/bin-2019/utaipan/data/ee12a3138/a42a0d8c35ad480eab62a4243fbdeee8 [2018-12-09 19:08:45,507 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 19:08:45,508 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 19:08:45,509 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 19:08:45,509 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 19:08:45,511 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 19:08:45,511 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:08:45" (1/1) ... [2018-12-09 19:08:45,513 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e282df7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:08:45, skipping insertion in model container [2018-12-09 19:08:45,513 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:08:45" (1/1) ... [2018-12-09 19:08:45,517 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 19:08:45,538 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 19:08:45,718 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:08:45,730 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 19:08:45,803 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:08:45,833 INFO L195 MainTranslator]: Completed translation [2018-12-09 19:08:45,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:08:45 WrapperNode [2018-12-09 19:08:45,834 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 19:08:45,834 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 19:08:45,834 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 19:08:45,834 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 19:08:45,840 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:08:45" (1/1) ... [2018-12-09 19:08:45,850 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:08:45" (1/1) ... [2018-12-09 19:08:45,867 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 19:08:45,868 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 19:08:45,868 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 19:08:45,868 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 19:08:45,874 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:08:45" (1/1) ... [2018-12-09 19:08:45,874 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:08:45" (1/1) ... [2018-12-09 19:08:45,876 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:08:45" (1/1) ... [2018-12-09 19:08:45,876 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:08:45" (1/1) ... [2018-12-09 19:08:45,881 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:08:45" (1/1) ... [2018-12-09 19:08:45,884 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:08:45" (1/1) ... [2018-12-09 19:08:45,885 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:08:45" (1/1) ... [2018-12-09 19:08:45,888 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 19:08:45,888 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 19:08:45,888 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 19:08:45,888 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 19:08:45,889 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:08:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c6618223-c0e0-401e-a64b-f7287a32d79d/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-09 19:08:45,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 19:08:45,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 19:08:45,922 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 19:08:45,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 19:08:45,922 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 19:08:45,922 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 19:08:45,922 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 19:08:45,923 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 19:08:45,923 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 19:08:45,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 19:08:45,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 19:08:45,924 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-09 19:08:46,298 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 19:08:46,299 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 19:08:46,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:08:46 BoogieIcfgContainer [2018-12-09 19:08:46,299 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 19:08:46,299 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 19:08:46,300 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 19:08:46,302 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 19:08:46,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 07:08:45" (1/3) ... [2018-12-09 19:08:46,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16ed4a10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:08:46, skipping insertion in model container [2018-12-09 19:08:46,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:08:45" (2/3) ... [2018-12-09 19:08:46,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16ed4a10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:08:46, skipping insertion in model container [2018-12-09 19:08:46,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:08:46" (3/3) ... [2018-12-09 19:08:46,304 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi010_pso.oepc_false-unreach-call.i [2018-12-09 19:08:46,330 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,330 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,330 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,330 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,330 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,331 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,331 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,331 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,331 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,331 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,331 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,331 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,331 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,331 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,332 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,332 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,332 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,332 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,332 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,332 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,332 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,332 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,332 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,332 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,332 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,333 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,333 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,333 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,333 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,333 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,333 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,333 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,333 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,333 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,333 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,333 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,334 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,334 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,334 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,334 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,334 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,334 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,334 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,334 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,334 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,334 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,334 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,335 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,335 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,335 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,335 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,335 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,335 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,335 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,335 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,335 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,335 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,335 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,336 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,336 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,336 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,336 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,336 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,336 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,336 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,336 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,336 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,336 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,336 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,337 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,337 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,337 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,337 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,337 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,337 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,337 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,337 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,337 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,337 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,337 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,338 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,338 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,338 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,338 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,338 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,338 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,338 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,338 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,338 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,338 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,339 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,339 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,339 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,339 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,339 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,339 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,339 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,339 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,340 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,340 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,340 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,340 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,340 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,340 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,340 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,340 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,340 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,340 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,340 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,341 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,341 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,341 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,341 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,341 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,342 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,342 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,342 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,342 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,342 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,342 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,342 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,343 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,343 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,343 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,343 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,343 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,343 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,343 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,343 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,343 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,343 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,343 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,343 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,344 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,344 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,344 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,344 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,344 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,344 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,344 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,344 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,344 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,344 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,344 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,345 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,345 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,345 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,345 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,345 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,345 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,345 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,345 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,345 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,345 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,345 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,345 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,346 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,346 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,346 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,346 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,346 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,346 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,346 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,346 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,346 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,346 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,346 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,347 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,347 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,347 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,347 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,347 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,347 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,347 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,347 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,347 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,347 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,348 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,348 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,348 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,348 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,348 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,348 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,348 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,348 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,348 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,349 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,349 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,349 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,349 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,349 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,349 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,349 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,349 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,349 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,350 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,350 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,350 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,350 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,350 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,350 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,350 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,350 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,350 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,350 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,350 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,351 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,351 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,351 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,351 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,351 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,351 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,351 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,351 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,351 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,351 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,351 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,351 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,352 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,352 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,352 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,352 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,352 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,352 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:08:46,356 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 19:08:46,356 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 19:08:46,364 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 19:08:46,378 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 19:08:46,395 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 19:08:46,396 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 19:08:46,396 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 19:08:46,396 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 19:08:46,396 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 19:08:46,396 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 19:08:46,396 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 19:08:46,396 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 19:08:46,403 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 173places, 226 transitions [2018-12-09 19:08:51,894 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 83127 states. [2018-12-09 19:08:51,896 INFO L276 IsEmpty]: Start isEmpty. Operand 83127 states. [2018-12-09 19:08:51,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-09 19:08:51,902 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:08:51,902 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] [2018-12-09 19:08:51,903 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:08:51,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:08:51,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1645016021, now seen corresponding path program 1 times [2018-12-09 19:08:51,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:08:51,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:51,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:08:51,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:51,944 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:08:51,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:08:52,050 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-09 19:08:52,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:08:52,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:08:52,052 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:08:52,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:08:52,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:08:52,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:08:52,066 INFO L87 Difference]: Start difference. First operand 83127 states. Second operand 4 states. [2018-12-09 19:08:52,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:08:52,857 INFO L93 Difference]: Finished difference Result 150583 states and 603160 transitions. [2018-12-09 19:08:52,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:08:52,859 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-12-09 19:08:52,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:08:53,376 INFO L225 Difference]: With dead ends: 150583 [2018-12-09 19:08:53,376 INFO L226 Difference]: Without dead ends: 105839 [2018-12-09 19:08:53,377 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-09 19:08:54,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105839 states. [2018-12-09 19:08:55,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105839 to 61235. [2018-12-09 19:08:55,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61235 states. [2018-12-09 19:08:55,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61235 states to 61235 states and 248290 transitions. [2018-12-09 19:08:55,450 INFO L78 Accepts]: Start accepts. Automaton has 61235 states and 248290 transitions. Word has length 38 [2018-12-09 19:08:55,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:08:55,450 INFO L480 AbstractCegarLoop]: Abstraction has 61235 states and 248290 transitions. [2018-12-09 19:08:55,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:08:55,450 INFO L276 IsEmpty]: Start isEmpty. Operand 61235 states and 248290 transitions. [2018-12-09 19:08:55,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 19:08:55,455 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:08:55,455 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] [2018-12-09 19:08:55,455 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:08:55,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:08:55,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1043746306, now seen corresponding path program 1 times [2018-12-09 19:08:55,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:08:55,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:55,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:08:55,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:08:55,460 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:08:55,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:08:55,509 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-09 19:08:55,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:08:55,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:08:55,510 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:08:55,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:08:55,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:08:55,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:08:55,512 INFO L87 Difference]: Start difference. First operand 61235 states and 248290 transitions. Second operand 5 states. [2018-12-09 19:08:57,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:08:57,630 INFO L93 Difference]: Finished difference Result 146039 states and 554300 transitions. [2018-12-09 19:08:57,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:08:57,631 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-09 19:08:57,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:08:57,962 INFO L225 Difference]: With dead ends: 146039 [2018-12-09 19:08:57,962 INFO L226 Difference]: Without dead ends: 145471 [2018-12-09 19:08:57,963 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-09 19:08:59,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145471 states. [2018-12-09 19:09:00,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145471 to 96613. [2018-12-09 19:09:00,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96613 states. [2018-12-09 19:09:00,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96613 states to 96613 states and 368455 transitions. [2018-12-09 19:09:00,390 INFO L78 Accepts]: Start accepts. Automaton has 96613 states and 368455 transitions. Word has length 46 [2018-12-09 19:09:00,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:09:00,391 INFO L480 AbstractCegarLoop]: Abstraction has 96613 states and 368455 transitions. [2018-12-09 19:09:00,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:09:00,391 INFO L276 IsEmpty]: Start isEmpty. Operand 96613 states and 368455 transitions. [2018-12-09 19:09:00,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 19:09:00,394 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:09:00,395 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:09:00,395 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:09:00,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:09:00,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1415245602, now seen corresponding path program 1 times [2018-12-09 19:09:00,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:09:00,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:00,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:09:00,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:00,397 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:09:00,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:09:00,435 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-09 19:09:00,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:09:00,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:09:00,435 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:09:00,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:09:00,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:09:00,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:09:00,436 INFO L87 Difference]: Start difference. First operand 96613 states and 368455 transitions. Second operand 5 states. [2018-12-09 19:09:01,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:09:01,595 INFO L93 Difference]: Finished difference Result 199269 states and 748089 transitions. [2018-12-09 19:09:01,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:09:01,596 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-09 19:09:01,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:09:02,009 INFO L225 Difference]: With dead ends: 199269 [2018-12-09 19:09:02,009 INFO L226 Difference]: Without dead ends: 198805 [2018-12-09 19:09:02,010 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-09 19:09:03,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198805 states. [2018-12-09 19:09:04,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198805 to 108296. [2018-12-09 19:09:04,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108296 states. [2018-12-09 19:09:05,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108296 states to 108296 states and 408659 transitions. [2018-12-09 19:09:05,186 INFO L78 Accepts]: Start accepts. Automaton has 108296 states and 408659 transitions. Word has length 47 [2018-12-09 19:09:05,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:09:05,186 INFO L480 AbstractCegarLoop]: Abstraction has 108296 states and 408659 transitions. [2018-12-09 19:09:05,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:09:05,186 INFO L276 IsEmpty]: Start isEmpty. Operand 108296 states and 408659 transitions. [2018-12-09 19:09:05,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-09 19:09:05,194 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:09:05,194 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] [2018-12-09 19:09:05,194 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:09:05,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:09:05,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1958778492, now seen corresponding path program 1 times [2018-12-09 19:09:05,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:09:05,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:05,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:09:05,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:05,197 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:09:05,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:09:05,225 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-09 19:09:05,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:09:05,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:09:05,225 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:09:05,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:09:05,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:09:05,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:09:05,226 INFO L87 Difference]: Start difference. First operand 108296 states and 408659 transitions. Second operand 3 states. [2018-12-09 19:09:06,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:09:06,061 INFO L93 Difference]: Finished difference Result 179115 states and 655174 transitions. [2018-12-09 19:09:06,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:09:06,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-09 19:09:06,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:09:06,410 INFO L225 Difference]: With dead ends: 179115 [2018-12-09 19:09:06,410 INFO L226 Difference]: Without dead ends: 179115 [2018-12-09 19:09:06,410 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-09 19:09:07,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179115 states. [2018-12-09 19:09:09,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179115 to 163646. [2018-12-09 19:09:09,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163646 states. [2018-12-09 19:09:09,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163646 states to 163646 states and 603625 transitions. [2018-12-09 19:09:09,959 INFO L78 Accepts]: Start accepts. Automaton has 163646 states and 603625 transitions. Word has length 49 [2018-12-09 19:09:09,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:09:09,959 INFO L480 AbstractCegarLoop]: Abstraction has 163646 states and 603625 transitions. [2018-12-09 19:09:09,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:09:09,959 INFO L276 IsEmpty]: Start isEmpty. Operand 163646 states and 603625 transitions. [2018-12-09 19:09:09,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 19:09:09,972 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:09:09,973 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] [2018-12-09 19:09:09,973 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:09:09,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:09:09,973 INFO L82 PathProgramCache]: Analyzing trace with hash 984479439, now seen corresponding path program 1 times [2018-12-09 19:09:09,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:09:09,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:09,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:09:09,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:09,975 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:09:09,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:09:10,010 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-09 19:09:10,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:09:10,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:09:10,010 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:09:10,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:09:10,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:09:10,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:09:10,011 INFO L87 Difference]: Start difference. First operand 163646 states and 603625 transitions. Second operand 6 states. [2018-12-09 19:09:13,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:09:13,289 INFO L93 Difference]: Finished difference Result 315523 states and 1139598 transitions. [2018-12-09 19:09:13,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 19:09:13,289 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-09 19:09:13,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:09:13,915 INFO L225 Difference]: With dead ends: 315523 [2018-12-09 19:09:13,916 INFO L226 Difference]: Without dead ends: 314987 [2018-12-09 19:09:13,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-09 19:09:15,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314987 states. [2018-12-09 19:09:18,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314987 to 164409. [2018-12-09 19:09:18,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164409 states. [2018-12-09 19:09:18,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164409 states to 164409 states and 606496 transitions. [2018-12-09 19:09:18,631 INFO L78 Accepts]: Start accepts. Automaton has 164409 states and 606496 transitions. Word has length 53 [2018-12-09 19:09:18,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:09:18,631 INFO L480 AbstractCegarLoop]: Abstraction has 164409 states and 606496 transitions. [2018-12-09 19:09:18,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:09:18,632 INFO L276 IsEmpty]: Start isEmpty. Operand 164409 states and 606496 transitions. [2018-12-09 19:09:18,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 19:09:18,644 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:09:18,644 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] [2018-12-09 19:09:18,644 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:09:18,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:09:18,644 INFO L82 PathProgramCache]: Analyzing trace with hash -721809298, now seen corresponding path program 1 times [2018-12-09 19:09:18,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:09:18,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:18,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:09:18,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:18,646 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:09:18,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:09:18,708 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-09 19:09:18,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:09:18,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:09:18,709 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:09:18,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:09:18,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:09:18,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:09:18,710 INFO L87 Difference]: Start difference. First operand 164409 states and 606496 transitions. Second operand 6 states. [2018-12-09 19:09:19,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:09:19,887 INFO L93 Difference]: Finished difference Result 215866 states and 792770 transitions. [2018-12-09 19:09:19,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:09:19,888 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-09 19:09:19,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:09:20,355 INFO L225 Difference]: With dead ends: 215866 [2018-12-09 19:09:20,355 INFO L226 Difference]: Without dead ends: 215866 [2018-12-09 19:09:20,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:09:22,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215866 states. [2018-12-09 19:09:26,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215866 to 201215. [2018-12-09 19:09:26,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201215 states. [2018-12-09 19:09:26,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201215 states to 201215 states and 739037 transitions. [2018-12-09 19:09:26,773 INFO L78 Accepts]: Start accepts. Automaton has 201215 states and 739037 transitions. Word has length 53 [2018-12-09 19:09:26,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:09:26,773 INFO L480 AbstractCegarLoop]: Abstraction has 201215 states and 739037 transitions. [2018-12-09 19:09:26,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:09:26,774 INFO L276 IsEmpty]: Start isEmpty. Operand 201215 states and 739037 transitions. [2018-12-09 19:09:26,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 19:09:26,788 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:09:26,788 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] [2018-12-09 19:09:26,788 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:09:26,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:09:26,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1776206639, now seen corresponding path program 1 times [2018-12-09 19:09:26,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:09:26,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:26,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:09:26,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:26,790 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:09:26,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:09:26,846 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-09 19:09:26,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:09:26,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:09:26,847 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:09:26,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:09:26,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:09:26,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:09:26,847 INFO L87 Difference]: Start difference. First operand 201215 states and 739037 transitions. Second operand 7 states. [2018-12-09 19:09:28,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:09:28,426 INFO L93 Difference]: Finished difference Result 286186 states and 1016985 transitions. [2018-12-09 19:09:28,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 19:09:28,427 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-12-09 19:09:28,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:09:29,399 INFO L225 Difference]: With dead ends: 286186 [2018-12-09 19:09:29,399 INFO L226 Difference]: Without dead ends: 286186 [2018-12-09 19:09:29,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-09 19:09:31,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286186 states. [2018-12-09 19:09:33,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286186 to 229832. [2018-12-09 19:09:33,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229832 states. [2018-12-09 19:09:34,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229832 states to 229832 states and 831774 transitions. [2018-12-09 19:09:34,813 INFO L78 Accepts]: Start accepts. Automaton has 229832 states and 831774 transitions. Word has length 53 [2018-12-09 19:09:34,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:09:34,814 INFO L480 AbstractCegarLoop]: Abstraction has 229832 states and 831774 transitions. [2018-12-09 19:09:34,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:09:34,814 INFO L276 IsEmpty]: Start isEmpty. Operand 229832 states and 831774 transitions. [2018-12-09 19:09:34,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 19:09:34,828 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:09:34,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, 1] [2018-12-09 19:09:34,828 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:09:34,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:09:34,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1631256976, now seen corresponding path program 1 times [2018-12-09 19:09:34,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:09:34,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:34,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:09:34,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:34,830 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:09:34,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:09:34,859 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-09 19:09:34,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:09:34,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:09:34,860 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:09:34,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:09:34,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:09:34,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:09:34,861 INFO L87 Difference]: Start difference. First operand 229832 states and 831774 transitions. Second operand 4 states. [2018-12-09 19:09:34,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:09:34,972 INFO L93 Difference]: Finished difference Result 38679 states and 122684 transitions. [2018-12-09 19:09:34,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:09:34,973 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2018-12-09 19:09:34,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:09:35,013 INFO L225 Difference]: With dead ends: 38679 [2018-12-09 19:09:35,013 INFO L226 Difference]: Without dead ends: 32083 [2018-12-09 19:09:35,014 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-09 19:09:35,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32083 states. [2018-12-09 19:09:35,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32083 to 31836. [2018-12-09 19:09:35,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31836 states. [2018-12-09 19:09:35,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31836 states to 31836 states and 99515 transitions. [2018-12-09 19:09:35,357 INFO L78 Accepts]: Start accepts. Automaton has 31836 states and 99515 transitions. Word has length 53 [2018-12-09 19:09:35,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:09:35,357 INFO L480 AbstractCegarLoop]: Abstraction has 31836 states and 99515 transitions. [2018-12-09 19:09:35,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:09:35,357 INFO L276 IsEmpty]: Start isEmpty. Operand 31836 states and 99515 transitions. [2018-12-09 19:09:35,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-09 19:09:35,361 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:09:35,361 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] [2018-12-09 19:09:35,362 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:09:35,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:09:35,362 INFO L82 PathProgramCache]: Analyzing trace with hash -917178143, now seen corresponding path program 1 times [2018-12-09 19:09:35,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:09:35,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:35,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:09:35,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:35,363 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:09:35,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:09:35,404 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-09 19:09:35,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:09:35,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:09:35,404 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:09:35,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:09:35,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:09:35,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:09:35,404 INFO L87 Difference]: Start difference. First operand 31836 states and 99515 transitions. Second operand 4 states. [2018-12-09 19:09:35,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:09:35,626 INFO L93 Difference]: Finished difference Result 41208 states and 129949 transitions. [2018-12-09 19:09:35,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:09:35,627 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-09 19:09:35,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:09:35,680 INFO L225 Difference]: With dead ends: 41208 [2018-12-09 19:09:35,680 INFO L226 Difference]: Without dead ends: 41208 [2018-12-09 19:09:35,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:09:35,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41208 states. [2018-12-09 19:09:36,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41208 to 35932. [2018-12-09 19:09:36,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35932 states. [2018-12-09 19:09:36,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35932 states to 35932 states and 112644 transitions. [2018-12-09 19:09:36,090 INFO L78 Accepts]: Start accepts. Automaton has 35932 states and 112644 transitions. Word has length 63 [2018-12-09 19:09:36,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:09:36,090 INFO L480 AbstractCegarLoop]: Abstraction has 35932 states and 112644 transitions. [2018-12-09 19:09:36,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:09:36,090 INFO L276 IsEmpty]: Start isEmpty. Operand 35932 states and 112644 transitions. [2018-12-09 19:09:36,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-09 19:09:36,095 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:09:36,095 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] [2018-12-09 19:09:36,096 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:09:36,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:09:36,096 INFO L82 PathProgramCache]: Analyzing trace with hash 825632192, now seen corresponding path program 1 times [2018-12-09 19:09:36,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:09:36,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:36,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:09:36,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:36,098 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:09:36,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:09:36,147 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-09 19:09:36,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:09:36,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:09:36,148 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:09:36,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:09:36,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:09:36,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:09:36,148 INFO L87 Difference]: Start difference. First operand 35932 states and 112644 transitions. Second operand 6 states. [2018-12-09 19:09:36,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:09:36,672 INFO L93 Difference]: Finished difference Result 72509 states and 225560 transitions. [2018-12-09 19:09:36,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 19:09:36,673 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2018-12-09 19:09:36,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:09:36,768 INFO L225 Difference]: With dead ends: 72509 [2018-12-09 19:09:36,769 INFO L226 Difference]: Without dead ends: 72445 [2018-12-09 19:09:36,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-09 19:09:36,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72445 states. [2018-12-09 19:09:38,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72445 to 40892. [2018-12-09 19:09:38,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40892 states. [2018-12-09 19:09:38,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40892 states to 40892 states and 126622 transitions. [2018-12-09 19:09:38,144 INFO L78 Accepts]: Start accepts. Automaton has 40892 states and 126622 transitions. Word has length 63 [2018-12-09 19:09:38,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:09:38,144 INFO L480 AbstractCegarLoop]: Abstraction has 40892 states and 126622 transitions. [2018-12-09 19:09:38,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:09:38,145 INFO L276 IsEmpty]: Start isEmpty. Operand 40892 states and 126622 transitions. [2018-12-09 19:09:38,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-09 19:09:38,154 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:09:38,154 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] [2018-12-09 19:09:38,154 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:09:38,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:09:38,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1816196687, now seen corresponding path program 1 times [2018-12-09 19:09:38,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:09:38,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:38,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:09:38,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:38,156 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:09:38,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:09:38,172 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-09 19:09:38,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:09:38,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:09:38,172 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:09:38,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:09:38,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:09:38,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:09:38,172 INFO L87 Difference]: Start difference. First operand 40892 states and 126622 transitions. Second operand 3 states. [2018-12-09 19:09:38,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:09:38,299 INFO L93 Difference]: Finished difference Result 46897 states and 143099 transitions. [2018-12-09 19:09:38,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:09:38,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-12-09 19:09:38,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:09:38,355 INFO L225 Difference]: With dead ends: 46897 [2018-12-09 19:09:38,355 INFO L226 Difference]: Without dead ends: 46897 [2018-12-09 19:09:38,355 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-09 19:09:38,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46897 states. [2018-12-09 19:09:38,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46897 to 40580. [2018-12-09 19:09:38,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40580 states. [2018-12-09 19:09:38,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40580 states to 40580 states and 123024 transitions. [2018-12-09 19:09:38,803 INFO L78 Accepts]: Start accepts. Automaton has 40580 states and 123024 transitions. Word has length 69 [2018-12-09 19:09:38,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:09:38,804 INFO L480 AbstractCegarLoop]: Abstraction has 40580 states and 123024 transitions. [2018-12-09 19:09:38,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:09:38,804 INFO L276 IsEmpty]: Start isEmpty. Operand 40580 states and 123024 transitions. [2018-12-09 19:09:38,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-09 19:09:38,812 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:09:38,812 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] [2018-12-09 19:09:38,812 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:09:38,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:09:38,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1992546375, now seen corresponding path program 1 times [2018-12-09 19:09:38,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:09:38,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:38,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:09:38,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:38,814 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:09:38,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:09:38,861 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-09 19:09:38,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:09:38,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:09:38,861 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:09:38,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:09:38,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:09:38,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:09:38,861 INFO L87 Difference]: Start difference. First operand 40580 states and 123024 transitions. Second operand 7 states. [2018-12-09 19:09:39,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:09:39,622 INFO L93 Difference]: Finished difference Result 56545 states and 170864 transitions. [2018-12-09 19:09:39,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 19:09:39,622 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2018-12-09 19:09:39,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:09:39,694 INFO L225 Difference]: With dead ends: 56545 [2018-12-09 19:09:39,694 INFO L226 Difference]: Without dead ends: 56241 [2018-12-09 19:09:39,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-12-09 19:09:39,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56241 states. [2018-12-09 19:09:40,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56241 to 47672. [2018-12-09 19:09:40,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47672 states. [2018-12-09 19:09:40,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47672 states to 47672 states and 144131 transitions. [2018-12-09 19:09:40,238 INFO L78 Accepts]: Start accepts. Automaton has 47672 states and 144131 transitions. Word has length 70 [2018-12-09 19:09:40,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:09:40,239 INFO L480 AbstractCegarLoop]: Abstraction has 47672 states and 144131 transitions. [2018-12-09 19:09:40,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:09:40,239 INFO L276 IsEmpty]: Start isEmpty. Operand 47672 states and 144131 transitions. [2018-12-09 19:09:40,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-09 19:09:40,370 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:09:40,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] [2018-12-09 19:09:40,370 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:09:40,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:09:40,370 INFO L82 PathProgramCache]: Analyzing trace with hash 505469562, now seen corresponding path program 1 times [2018-12-09 19:09:40,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:09:40,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:40,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:09:40,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:40,371 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:09:40,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:09:40,435 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-09 19:09:40,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:09:40,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 19:09:40,436 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:09:40,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 19:09:40,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 19:09:40,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:09:40,436 INFO L87 Difference]: Start difference. First operand 47672 states and 144131 transitions. Second operand 8 states. [2018-12-09 19:09:41,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:09:41,160 INFO L93 Difference]: Finished difference Result 57838 states and 172357 transitions. [2018-12-09 19:09:41,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 19:09:41,160 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 70 [2018-12-09 19:09:41,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:09:41,230 INFO L225 Difference]: With dead ends: 57838 [2018-12-09 19:09:41,230 INFO L226 Difference]: Without dead ends: 57838 [2018-12-09 19:09:41,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-12-09 19:09:41,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57838 states. [2018-12-09 19:09:41,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57838 to 50532. [2018-12-09 19:09:41,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50532 states. [2018-12-09 19:09:41,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50532 states to 50532 states and 152080 transitions. [2018-12-09 19:09:41,836 INFO L78 Accepts]: Start accepts. Automaton has 50532 states and 152080 transitions. Word has length 70 [2018-12-09 19:09:41,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:09:41,837 INFO L480 AbstractCegarLoop]: Abstraction has 50532 states and 152080 transitions. [2018-12-09 19:09:41,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 19:09:41,837 INFO L276 IsEmpty]: Start isEmpty. Operand 50532 states and 152080 transitions. [2018-12-09 19:09:41,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-09 19:09:41,848 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:09:41,848 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] [2018-12-09 19:09:41,849 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:09:41,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:09:41,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1392973243, now seen corresponding path program 1 times [2018-12-09 19:09:41,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:09:41,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:41,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:09:41,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:41,851 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:09:41,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:09:41,889 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-09 19:09:41,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:09:41,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:09:41,890 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:09:41,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:09:41,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:09:41,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:09:41,890 INFO L87 Difference]: Start difference. First operand 50532 states and 152080 transitions. Second operand 5 states. [2018-12-09 19:09:41,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:09:41,936 INFO L93 Difference]: Finished difference Result 13236 states and 33132 transitions. [2018-12-09 19:09:41,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:09:41,936 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-12-09 19:09:41,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:09:41,945 INFO L225 Difference]: With dead ends: 13236 [2018-12-09 19:09:41,945 INFO L226 Difference]: Without dead ends: 11116 [2018-12-09 19:09:41,945 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-09 19:09:41,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11116 states. [2018-12-09 19:09:42,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11116 to 8545. [2018-12-09 19:09:42,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8545 states. [2018-12-09 19:09:42,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8545 states to 8545 states and 21304 transitions. [2018-12-09 19:09:42,024 INFO L78 Accepts]: Start accepts. Automaton has 8545 states and 21304 transitions. Word has length 70 [2018-12-09 19:09:42,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:09:42,024 INFO L480 AbstractCegarLoop]: Abstraction has 8545 states and 21304 transitions. [2018-12-09 19:09:42,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:09:42,024 INFO L276 IsEmpty]: Start isEmpty. Operand 8545 states and 21304 transitions. [2018-12-09 19:09:42,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-09 19:09:42,030 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:09:42,030 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-09 19:09:42,030 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:09:42,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:09:42,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1668171352, now seen corresponding path program 1 times [2018-12-09 19:09:42,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:09:42,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:42,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:09:42,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:42,031 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:09:42,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:09:42,069 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-09 19:09:42,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:09:42,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:09:42,070 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:09:42,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:09:42,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:09:42,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:09:42,071 INFO L87 Difference]: Start difference. First operand 8545 states and 21304 transitions. Second operand 4 states. [2018-12-09 19:09:42,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:09:42,198 INFO L93 Difference]: Finished difference Result 9960 states and 24428 transitions. [2018-12-09 19:09:42,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:09:42,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2018-12-09 19:09:42,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:09:42,208 INFO L225 Difference]: With dead ends: 9960 [2018-12-09 19:09:42,208 INFO L226 Difference]: Without dead ends: 9960 [2018-12-09 19:09:42,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:09:42,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9960 states. [2018-12-09 19:09:42,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9960 to 9441. [2018-12-09 19:09:42,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9441 states. [2018-12-09 19:09:42,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9441 states to 9441 states and 23271 transitions. [2018-12-09 19:09:42,284 INFO L78 Accepts]: Start accepts. Automaton has 9441 states and 23271 transitions. Word has length 98 [2018-12-09 19:09:42,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:09:42,284 INFO L480 AbstractCegarLoop]: Abstraction has 9441 states and 23271 transitions. [2018-12-09 19:09:42,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:09:42,284 INFO L276 IsEmpty]: Start isEmpty. Operand 9441 states and 23271 transitions. [2018-12-09 19:09:42,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-09 19:09:42,291 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:09:42,291 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-09 19:09:42,291 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:09:42,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:09:42,291 INFO L82 PathProgramCache]: Analyzing trace with hash 549586601, now seen corresponding path program 1 times [2018-12-09 19:09:42,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:09:42,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:42,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:09:42,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:42,292 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:09:42,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:09:42,330 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-09 19:09:42,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:09:42,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:09:42,330 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:09:42,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:09:42,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:09:42,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:09:42,331 INFO L87 Difference]: Start difference. First operand 9441 states and 23271 transitions. Second operand 3 states. [2018-12-09 19:09:42,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:09:42,476 INFO L93 Difference]: Finished difference Result 12725 states and 30850 transitions. [2018-12-09 19:09:42,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:09:42,476 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2018-12-09 19:09:42,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:09:42,485 INFO L225 Difference]: With dead ends: 12725 [2018-12-09 19:09:42,486 INFO L226 Difference]: Without dead ends: 12725 [2018-12-09 19:09:42,486 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-09 19:09:42,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12725 states. [2018-12-09 19:09:42,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12725 to 11524. [2018-12-09 19:09:42,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11524 states. [2018-12-09 19:09:42,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11524 states to 11524 states and 28181 transitions. [2018-12-09 19:09:42,585 INFO L78 Accepts]: Start accepts. Automaton has 11524 states and 28181 transitions. Word has length 98 [2018-12-09 19:09:42,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:09:42,586 INFO L480 AbstractCegarLoop]: Abstraction has 11524 states and 28181 transitions. [2018-12-09 19:09:42,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:09:42,586 INFO L276 IsEmpty]: Start isEmpty. Operand 11524 states and 28181 transitions. [2018-12-09 19:09:42,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-09 19:09:42,593 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:09:42,593 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-09 19:09:42,593 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:09:42,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:09:42,593 INFO L82 PathProgramCache]: Analyzing trace with hash 2080182649, now seen corresponding path program 2 times [2018-12-09 19:09:42,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:09:42,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:42,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:09:42,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:42,595 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:09:42,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:09:42,643 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-09 19:09:42,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:09:42,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:09:42,643 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:09:42,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:09:42,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:09:42,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:09:42,644 INFO L87 Difference]: Start difference. First operand 11524 states and 28181 transitions. Second operand 6 states. [2018-12-09 19:09:42,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:09:42,949 INFO L93 Difference]: Finished difference Result 14264 states and 34204 transitions. [2018-12-09 19:09:42,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:09:42,950 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2018-12-09 19:09:42,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:09:42,959 INFO L225 Difference]: With dead ends: 14264 [2018-12-09 19:09:42,959 INFO L226 Difference]: Without dead ends: 14264 [2018-12-09 19:09:42,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:09:42,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14264 states. [2018-12-09 19:09:43,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14264 to 11317. [2018-12-09 19:09:43,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11317 states. [2018-12-09 19:09:43,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11317 states to 11317 states and 27219 transitions. [2018-12-09 19:09:43,059 INFO L78 Accepts]: Start accepts. Automaton has 11317 states and 27219 transitions. Word has length 98 [2018-12-09 19:09:43,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:09:43,060 INFO L480 AbstractCegarLoop]: Abstraction has 11317 states and 27219 transitions. [2018-12-09 19:09:43,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:09:43,060 INFO L276 IsEmpty]: Start isEmpty. Operand 11317 states and 27219 transitions. [2018-12-09 19:09:43,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 19:09:43,067 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:09:43,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 19:09:43,067 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:09:43,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:09:43,068 INFO L82 PathProgramCache]: Analyzing trace with hash -789451851, now seen corresponding path program 1 times [2018-12-09 19:09:43,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:09:43,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:43,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:09:43,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:43,069 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:09:43,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:09:43,136 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-09 19:09:43,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:09:43,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:09:43,137 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:09:43,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:09:43,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:09:43,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:09:43,137 INFO L87 Difference]: Start difference. First operand 11317 states and 27219 transitions. Second operand 6 states. [2018-12-09 19:09:43,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:09:43,407 INFO L93 Difference]: Finished difference Result 13695 states and 32744 transitions. [2018-12-09 19:09:43,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:09:43,407 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-09 19:09:43,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:09:43,416 INFO L225 Difference]: With dead ends: 13695 [2018-12-09 19:09:43,416 INFO L226 Difference]: Without dead ends: 13663 [2018-12-09 19:09:43,417 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-09 19:09:43,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13663 states. [2018-12-09 19:09:43,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13663 to 12238. [2018-12-09 19:09:43,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12238 states. [2018-12-09 19:09:43,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12238 states to 12238 states and 29366 transitions. [2018-12-09 19:09:43,517 INFO L78 Accepts]: Start accepts. Automaton has 12238 states and 29366 transitions. Word has length 100 [2018-12-09 19:09:43,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:09:43,517 INFO L480 AbstractCegarLoop]: Abstraction has 12238 states and 29366 transitions. [2018-12-09 19:09:43,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:09:43,517 INFO L276 IsEmpty]: Start isEmpty. Operand 12238 states and 29366 transitions. [2018-12-09 19:09:43,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 19:09:43,524 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:09:43,524 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-09 19:09:43,525 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:09:43,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:09:43,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1708564086, now seen corresponding path program 1 times [2018-12-09 19:09:43,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:09:43,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:43,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:09:43,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:43,526 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:09:43,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:09:43,583 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-09 19:09:43,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:09:43,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:09:43,584 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:09:43,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:09:43,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:09:43,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:09:43,584 INFO L87 Difference]: Start difference. First operand 12238 states and 29366 transitions. Second operand 7 states. [2018-12-09 19:09:44,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:09:44,056 INFO L93 Difference]: Finished difference Result 18053 states and 43645 transitions. [2018-12-09 19:09:44,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 19:09:44,056 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2018-12-09 19:09:44,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:09:44,068 INFO L225 Difference]: With dead ends: 18053 [2018-12-09 19:09:44,068 INFO L226 Difference]: Without dead ends: 18053 [2018-12-09 19:09:44,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-12-09 19:09:44,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18053 states. [2018-12-09 19:09:44,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18053 to 12767. [2018-12-09 19:09:44,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12767 states. [2018-12-09 19:09:44,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12767 states to 12767 states and 30777 transitions. [2018-12-09 19:09:44,194 INFO L78 Accepts]: Start accepts. Automaton has 12767 states and 30777 transitions. Word has length 100 [2018-12-09 19:09:44,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:09:44,194 INFO L480 AbstractCegarLoop]: Abstraction has 12767 states and 30777 transitions. [2018-12-09 19:09:44,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:09:44,194 INFO L276 IsEmpty]: Start isEmpty. Operand 12767 states and 30777 transitions. [2018-12-09 19:09:44,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 19:09:44,203 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:09:44,203 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-09 19:09:44,204 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:09:44,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:09:44,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1698899529, now seen corresponding path program 1 times [2018-12-09 19:09:44,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:09:44,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:44,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:09:44,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:44,205 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:09:44,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:09:44,263 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-09 19:09:44,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:09:44,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:09:44,263 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:09:44,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:09:44,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:09:44,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:09:44,264 INFO L87 Difference]: Start difference. First operand 12767 states and 30777 transitions. Second operand 6 states. [2018-12-09 19:09:44,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:09:44,443 INFO L93 Difference]: Finished difference Result 15015 states and 35894 transitions. [2018-12-09 19:09:44,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:09:44,443 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-09 19:09:44,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:09:44,454 INFO L225 Difference]: With dead ends: 15015 [2018-12-09 19:09:44,454 INFO L226 Difference]: Without dead ends: 15015 [2018-12-09 19:09:44,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:09:44,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15015 states. [2018-12-09 19:09:44,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15015 to 13041. [2018-12-09 19:09:44,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13041 states. [2018-12-09 19:09:44,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13041 states to 13041 states and 31436 transitions. [2018-12-09 19:09:44,570 INFO L78 Accepts]: Start accepts. Automaton has 13041 states and 31436 transitions. Word has length 100 [2018-12-09 19:09:44,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:09:44,571 INFO L480 AbstractCegarLoop]: Abstraction has 13041 states and 31436 transitions. [2018-12-09 19:09:44,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:09:44,571 INFO L276 IsEmpty]: Start isEmpty. Operand 13041 states and 31436 transitions. [2018-12-09 19:09:44,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 19:09:44,580 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:09:44,580 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-09 19:09:44,580 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:09:44,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:09:44,580 INFO L82 PathProgramCache]: Analyzing trace with hash -329492203, now seen corresponding path program 1 times [2018-12-09 19:09:44,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:09:44,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:44,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:09:44,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:44,581 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:09:44,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:09:44,649 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-09 19:09:44,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:09:44,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:09:44,650 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:09:44,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:09:44,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:09:44,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:09:44,650 INFO L87 Difference]: Start difference. First operand 13041 states and 31436 transitions. Second operand 6 states. [2018-12-09 19:09:44,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:09:44,762 INFO L93 Difference]: Finished difference Result 12769 states and 30484 transitions. [2018-12-09 19:09:44,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:09:44,762 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-09 19:09:44,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:09:44,771 INFO L225 Difference]: With dead ends: 12769 [2018-12-09 19:09:44,771 INFO L226 Difference]: Without dead ends: 12769 [2018-12-09 19:09:44,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:09:44,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12769 states. [2018-12-09 19:09:44,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12769 to 10327. [2018-12-09 19:09:44,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10327 states. [2018-12-09 19:09:44,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10327 states to 10327 states and 24777 transitions. [2018-12-09 19:09:44,860 INFO L78 Accepts]: Start accepts. Automaton has 10327 states and 24777 transitions. Word has length 100 [2018-12-09 19:09:44,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:09:44,860 INFO L480 AbstractCegarLoop]: Abstraction has 10327 states and 24777 transitions. [2018-12-09 19:09:44,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:09:44,860 INFO L276 IsEmpty]: Start isEmpty. Operand 10327 states and 24777 transitions. [2018-12-09 19:09:44,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 19:09:44,867 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:09:44,867 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-09 19:09:44,867 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:09:44,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:09:44,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1824196817, now seen corresponding path program 1 times [2018-12-09 19:09:44,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:09:44,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:44,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:09:44,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:44,868 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:09:44,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:09:44,900 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-09 19:09:44,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:09:44,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:09:44,900 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:09:44,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:09:44,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:09:44,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:09:44,901 INFO L87 Difference]: Start difference. First operand 10327 states and 24777 transitions. Second operand 5 states. [2018-12-09 19:09:45,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:09:45,056 INFO L93 Difference]: Finished difference Result 12330 states and 29018 transitions. [2018-12-09 19:09:45,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:09:45,056 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2018-12-09 19:09:45,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:09:45,066 INFO L225 Difference]: With dead ends: 12330 [2018-12-09 19:09:45,066 INFO L226 Difference]: Without dead ends: 12330 [2018-12-09 19:09:45,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:09:45,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12330 states. [2018-12-09 19:09:45,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12330 to 10500. [2018-12-09 19:09:45,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10500 states. [2018-12-09 19:09:45,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10500 states to 10500 states and 25146 transitions. [2018-12-09 19:09:45,161 INFO L78 Accepts]: Start accepts. Automaton has 10500 states and 25146 transitions. Word has length 100 [2018-12-09 19:09:45,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:09:45,161 INFO L480 AbstractCegarLoop]: Abstraction has 10500 states and 25146 transitions. [2018-12-09 19:09:45,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:09:45,162 INFO L276 IsEmpty]: Start isEmpty. Operand 10500 states and 25146 transitions. [2018-12-09 19:09:45,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 19:09:45,169 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:09:45,169 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-09 19:09:45,170 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:09:45,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:09:45,170 INFO L82 PathProgramCache]: Analyzing trace with hash -309091398, now seen corresponding path program 1 times [2018-12-09 19:09:45,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:09:45,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:45,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:09:45,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:45,171 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:09:45,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:09:45,240 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-09 19:09:45,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:09:45,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 19:09:45,240 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:09:45,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 19:09:45,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 19:09:45,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:09:45,241 INFO L87 Difference]: Start difference. First operand 10500 states and 25146 transitions. Second operand 8 states. [2018-12-09 19:09:46,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:09:46,813 INFO L93 Difference]: Finished difference Result 18823 states and 44161 transitions. [2018-12-09 19:09:46,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-09 19:09:46,814 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 102 [2018-12-09 19:09:46,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:09:46,827 INFO L225 Difference]: With dead ends: 18823 [2018-12-09 19:09:46,827 INFO L226 Difference]: Without dead ends: 18728 [2018-12-09 19:09:46,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2018-12-09 19:09:46,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18728 states. [2018-12-09 19:09:46,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18728 to 13537. [2018-12-09 19:09:46,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13537 states. [2018-12-09 19:09:46,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13537 states to 13537 states and 32323 transitions. [2018-12-09 19:09:46,961 INFO L78 Accepts]: Start accepts. Automaton has 13537 states and 32323 transitions. Word has length 102 [2018-12-09 19:09:46,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:09:46,962 INFO L480 AbstractCegarLoop]: Abstraction has 13537 states and 32323 transitions. [2018-12-09 19:09:46,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 19:09:46,962 INFO L276 IsEmpty]: Start isEmpty. Operand 13537 states and 32323 transitions. [2018-12-09 19:09:46,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 19:09:46,972 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:09:46,972 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 19:09:46,972 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:09:46,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:09:46,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1908666555, now seen corresponding path program 1 times [2018-12-09 19:09:46,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:09:46,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:46,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:09:46,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:46,974 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:09:46,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:09:47,068 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-09 19:09:47,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:09:47,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:09:47,068 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:09:47,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:09:47,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:09:47,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:09:47,069 INFO L87 Difference]: Start difference. First operand 13537 states and 32323 transitions. Second operand 7 states. [2018-12-09 19:09:47,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:09:47,370 INFO L93 Difference]: Finished difference Result 18636 states and 43263 transitions. [2018-12-09 19:09:47,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 19:09:47,370 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-09 19:09:47,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:09:47,382 INFO L225 Difference]: With dead ends: 18636 [2018-12-09 19:09:47,383 INFO L226 Difference]: Without dead ends: 18636 [2018-12-09 19:09:47,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-12-09 19:09:47,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18636 states. [2018-12-09 19:09:47,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18636 to 15989. [2018-12-09 19:09:47,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15989 states. [2018-12-09 19:09:47,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15989 states to 15989 states and 37604 transitions. [2018-12-09 19:09:47,544 INFO L78 Accepts]: Start accepts. Automaton has 15989 states and 37604 transitions. Word has length 102 [2018-12-09 19:09:47,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:09:47,544 INFO L480 AbstractCegarLoop]: Abstraction has 15989 states and 37604 transitions. [2018-12-09 19:09:47,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:09:47,544 INFO L276 IsEmpty]: Start isEmpty. Operand 15989 states and 37604 transitions. [2018-12-09 19:09:47,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 19:09:47,555 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:09:47,555 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-09 19:09:47,555 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:09:47,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:09:47,556 INFO L82 PathProgramCache]: Analyzing trace with hash 2120017468, now seen corresponding path program 1 times [2018-12-09 19:09:47,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:09:47,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:47,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:09:47,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:47,557 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:09:47,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:09:47,635 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-09 19:09:47,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:09:47,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 19:09:47,636 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:09:47,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 19:09:47,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 19:09:47,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-12-09 19:09:47,636 INFO L87 Difference]: Start difference. First operand 15989 states and 37604 transitions. Second operand 11 states. [2018-12-09 19:09:48,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:09:48,167 INFO L93 Difference]: Finished difference Result 18309 states and 42698 transitions. [2018-12-09 19:09:48,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-09 19:09:48,167 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 102 [2018-12-09 19:09:48,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:09:48,179 INFO L225 Difference]: With dead ends: 18309 [2018-12-09 19:09:48,179 INFO L226 Difference]: Without dead ends: 18309 [2018-12-09 19:09:48,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2018-12-09 19:09:48,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18309 states. [2018-12-09 19:09:48,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18309 to 16306. [2018-12-09 19:09:48,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16306 states. [2018-12-09 19:09:48,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16306 states to 16306 states and 38339 transitions. [2018-12-09 19:09:48,327 INFO L78 Accepts]: Start accepts. Automaton has 16306 states and 38339 transitions. Word has length 102 [2018-12-09 19:09:48,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:09:48,327 INFO L480 AbstractCegarLoop]: Abstraction has 16306 states and 38339 transitions. [2018-12-09 19:09:48,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 19:09:48,327 INFO L276 IsEmpty]: Start isEmpty. Operand 16306 states and 38339 transitions. [2018-12-09 19:09:48,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 19:09:48,338 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:09:48,338 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-09 19:09:48,338 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:09:48,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:09:48,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1287446147, now seen corresponding path program 1 times [2018-12-09 19:09:48,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:09:48,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:48,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:09:48,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:48,340 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:09:48,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:09:48,453 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-09 19:09:48,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:09:48,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 19:09:48,453 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:09:48,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 19:09:48,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 19:09:48,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-12-09 19:09:48,454 INFO L87 Difference]: Start difference. First operand 16306 states and 38339 transitions. Second operand 11 states. [2018-12-09 19:09:48,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:09:48,826 INFO L93 Difference]: Finished difference Result 30316 states and 71658 transitions. [2018-12-09 19:09:48,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 19:09:48,826 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 102 [2018-12-09 19:09:48,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:09:48,829 INFO L225 Difference]: With dead ends: 30316 [2018-12-09 19:09:48,829 INFO L226 Difference]: Without dead ends: 4010 [2018-12-09 19:09:48,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2018-12-09 19:09:48,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4010 states. [2018-12-09 19:09:48,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4010 to 4008. [2018-12-09 19:09:48,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4008 states. [2018-12-09 19:09:48,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4008 states to 4008 states and 9530 transitions. [2018-12-09 19:09:48,854 INFO L78 Accepts]: Start accepts. Automaton has 4008 states and 9530 transitions. Word has length 102 [2018-12-09 19:09:48,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:09:48,854 INFO L480 AbstractCegarLoop]: Abstraction has 4008 states and 9530 transitions. [2018-12-09 19:09:48,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 19:09:48,854 INFO L276 IsEmpty]: Start isEmpty. Operand 4008 states and 9530 transitions. [2018-12-09 19:09:48,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 19:09:48,856 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:09:48,856 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-09 19:09:48,856 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:09:48,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:09:48,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1904655584, now seen corresponding path program 2 times [2018-12-09 19:09:48,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:09:48,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:48,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:09:48,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:48,858 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:09:48,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:09:48,907 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-09 19:09:48,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:09:48,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:09:48,907 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:09:48,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:09:48,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:09:48,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:09:48,908 INFO L87 Difference]: Start difference. First operand 4008 states and 9530 transitions. Second operand 5 states. [2018-12-09 19:09:48,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:09:48,931 INFO L93 Difference]: Finished difference Result 4008 states and 9514 transitions. [2018-12-09 19:09:48,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:09:48,931 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2018-12-09 19:09:48,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:09:48,934 INFO L225 Difference]: With dead ends: 4008 [2018-12-09 19:09:48,934 INFO L226 Difference]: Without dead ends: 4008 [2018-12-09 19:09:48,934 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-09 19:09:48,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4008 states. [2018-12-09 19:09:48,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4008 to 3631. [2018-12-09 19:09:48,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3631 states. [2018-12-09 19:09:48,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3631 states to 3631 states and 8653 transitions. [2018-12-09 19:09:48,959 INFO L78 Accepts]: Start accepts. Automaton has 3631 states and 8653 transitions. Word has length 102 [2018-12-09 19:09:48,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:09:48,959 INFO L480 AbstractCegarLoop]: Abstraction has 3631 states and 8653 transitions. [2018-12-09 19:09:48,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:09:48,960 INFO L276 IsEmpty]: Start isEmpty. Operand 3631 states and 8653 transitions. [2018-12-09 19:09:48,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 19:09:48,962 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:09:48,962 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-09 19:09:48,962 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:09:48,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:09:48,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1017151903, now seen corresponding path program 2 times [2018-12-09 19:09:48,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:09:48,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:48,963 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:09:48,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:48,963 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:09:48,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:09:49,087 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-09 19:09:49,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:09:49,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-09 19:09:49,087 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:09:49,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 19:09:49,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 19:09:49,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-12-09 19:09:49,088 INFO L87 Difference]: Start difference. First operand 3631 states and 8653 transitions. Second operand 13 states. [2018-12-09 19:09:49,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:09:49,524 INFO L93 Difference]: Finished difference Result 5643 states and 13210 transitions. [2018-12-09 19:09:49,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 19:09:49,525 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 102 [2018-12-09 19:09:49,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:09:49,528 INFO L225 Difference]: With dead ends: 5643 [2018-12-09 19:09:49,528 INFO L226 Difference]: Without dead ends: 4149 [2018-12-09 19:09:49,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2018-12-09 19:09:49,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4149 states. [2018-12-09 19:09:49,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4149 to 3687. [2018-12-09 19:09:49,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3687 states. [2018-12-09 19:09:49,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3687 states to 3687 states and 8715 transitions. [2018-12-09 19:09:49,555 INFO L78 Accepts]: Start accepts. Automaton has 3687 states and 8715 transitions. Word has length 102 [2018-12-09 19:09:49,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:09:49,555 INFO L480 AbstractCegarLoop]: Abstraction has 3687 states and 8715 transitions. [2018-12-09 19:09:49,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 19:09:49,555 INFO L276 IsEmpty]: Start isEmpty. Operand 3687 states and 8715 transitions. [2018-12-09 19:09:49,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 19:09:49,557 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:09:49,557 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-09 19:09:49,558 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:09:49,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:09:49,558 INFO L82 PathProgramCache]: Analyzing trace with hash -604299489, now seen corresponding path program 3 times [2018-12-09 19:09:49,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:09:49,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:49,559 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:09:49,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:49,559 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:09:49,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 19:09:49,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 19:09:49,595 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 19:09:49,664 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 19:09:49,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 07:09:49 BasicIcfg [2018-12-09 19:09:49,665 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 19:09:49,665 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 19:09:49,666 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 19:09:49,666 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 19:09:49,666 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:08:46" (3/4) ... [2018-12-09 19:09:49,668 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 19:09:49,742 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c6618223-c0e0-401e-a64b-f7287a32d79d/bin-2019/utaipan/witness.graphml [2018-12-09 19:09:49,742 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 19:09:49,743 INFO L168 Benchmark]: Toolchain (without parser) took 64235.21 ms. Allocated memory was 1.0 GB in the beginning and 6.1 GB in the end (delta: 5.1 GB). Free memory was 952.4 MB in the beginning and 4.5 GB in the end (delta: -3.6 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2018-12-09 19:09:49,744 INFO L168 Benchmark]: CDTParser took 0.14 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-09 19:09:49,744 INFO L168 Benchmark]: CACSL2BoogieTranslator took 325.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -150.3 MB). Peak memory consumption was 37.1 MB. Max. memory is 11.5 GB. [2018-12-09 19:09:49,744 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.45 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:09:49,744 INFO L168 Benchmark]: Boogie Preprocessor took 20.04 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:09:49,744 INFO L168 Benchmark]: RCFGBuilder took 411.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.9 MB). Peak memory consumption was 56.9 MB. Max. memory is 11.5 GB. [2018-12-09 19:09:49,745 INFO L168 Benchmark]: TraceAbstraction took 63365.65 ms. Allocated memory was 1.2 GB in the beginning and 6.1 GB in the end (delta: 5.0 GB). Free memory was 1.0 GB in the beginning and 4.6 GB in the end (delta: -3.5 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2018-12-09 19:09:49,745 INFO L168 Benchmark]: Witness Printer took 76.52 ms. Allocated memory is still 6.1 GB. Free memory was 4.6 GB in the beginning and 4.5 GB in the end (delta: 37.5 MB). Peak memory consumption was 37.5 MB. Max. memory is 11.5 GB. [2018-12-09 19:09:49,747 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.14 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 325.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -150.3 MB). Peak memory consumption was 37.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.45 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.04 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 411.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.9 MB). Peak memory consumption was 56.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 63365.65 ms. Allocated memory was 1.2 GB in the beginning and 6.1 GB in the end (delta: 5.0 GB). Free memory was 1.0 GB in the beginning and 4.6 GB in the end (delta: -3.5 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 76.52 ms. Allocated memory is still 6.1 GB. Free memory was 4.6 GB in the beginning and 4.5 GB in the end (delta: 37.5 MB). Peak memory consumption was 37.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L678] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L679] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L680] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L682] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L684] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L685] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L686] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L687] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L688] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L689] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L690] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L691] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L692] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L693] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L694] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L695] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L696] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L697] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L698] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L699] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L700] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L786] -1 pthread_t t1767; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] FCALL, FORK -1 pthread_create(&t1767, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L788] -1 pthread_t t1768; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L789] FCALL, FORK -1 pthread_create(&t1768, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L734] 0 y$w_buff1 = y$w_buff0 [L735] 0 y$w_buff0 = 1 [L736] 0 y$w_buff1_used = y$w_buff0_used [L737] 0 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L739] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L740] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L741] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L742] 0 y$r_buff0_thd2 = (_Bool)1 [L745] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L746] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L747] 0 y$flush_delayed = weak$$choice2 [L748] 0 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] 0 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L750] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L751] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L751] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L752] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L753] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L753] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L754] EXPR 0 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 0 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L755] EXPR 0 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L755] 0 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L756] 0 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] EXPR 0 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 0 y = y$flush_delayed ? y$mem_tmp : y [L758] 0 y$flush_delayed = (_Bool)0 [L761] 0 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L704] 1 x = 1 [L709] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L710] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L711] 1 y$flush_delayed = weak$$choice2 [L712] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L713] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] 0 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L765] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L765] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L766] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L766] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L713] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L714] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L714] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L715] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L715] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L767] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L767] 0 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L768] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L768] 0 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L771] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L716] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L716] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L717] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L717] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L718] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L718] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L719] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L719] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L720] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L721] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L721] 1 y = y$flush_delayed ? y$mem_tmp : y [L722] 1 y$flush_delayed = (_Bool)0 [L727] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L791] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] -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) [L796] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L796] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L797] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] -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 [L798] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L799] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] -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 [L802] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L5] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L5] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 283 locations, 3 error locations. UNSAFE Result, 63.2s OverallTime, 29 OverallIterations, 1 TraceHistogramMax, 22.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 10696 SDtfs, 13821 SDslu, 29104 SDs, 0 SdLazy, 11747 SolverSat, 705 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 292 GetRequests, 70 SyntacticMatches, 13 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=229832occurred in iteration=7, 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: 32.8s AutomataMinimizationTime, 28 MinimizatonAttempts, 511168 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 2305 NumberOfCodeBlocks, 2305 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2175 ConstructedInterpolants, 0 QuantifiedInterpolants, 484909 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...