./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix056_tso.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5f0cca6e-ada5-4589-aec2-4eb2e1bce30d/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5f0cca6e-ada5-4589-aec2-4eb2e1bce30d/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5f0cca6e-ada5-4589-aec2-4eb2e1bce30d/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5f0cca6e-ada5-4589-aec2-4eb2e1bce30d/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix056_tso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_5f0cca6e-ada5-4589-aec2-4eb2e1bce30d/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5f0cca6e-ada5-4589-aec2-4eb2e1bce30d/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 bb399b49d562562005292857f055e3a5f2e4f47f ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 08:36:33,954 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 08:36:33,955 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 08:36:33,962 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 08:36:33,962 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 08:36:33,963 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 08:36:33,964 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 08:36:33,965 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 08:36:33,966 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 08:36:33,967 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 08:36:33,967 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 08:36:33,967 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 08:36:33,968 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 08:36:33,969 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 08:36:33,970 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 08:36:33,970 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 08:36:33,971 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 08:36:33,972 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 08:36:33,973 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 08:36:33,974 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 08:36:33,975 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 08:36:33,976 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 08:36:33,977 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 08:36:33,978 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 08:36:33,978 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 08:36:33,978 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 08:36:33,979 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 08:36:33,980 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 08:36:33,980 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 08:36:33,981 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 08:36:33,981 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 08:36:33,982 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 08:36:33,982 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 08:36:33,982 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 08:36:33,983 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 08:36:33,983 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 08:36:33,983 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5f0cca6e-ada5-4589-aec2-4eb2e1bce30d/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 08:36:33,994 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 08:36:33,994 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 08:36:33,994 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 08:36:33,995 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 08:36:33,995 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 08:36:33,995 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 08:36:33,995 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 08:36:33,995 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 08:36:33,995 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 08:36:33,995 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 08:36:33,996 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 08:36:33,996 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 08:36:33,996 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 08:36:33,996 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 08:36:33,996 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 08:36:33,996 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 08:36:33,997 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 08:36:33,997 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 08:36:33,997 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 08:36:33,997 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 08:36:33,997 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 08:36:33,997 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 08:36:33,998 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 08:36:33,998 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 08:36:33,998 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 08:36:33,998 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 08:36:33,998 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 08:36:33,998 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 08:36:33,998 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 08:36:33,998 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 08:36:33,998 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 08:36:33,998 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 08:36:33,999 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 08:36:33,999 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 08:36:33,999 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 08:36:33,999 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 08:36:33,999 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_5f0cca6e-ada5-4589-aec2-4eb2e1bce30d/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 -> bb399b49d562562005292857f055e3a5f2e4f47f [2018-12-09 08:36:34,020 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 08:36:34,027 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 08:36:34,029 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 08:36:34,030 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 08:36:34,030 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 08:36:34,031 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5f0cca6e-ada5-4589-aec2-4eb2e1bce30d/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix056_tso.opt_false-unreach-call.i [2018-12-09 08:36:34,068 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5f0cca6e-ada5-4589-aec2-4eb2e1bce30d/bin-2019/utaipan/data/c7145e637/241d55005ae1468aa306ced7201a03ab/FLAGe56cdbcd9 [2018-12-09 08:36:34,416 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 08:36:34,416 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5f0cca6e-ada5-4589-aec2-4eb2e1bce30d/sv-benchmarks/c/pthread-wmm/mix056_tso.opt_false-unreach-call.i [2018-12-09 08:36:34,423 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5f0cca6e-ada5-4589-aec2-4eb2e1bce30d/bin-2019/utaipan/data/c7145e637/241d55005ae1468aa306ced7201a03ab/FLAGe56cdbcd9 [2018-12-09 08:36:34,431 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5f0cca6e-ada5-4589-aec2-4eb2e1bce30d/bin-2019/utaipan/data/c7145e637/241d55005ae1468aa306ced7201a03ab [2018-12-09 08:36:34,433 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 08:36:34,433 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 08:36:34,434 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 08:36:34,434 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 08:36:34,436 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 08:36:34,437 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 08:36:34" (1/1) ... [2018-12-09 08:36:34,438 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@159e01e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:36:34, skipping insertion in model container [2018-12-09 08:36:34,438 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 08:36:34" (1/1) ... [2018-12-09 08:36:34,442 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 08:36:34,463 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 08:36:34,650 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 08:36:34,660 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 08:36:34,737 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 08:36:34,767 INFO L195 MainTranslator]: Completed translation [2018-12-09 08:36:34,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:36:34 WrapperNode [2018-12-09 08:36:34,767 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 08:36:34,767 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 08:36:34,767 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 08:36:34,768 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 08:36:34,773 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:36:34" (1/1) ... [2018-12-09 08:36:34,783 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:36:34" (1/1) ... [2018-12-09 08:36:34,802 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 08:36:34,802 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 08:36:34,802 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 08:36:34,802 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 08:36:34,808 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:36:34" (1/1) ... [2018-12-09 08:36:34,809 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:36:34" (1/1) ... [2018-12-09 08:36:34,811 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:36:34" (1/1) ... [2018-12-09 08:36:34,811 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:36:34" (1/1) ... [2018-12-09 08:36:34,817 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:36:34" (1/1) ... [2018-12-09 08:36:34,819 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:36:34" (1/1) ... [2018-12-09 08:36:34,821 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:36:34" (1/1) ... [2018-12-09 08:36:34,823 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 08:36:34,823 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 08:36:34,823 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 08:36:34,823 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 08:36:34,824 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:36:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f0cca6e-ada5-4589-aec2-4eb2e1bce30d/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 08:36:34,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 08:36:34,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 08:36:34,855 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 08:36:34,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 08:36:34,855 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 08:36:34,855 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 08:36:34,855 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 08:36:34,855 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 08:36:34,855 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-09 08:36:34,856 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-09 08:36:34,856 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 08:36:34,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 08:36:34,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 08:36:34,857 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 08:36:35,200 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 08:36:35,200 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 08:36:35,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:36:35 BoogieIcfgContainer [2018-12-09 08:36:35,200 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 08:36:35,201 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 08:36:35,201 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 08:36:35,202 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 08:36:35,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 08:36:34" (1/3) ... [2018-12-09 08:36:35,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70442cf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 08:36:35, skipping insertion in model container [2018-12-09 08:36:35,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:36:34" (2/3) ... [2018-12-09 08:36:35,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70442cf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 08:36:35, skipping insertion in model container [2018-12-09 08:36:35,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:36:35" (3/3) ... [2018-12-09 08:36:35,204 INFO L112 eAbstractionObserver]: Analyzing ICFG mix056_tso.opt_false-unreach-call.i [2018-12-09 08:36:35,226 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,226 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,226 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,226 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,227 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,227 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,227 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,227 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,227 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,227 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,227 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,227 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,227 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,228 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,228 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,228 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,228 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,228 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,228 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,228 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,228 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,228 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,228 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,229 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,229 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,229 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,229 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,229 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,229 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,229 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,229 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,229 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,229 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,229 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,230 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,230 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,230 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,230 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,230 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,230 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,230 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,230 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,230 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,230 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,231 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,231 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,231 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,231 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,231 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,231 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,231 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,231 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,232 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,232 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,232 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,232 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,232 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,232 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,232 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,232 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,232 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,232 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,232 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,233 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,233 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,233 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,233 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,233 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,233 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,233 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,233 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,233 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,233 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,233 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,234 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,234 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,234 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,234 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,234 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,234 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,234 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,234 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:36:35,239 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 08:36:35,239 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 08:36:35,244 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 08:36:35,254 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 08:36:35,269 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 08:36:35,269 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 08:36:35,269 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 08:36:35,269 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 08:36:35,269 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 08:36:35,269 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 08:36:35,270 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 08:36:35,270 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 08:36:35,279 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 155places, 192 transitions [2018-12-09 08:36:49,984 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 128912 states. [2018-12-09 08:36:49,986 INFO L276 IsEmpty]: Start isEmpty. Operand 128912 states. [2018-12-09 08:36:49,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-09 08:36:49,993 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:36:49,993 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:36:49,995 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:36:49,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:36:49,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1928541482, now seen corresponding path program 1 times [2018-12-09 08:36:50,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:36:50,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:36:50,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:36:50,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:36:50,034 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:36:50,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:36:50,146 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 08:36:50,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:36:50,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 08:36:50,147 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 08:36:50,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 08:36:50,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 08:36:50,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 08:36:50,160 INFO L87 Difference]: Start difference. First operand 128912 states. Second operand 4 states. [2018-12-09 08:36:51,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:36:51,422 INFO L93 Difference]: Finished difference Result 233472 states and 1098324 transitions. [2018-12-09 08:36:51,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 08:36:51,424 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-12-09 08:36:51,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:36:53,885 INFO L225 Difference]: With dead ends: 233472 [2018-12-09 08:36:53,886 INFO L226 Difference]: Without dead ends: 203722 [2018-12-09 08:36:53,887 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 08:36:54,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203722 states. [2018-12-09 08:36:56,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203722 to 118892. [2018-12-09 08:36:56,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118892 states. [2018-12-09 08:36:57,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118892 states to 118892 states and 559775 transitions. [2018-12-09 08:36:57,179 INFO L78 Accepts]: Start accepts. Automaton has 118892 states and 559775 transitions. Word has length 43 [2018-12-09 08:36:57,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:36:57,472 INFO L480 AbstractCegarLoop]: Abstraction has 118892 states and 559775 transitions. [2018-12-09 08:36:57,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 08:36:57,472 INFO L276 IsEmpty]: Start isEmpty. Operand 118892 states and 559775 transitions. [2018-12-09 08:36:57,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 08:36:57,479 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:36:57,479 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:36:57,479 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:36:57,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:36:57,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1195634893, now seen corresponding path program 1 times [2018-12-09 08:36:57,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:36:57,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:36:57,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:36:57,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:36:57,482 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:36:57,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:36:57,522 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 08:36:57,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:36:57,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 08:36:57,522 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 08:36:57,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 08:36:57,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 08:36:57,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 08:36:57,524 INFO L87 Difference]: Start difference. First operand 118892 states and 559775 transitions. Second operand 3 states. [2018-12-09 08:36:58,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:36:58,049 INFO L93 Difference]: Finished difference Result 118892 states and 557815 transitions. [2018-12-09 08:36:58,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 08:36:58,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-09 08:36:58,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:36:58,356 INFO L225 Difference]: With dead ends: 118892 [2018-12-09 08:36:58,356 INFO L226 Difference]: Without dead ends: 118892 [2018-12-09 08:36:58,357 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 08:36:59,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118892 states. [2018-12-09 08:37:00,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118892 to 118892. [2018-12-09 08:37:00,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118892 states. [2018-12-09 08:37:00,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118892 states to 118892 states and 557815 transitions. [2018-12-09 08:37:00,922 INFO L78 Accepts]: Start accepts. Automaton has 118892 states and 557815 transitions. Word has length 50 [2018-12-09 08:37:00,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:37:00,923 INFO L480 AbstractCegarLoop]: Abstraction has 118892 states and 557815 transitions. [2018-12-09 08:37:00,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 08:37:00,923 INFO L276 IsEmpty]: Start isEmpty. Operand 118892 states and 557815 transitions. [2018-12-09 08:37:00,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 08:37:00,926 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:37:00,926 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:37:00,926 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:37:00,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:37:00,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1302381044, now seen corresponding path program 1 times [2018-12-09 08:37:00,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:37:00,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:37:00,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:37:00,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:37:00,929 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:37:00,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:37:00,975 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 08:37:00,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:37:00,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 08:37:00,975 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 08:37:00,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 08:37:00,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 08:37:00,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 08:37:00,976 INFO L87 Difference]: Start difference. First operand 118892 states and 557815 transitions. Second operand 5 states. [2018-12-09 08:37:02,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:37:02,814 INFO L93 Difference]: Finished difference Result 325272 states and 1468249 transitions. [2018-12-09 08:37:02,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 08:37:02,815 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-12-09 08:37:02,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:37:03,709 INFO L225 Difference]: With dead ends: 325272 [2018-12-09 08:37:03,709 INFO L226 Difference]: Without dead ends: 324272 [2018-12-09 08:37:03,709 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 08:37:07,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324272 states. [2018-12-09 08:37:10,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324272 to 186422. [2018-12-09 08:37:10,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186422 states. [2018-12-09 08:37:10,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186422 states to 186422 states and 840914 transitions. [2018-12-09 08:37:10,923 INFO L78 Accepts]: Start accepts. Automaton has 186422 states and 840914 transitions. Word has length 50 [2018-12-09 08:37:10,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:37:10,923 INFO L480 AbstractCegarLoop]: Abstraction has 186422 states and 840914 transitions. [2018-12-09 08:37:10,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 08:37:10,923 INFO L276 IsEmpty]: Start isEmpty. Operand 186422 states and 840914 transitions. [2018-12-09 08:37:10,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-09 08:37:10,929 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:37:10,929 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:37:10,929 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:37:10,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:37:10,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1678185933, now seen corresponding path program 1 times [2018-12-09 08:37:10,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:37:10,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:37:10,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:37:10,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:37:10,932 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:37:10,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:37:10,975 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 08:37:10,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:37:10,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 08:37:10,975 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 08:37:10,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 08:37:10,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 08:37:10,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 08:37:10,976 INFO L87 Difference]: Start difference. First operand 186422 states and 840914 transitions. Second operand 4 states. [2018-12-09 08:37:11,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:37:11,670 INFO L93 Difference]: Finished difference Result 163598 states and 725472 transitions. [2018-12-09 08:37:11,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 08:37:11,671 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-12-09 08:37:11,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:37:12,064 INFO L225 Difference]: With dead ends: 163598 [2018-12-09 08:37:12,064 INFO L226 Difference]: Without dead ends: 160993 [2018-12-09 08:37:12,064 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 08:37:13,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160993 states. [2018-12-09 08:37:14,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160993 to 160993. [2018-12-09 08:37:14,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160993 states. [2018-12-09 08:37:18,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160993 states to 160993 states and 716800 transitions. [2018-12-09 08:37:18,419 INFO L78 Accepts]: Start accepts. Automaton has 160993 states and 716800 transitions. Word has length 51 [2018-12-09 08:37:18,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:37:18,419 INFO L480 AbstractCegarLoop]: Abstraction has 160993 states and 716800 transitions. [2018-12-09 08:37:18,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 08:37:18,419 INFO L276 IsEmpty]: Start isEmpty. Operand 160993 states and 716800 transitions. [2018-12-09 08:37:18,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-09 08:37:18,424 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:37:18,425 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:37:18,425 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:37:18,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:37:18,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1667665363, now seen corresponding path program 1 times [2018-12-09 08:37:18,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:37:18,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:37:18,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:37:18,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:37:18,427 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:37:18,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:37:18,466 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 08:37:18,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:37:18,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 08:37:18,466 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 08:37:18,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 08:37:18,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 08:37:18,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 08:37:18,467 INFO L87 Difference]: Start difference. First operand 160993 states and 716800 transitions. Second operand 5 states. [2018-12-09 08:37:18,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:37:18,658 INFO L93 Difference]: Finished difference Result 51405 states and 209121 transitions. [2018-12-09 08:37:18,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 08:37:18,659 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-12-09 08:37:18,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:37:18,755 INFO L225 Difference]: With dead ends: 51405 [2018-12-09 08:37:18,755 INFO L226 Difference]: Without dead ends: 49093 [2018-12-09 08:37:18,756 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 08:37:18,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49093 states. [2018-12-09 08:37:19,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49093 to 49093. [2018-12-09 08:37:19,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49093 states. [2018-12-09 08:37:19,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49093 states to 49093 states and 200467 transitions. [2018-12-09 08:37:19,429 INFO L78 Accepts]: Start accepts. Automaton has 49093 states and 200467 transitions. Word has length 52 [2018-12-09 08:37:19,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:37:19,429 INFO L480 AbstractCegarLoop]: Abstraction has 49093 states and 200467 transitions. [2018-12-09 08:37:19,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 08:37:19,429 INFO L276 IsEmpty]: Start isEmpty. Operand 49093 states and 200467 transitions. [2018-12-09 08:37:19,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 08:37:19,437 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:37:19,437 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:37:19,437 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:37:19,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:37:19,437 INFO L82 PathProgramCache]: Analyzing trace with hash 503624572, now seen corresponding path program 1 times [2018-12-09 08:37:19,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:37:19,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:37:19,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:37:19,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:37:19,438 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:37:19,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:37:19,487 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 08:37:19,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:37:19,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 08:37:19,487 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 08:37:19,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 08:37:19,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 08:37:19,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 08:37:19,488 INFO L87 Difference]: Start difference. First operand 49093 states and 200467 transitions. Second operand 4 states. [2018-12-09 08:37:19,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:37:19,814 INFO L93 Difference]: Finished difference Result 70361 states and 282256 transitions. [2018-12-09 08:37:19,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 08:37:19,815 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-12-09 08:37:19,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:37:19,950 INFO L225 Difference]: With dead ends: 70361 [2018-12-09 08:37:19,950 INFO L226 Difference]: Without dead ends: 70361 [2018-12-09 08:37:19,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 08:37:20,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70361 states. [2018-12-09 08:37:20,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70361 to 53657. [2018-12-09 08:37:20,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53657 states. [2018-12-09 08:37:20,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53657 states to 53657 states and 217408 transitions. [2018-12-09 08:37:20,919 INFO L78 Accepts]: Start accepts. Automaton has 53657 states and 217408 transitions. Word has length 65 [2018-12-09 08:37:20,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:37:20,920 INFO L480 AbstractCegarLoop]: Abstraction has 53657 states and 217408 transitions. [2018-12-09 08:37:20,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 08:37:20,920 INFO L276 IsEmpty]: Start isEmpty. Operand 53657 states and 217408 transitions. [2018-12-09 08:37:20,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 08:37:20,931 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:37:20,931 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:37:20,931 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:37:20,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:37:20,931 INFO L82 PathProgramCache]: Analyzing trace with hash -2048532389, now seen corresponding path program 1 times [2018-12-09 08:37:20,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:37:20,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:37:20,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:37:20,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:37:20,933 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:37:20,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:37:20,984 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 08:37:20,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:37:20,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 08:37:20,984 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 08:37:20,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 08:37:20,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 08:37:20,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 08:37:20,985 INFO L87 Difference]: Start difference. First operand 53657 states and 217408 transitions. Second operand 6 states. [2018-12-09 08:37:21,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:37:21,053 INFO L93 Difference]: Finished difference Result 11001 states and 37616 transitions. [2018-12-09 08:37:21,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 08:37:21,053 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2018-12-09 08:37:21,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:37:21,065 INFO L225 Difference]: With dead ends: 11001 [2018-12-09 08:37:21,065 INFO L226 Difference]: Without dead ends: 9289 [2018-12-09 08:37:21,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-09 08:37:21,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9289 states. [2018-12-09 08:37:21,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9289 to 8774. [2018-12-09 08:37:21,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8774 states. [2018-12-09 08:37:21,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8774 states to 8774 states and 29920 transitions. [2018-12-09 08:37:21,153 INFO L78 Accepts]: Start accepts. Automaton has 8774 states and 29920 transitions. Word has length 65 [2018-12-09 08:37:21,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:37:21,154 INFO L480 AbstractCegarLoop]: Abstraction has 8774 states and 29920 transitions. [2018-12-09 08:37:21,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 08:37:21,154 INFO L276 IsEmpty]: Start isEmpty. Operand 8774 states and 29920 transitions. [2018-12-09 08:37:21,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-09 08:37:21,162 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:37:21,162 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 08:37:21,162 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:37:21,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:37:21,162 INFO L82 PathProgramCache]: Analyzing trace with hash 877472604, now seen corresponding path program 1 times [2018-12-09 08:37:21,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:37:21,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:37:21,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:37:21,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:37:21,164 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:37:21,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:37:21,192 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 08:37:21,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:37:21,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 08:37:21,192 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 08:37:21,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 08:37:21,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 08:37:21,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 08:37:21,193 INFO L87 Difference]: Start difference. First operand 8774 states and 29920 transitions. Second operand 3 states. [2018-12-09 08:37:21,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:37:21,293 INFO L93 Difference]: Finished difference Result 9194 states and 31201 transitions. [2018-12-09 08:37:21,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 08:37:21,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2018-12-09 08:37:21,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:37:21,303 INFO L225 Difference]: With dead ends: 9194 [2018-12-09 08:37:21,303 INFO L226 Difference]: Without dead ends: 9194 [2018-12-09 08:37:21,304 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 08:37:21,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9194 states. [2018-12-09 08:37:21,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9194 to 8964. [2018-12-09 08:37:21,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8964 states. [2018-12-09 08:37:21,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8964 states to 8964 states and 30502 transitions. [2018-12-09 08:37:21,387 INFO L78 Accepts]: Start accepts. Automaton has 8964 states and 30502 transitions. Word has length 98 [2018-12-09 08:37:21,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:37:21,387 INFO L480 AbstractCegarLoop]: Abstraction has 8964 states and 30502 transitions. [2018-12-09 08:37:21,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 08:37:21,388 INFO L276 IsEmpty]: Start isEmpty. Operand 8964 states and 30502 transitions. [2018-12-09 08:37:21,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-09 08:37:21,396 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:37:21,396 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 08:37:21,396 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:37:21,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:37:21,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1190943875, now seen corresponding path program 1 times [2018-12-09 08:37:21,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:37:21,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:37:21,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:37:21,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:37:21,398 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:37:21,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:37:21,440 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 08:37:21,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:37:21,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 08:37:21,441 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 08:37:21,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 08:37:21,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 08:37:21,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 08:37:21,441 INFO L87 Difference]: Start difference. First operand 8964 states and 30502 transitions. Second operand 5 states. [2018-12-09 08:37:21,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:37:21,591 INFO L93 Difference]: Finished difference Result 11109 states and 37218 transitions. [2018-12-09 08:37:21,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 08:37:21,591 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2018-12-09 08:37:21,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:37:21,603 INFO L225 Difference]: With dead ends: 11109 [2018-12-09 08:37:21,603 INFO L226 Difference]: Without dead ends: 11109 [2018-12-09 08:37:21,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 08:37:21,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11109 states. [2018-12-09 08:37:21,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11109 to 9409. [2018-12-09 08:37:21,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9409 states. [2018-12-09 08:37:21,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9409 states to 9409 states and 31868 transitions. [2018-12-09 08:37:21,699 INFO L78 Accepts]: Start accepts. Automaton has 9409 states and 31868 transitions. Word has length 98 [2018-12-09 08:37:21,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:37:21,699 INFO L480 AbstractCegarLoop]: Abstraction has 9409 states and 31868 transitions. [2018-12-09 08:37:21,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 08:37:21,699 INFO L276 IsEmpty]: Start isEmpty. Operand 9409 states and 31868 transitions. [2018-12-09 08:37:21,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-09 08:37:21,708 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:37:21,708 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 08:37:21,708 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:37:21,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:37:21,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1198703234, now seen corresponding path program 2 times [2018-12-09 08:37:21,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:37:21,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:37:21,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:37:21,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:37:21,710 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:37:21,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:37:21,753 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 08:37:21,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:37:21,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 08:37:21,754 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 08:37:21,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 08:37:21,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 08:37:21,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 08:37:21,754 INFO L87 Difference]: Start difference. First operand 9409 states and 31868 transitions. Second operand 4 states. [2018-12-09 08:37:21,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:37:21,930 INFO L93 Difference]: Finished difference Result 14489 states and 49265 transitions. [2018-12-09 08:37:21,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 08:37:21,930 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2018-12-09 08:37:21,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:37:21,947 INFO L225 Difference]: With dead ends: 14489 [2018-12-09 08:37:21,947 INFO L226 Difference]: Without dead ends: 14489 [2018-12-09 08:37:21,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 08:37:21,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14489 states. [2018-12-09 08:37:22,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14489 to 9619. [2018-12-09 08:37:22,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9619 states. [2018-12-09 08:37:22,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9619 states to 9619 states and 32506 transitions. [2018-12-09 08:37:22,062 INFO L78 Accepts]: Start accepts. Automaton has 9619 states and 32506 transitions. Word has length 98 [2018-12-09 08:37:22,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:37:22,062 INFO L480 AbstractCegarLoop]: Abstraction has 9619 states and 32506 transitions. [2018-12-09 08:37:22,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 08:37:22,062 INFO L276 IsEmpty]: Start isEmpty. Operand 9619 states and 32506 transitions. [2018-12-09 08:37:22,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 08:37:22,072 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:37:22,072 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 08:37:22,072 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:37:22,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:37:22,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1564298, now seen corresponding path program 1 times [2018-12-09 08:37:22,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:37:22,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:37:22,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 08:37:22,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:37:22,074 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:37:22,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:37:22,106 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 08:37:22,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:37:22,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 08:37:22,106 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 08:37:22,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 08:37:22,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 08:37:22,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 08:37:22,107 INFO L87 Difference]: Start difference. First operand 9619 states and 32506 transitions. Second operand 4 states. [2018-12-09 08:37:22,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:37:22,215 INFO L93 Difference]: Finished difference Result 17455 states and 58925 transitions. [2018-12-09 08:37:22,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 08:37:22,215 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-12-09 08:37:22,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:37:22,235 INFO L225 Difference]: With dead ends: 17455 [2018-12-09 08:37:22,235 INFO L226 Difference]: Without dead ends: 17455 [2018-12-09 08:37:22,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 08:37:22,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17455 states. [2018-12-09 08:37:22,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17455 to 9369. [2018-12-09 08:37:22,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9369 states. [2018-12-09 08:37:22,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9369 states to 9369 states and 31371 transitions. [2018-12-09 08:37:22,423 INFO L78 Accepts]: Start accepts. Automaton has 9369 states and 31371 transitions. Word has length 100 [2018-12-09 08:37:22,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:37:22,423 INFO L480 AbstractCegarLoop]: Abstraction has 9369 states and 31371 transitions. [2018-12-09 08:37:22,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 08:37:22,423 INFO L276 IsEmpty]: Start isEmpty. Operand 9369 states and 31371 transitions. [2018-12-09 08:37:22,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 08:37:22,431 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:37:22,431 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 08:37:22,431 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:37:22,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:37:22,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1184911595, now seen corresponding path program 1 times [2018-12-09 08:37:22,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:37:22,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:37:22,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:37:22,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:37:22,432 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:37:22,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:37:22,496 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 08:37:22,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:37:22,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 08:37:22,496 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 08:37:22,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 08:37:22,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 08:37:22,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-09 08:37:22,497 INFO L87 Difference]: Start difference. First operand 9369 states and 31371 transitions. Second operand 6 states. [2018-12-09 08:37:22,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:37:22,645 INFO L93 Difference]: Finished difference Result 11429 states and 37784 transitions. [2018-12-09 08:37:22,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 08:37:22,645 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-09 08:37:22,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:37:22,659 INFO L225 Difference]: With dead ends: 11429 [2018-12-09 08:37:22,659 INFO L226 Difference]: Without dead ends: 11429 [2018-12-09 08:37:22,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-09 08:37:22,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11429 states. [2018-12-09 08:37:22,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11429 to 9714. [2018-12-09 08:37:22,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9714 states. [2018-12-09 08:37:22,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9714 states to 9714 states and 32482 transitions. [2018-12-09 08:37:22,758 INFO L78 Accepts]: Start accepts. Automaton has 9714 states and 32482 transitions. Word has length 100 [2018-12-09 08:37:22,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:37:22,758 INFO L480 AbstractCegarLoop]: Abstraction has 9714 states and 32482 transitions. [2018-12-09 08:37:22,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 08:37:22,758 INFO L276 IsEmpty]: Start isEmpty. Operand 9714 states and 32482 transitions. [2018-12-09 08:37:22,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 08:37:22,766 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:37:22,766 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 08:37:22,767 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:37:22,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:37:22,767 INFO L82 PathProgramCache]: Analyzing trace with hash -215330572, now seen corresponding path program 1 times [2018-12-09 08:37:22,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:37:22,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:37:22,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:37:22,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:37:22,768 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:37:22,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:37:22,836 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 08:37:22,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:37:22,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 08:37:22,836 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 08:37:22,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 08:37:22,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 08:37:22,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 08:37:22,837 INFO L87 Difference]: Start difference. First operand 9714 states and 32482 transitions. Second operand 6 states. [2018-12-09 08:37:22,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:37:22,953 INFO L93 Difference]: Finished difference Result 8993 states and 29747 transitions. [2018-12-09 08:37:22,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 08:37:22,953 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-09 08:37:22,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:37:22,963 INFO L225 Difference]: With dead ends: 8993 [2018-12-09 08:37:22,963 INFO L226 Difference]: Without dead ends: 8993 [2018-12-09 08:37:22,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-09 08:37:22,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8993 states. [2018-12-09 08:37:23,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8993 to 8644. [2018-12-09 08:37:23,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8644 states. [2018-12-09 08:37:23,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8644 states to 8644 states and 28726 transitions. [2018-12-09 08:37:23,045 INFO L78 Accepts]: Start accepts. Automaton has 8644 states and 28726 transitions. Word has length 100 [2018-12-09 08:37:23,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:37:23,045 INFO L480 AbstractCegarLoop]: Abstraction has 8644 states and 28726 transitions. [2018-12-09 08:37:23,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 08:37:23,045 INFO L276 IsEmpty]: Start isEmpty. Operand 8644 states and 28726 transitions. [2018-12-09 08:37:23,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 08:37:23,052 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:37:23,052 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 08:37:23,053 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:37:23,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:37:23,053 INFO L82 PathProgramCache]: Analyzing trace with hash 866833783, now seen corresponding path program 1 times [2018-12-09 08:37:23,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:37:23,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:37:23,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:37:23,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:37:23,054 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:37:23,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:37:23,103 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 08:37:23,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:37:23,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 08:37:23,103 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 08:37:23,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 08:37:23,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 08:37:23,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 08:37:23,104 INFO L87 Difference]: Start difference. First operand 8644 states and 28726 transitions. Second operand 6 states. [2018-12-09 08:37:23,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:37:23,294 INFO L93 Difference]: Finished difference Result 10024 states and 32535 transitions. [2018-12-09 08:37:23,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 08:37:23,294 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-09 08:37:23,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:37:23,304 INFO L225 Difference]: With dead ends: 10024 [2018-12-09 08:37:23,304 INFO L226 Difference]: Without dead ends: 9669 [2018-12-09 08:37:23,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 08:37:23,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9669 states. [2018-12-09 08:37:23,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9669 to 9094. [2018-12-09 08:37:23,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9094 states. [2018-12-09 08:37:23,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9094 states to 9094 states and 29921 transitions. [2018-12-09 08:37:23,390 INFO L78 Accepts]: Start accepts. Automaton has 9094 states and 29921 transitions. Word has length 100 [2018-12-09 08:37:23,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:37:23,390 INFO L480 AbstractCegarLoop]: Abstraction has 9094 states and 29921 transitions. [2018-12-09 08:37:23,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 08:37:23,390 INFO L276 IsEmpty]: Start isEmpty. Operand 9094 states and 29921 transitions. [2018-12-09 08:37:23,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 08:37:23,397 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:37:23,398 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 08:37:23,398 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:37:23,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:37:23,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1727393034, now seen corresponding path program 1 times [2018-12-09 08:37:23,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:37:23,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:37:23,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:37:23,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:37:23,400 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:37:23,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:37:23,457 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 08:37:23,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:37:23,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 08:37:23,458 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 08:37:23,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 08:37:23,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 08:37:23,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 08:37:23,458 INFO L87 Difference]: Start difference. First operand 9094 states and 29921 transitions. Second operand 7 states. [2018-12-09 08:37:23,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:37:23,654 INFO L93 Difference]: Finished difference Result 10057 states and 33017 transitions. [2018-12-09 08:37:23,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 08:37:23,655 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2018-12-09 08:37:23,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:37:23,666 INFO L225 Difference]: With dead ends: 10057 [2018-12-09 08:37:23,666 INFO L226 Difference]: Without dead ends: 10057 [2018-12-09 08:37:23,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 08:37:23,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10057 states. [2018-12-09 08:37:23,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10057 to 9009. [2018-12-09 08:37:23,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9009 states. [2018-12-09 08:37:23,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9009 states to 9009 states and 29673 transitions. [2018-12-09 08:37:23,754 INFO L78 Accepts]: Start accepts. Automaton has 9009 states and 29673 transitions. Word has length 100 [2018-12-09 08:37:23,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:37:23,755 INFO L480 AbstractCegarLoop]: Abstraction has 9009 states and 29673 transitions. [2018-12-09 08:37:23,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 08:37:23,755 INFO L276 IsEmpty]: Start isEmpty. Operand 9009 states and 29673 transitions. [2018-12-09 08:37:23,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 08:37:23,763 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:37:23,763 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 08:37:23,763 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:37:23,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:37:23,763 INFO L82 PathProgramCache]: Analyzing trace with hash -316513514, now seen corresponding path program 1 times [2018-12-09 08:37:23,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:37:23,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:37:23,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:37:23,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:37:23,765 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:37:23,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:37:23,829 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 08:37:23,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:37:23,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 08:37:23,829 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 08:37:23,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 08:37:23,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 08:37:23,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 08:37:23,830 INFO L87 Difference]: Start difference. First operand 9009 states and 29673 transitions. Second operand 5 states. [2018-12-09 08:37:23,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:37:23,913 INFO L93 Difference]: Finished difference Result 8217 states and 26961 transitions. [2018-12-09 08:37:23,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 08:37:23,914 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2018-12-09 08:37:23,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:37:23,922 INFO L225 Difference]: With dead ends: 8217 [2018-12-09 08:37:23,922 INFO L226 Difference]: Without dead ends: 8217 [2018-12-09 08:37:23,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-09 08:37:23,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8217 states. [2018-12-09 08:37:23,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8217 to 8032. [2018-12-09 08:37:23,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8032 states. [2018-12-09 08:37:23,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8032 states to 8032 states and 26443 transitions. [2018-12-09 08:37:23,995 INFO L78 Accepts]: Start accepts. Automaton has 8032 states and 26443 transitions. Word has length 100 [2018-12-09 08:37:23,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:37:23,995 INFO L480 AbstractCegarLoop]: Abstraction has 8032 states and 26443 transitions. [2018-12-09 08:37:23,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 08:37:23,995 INFO L276 IsEmpty]: Start isEmpty. Operand 8032 states and 26443 transitions. [2018-12-09 08:37:24,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 08:37:24,002 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:37:24,002 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 08:37:24,002 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:37:24,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:37:24,002 INFO L82 PathProgramCache]: Analyzing trace with hash 2042793495, now seen corresponding path program 1 times [2018-12-09 08:37:24,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:37:24,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:37:24,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:37:24,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:37:24,004 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:37:24,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:37:24,037 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 08:37:24,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:37:24,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 08:37:24,038 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 08:37:24,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 08:37:24,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 08:37:24,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 08:37:24,038 INFO L87 Difference]: Start difference. First operand 8032 states and 26443 transitions. Second operand 4 states. [2018-12-09 08:37:24,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:37:24,112 INFO L93 Difference]: Finished difference Result 9376 states and 31131 transitions. [2018-12-09 08:37:24,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 08:37:24,112 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-12-09 08:37:24,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:37:24,122 INFO L225 Difference]: With dead ends: 9376 [2018-12-09 08:37:24,123 INFO L226 Difference]: Without dead ends: 9376 [2018-12-09 08:37:24,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 08:37:24,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9376 states. [2018-12-09 08:37:24,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9376 to 9248. [2018-12-09 08:37:24,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9248 states. [2018-12-09 08:37:24,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9248 states to 9248 states and 30715 transitions. [2018-12-09 08:37:24,209 INFO L78 Accepts]: Start accepts. Automaton has 9248 states and 30715 transitions. Word has length 100 [2018-12-09 08:37:24,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:37:24,209 INFO L480 AbstractCegarLoop]: Abstraction has 9248 states and 30715 transitions. [2018-12-09 08:37:24,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 08:37:24,209 INFO L276 IsEmpty]: Start isEmpty. Operand 9248 states and 30715 transitions. [2018-12-09 08:37:24,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 08:37:24,217 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:37:24,217 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 08:37:24,217 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:37:24,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:37:24,217 INFO L82 PathProgramCache]: Analyzing trace with hash -34415848, now seen corresponding path program 1 times [2018-12-09 08:37:24,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:37:24,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:37:24,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:37:24,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:37:24,219 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:37:24,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:37:24,296 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 08:37:24,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:37:24,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 08:37:24,296 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 08:37:24,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 08:37:24,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 08:37:24,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 08:37:24,297 INFO L87 Difference]: Start difference. First operand 9248 states and 30715 transitions. Second operand 6 states. [2018-12-09 08:37:24,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:37:24,387 INFO L93 Difference]: Finished difference Result 8096 states and 26267 transitions. [2018-12-09 08:37:24,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 08:37:24,388 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-09 08:37:24,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:37:24,396 INFO L225 Difference]: With dead ends: 8096 [2018-12-09 08:37:24,397 INFO L226 Difference]: Without dead ends: 8096 [2018-12-09 08:37:24,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-09 08:37:24,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8096 states. [2018-12-09 08:37:24,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8096 to 6671. [2018-12-09 08:37:24,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6671 states. [2018-12-09 08:37:24,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6671 states to 6671 states and 21861 transitions. [2018-12-09 08:37:24,469 INFO L78 Accepts]: Start accepts. Automaton has 6671 states and 21861 transitions. Word has length 100 [2018-12-09 08:37:24,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:37:24,469 INFO L480 AbstractCegarLoop]: Abstraction has 6671 states and 21861 transitions. [2018-12-09 08:37:24,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 08:37:24,470 INFO L276 IsEmpty]: Start isEmpty. Operand 6671 states and 21861 transitions. [2018-12-09 08:37:24,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 08:37:24,475 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:37:24,475 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 08:37:24,475 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:37:24,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:37:24,475 INFO L82 PathProgramCache]: Analyzing trace with hash -497599059, now seen corresponding path program 1 times [2018-12-09 08:37:24,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:37:24,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:37:24,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:37:24,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:37:24,476 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:37:24,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:37:24,528 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 08:37:24,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:37:24,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 08:37:24,528 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 08:37:24,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 08:37:24,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 08:37:24,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 08:37:24,529 INFO L87 Difference]: Start difference. First operand 6671 states and 21861 transitions. Second operand 7 states. [2018-12-09 08:37:24,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:37:24,850 INFO L93 Difference]: Finished difference Result 12218 states and 39640 transitions. [2018-12-09 08:37:24,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 08:37:24,850 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-09 08:37:24,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:37:24,863 INFO L225 Difference]: With dead ends: 12218 [2018-12-09 08:37:24,864 INFO L226 Difference]: Without dead ends: 12218 [2018-12-09 08:37:24,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-09 08:37:24,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12218 states. [2018-12-09 08:37:24,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12218 to 9653. [2018-12-09 08:37:24,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9653 states. [2018-12-09 08:37:24,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9653 states to 9653 states and 31719 transitions. [2018-12-09 08:37:24,967 INFO L78 Accepts]: Start accepts. Automaton has 9653 states and 31719 transitions. Word has length 102 [2018-12-09 08:37:24,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:37:24,967 INFO L480 AbstractCegarLoop]: Abstraction has 9653 states and 31719 transitions. [2018-12-09 08:37:24,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 08:37:24,967 INFO L276 IsEmpty]: Start isEmpty. Operand 9653 states and 31719 transitions. [2018-12-09 08:37:24,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 08:37:24,975 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:37:24,975 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 08:37:24,975 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:37:24,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:37:24,975 INFO L82 PathProgramCache]: Analyzing trace with hash 747165422, now seen corresponding path program 1 times [2018-12-09 08:37:24,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:37:24,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:37:24,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:37:24,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:37:24,976 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:37:24,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:37:25,035 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 08:37:25,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:37:25,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 08:37:25,035 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 08:37:25,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 08:37:25,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 08:37:25,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 08:37:25,036 INFO L87 Difference]: Start difference. First operand 9653 states and 31719 transitions. Second operand 6 states. [2018-12-09 08:37:25,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:37:25,127 INFO L93 Difference]: Finished difference Result 9843 states and 32066 transitions. [2018-12-09 08:37:25,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 08:37:25,127 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-12-09 08:37:25,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:37:25,137 INFO L225 Difference]: With dead ends: 9843 [2018-12-09 08:37:25,138 INFO L226 Difference]: Without dead ends: 9843 [2018-12-09 08:37:25,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-09 08:37:25,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9843 states. [2018-12-09 08:37:25,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9843 to 9578. [2018-12-09 08:37:25,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9578 states. [2018-12-09 08:37:25,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9578 states to 9578 states and 31339 transitions. [2018-12-09 08:37:25,279 INFO L78 Accepts]: Start accepts. Automaton has 9578 states and 31339 transitions. Word has length 102 [2018-12-09 08:37:25,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:37:25,279 INFO L480 AbstractCegarLoop]: Abstraction has 9578 states and 31339 transitions. [2018-12-09 08:37:25,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 08:37:25,279 INFO L276 IsEmpty]: Start isEmpty. Operand 9578 states and 31339 transitions. [2018-12-09 08:37:25,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 08:37:25,287 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:37:25,287 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 08:37:25,287 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:37:25,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:37:25,287 INFO L82 PathProgramCache]: Analyzing trace with hash -167833298, now seen corresponding path program 1 times [2018-12-09 08:37:25,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:37:25,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:37:25,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:37:25,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:37:25,288 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:37:25,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:37:25,335 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 08:37:25,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:37:25,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 08:37:25,336 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 08:37:25,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 08:37:25,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 08:37:25,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 08:37:25,336 INFO L87 Difference]: Start difference. First operand 9578 states and 31339 transitions. Second operand 6 states. [2018-12-09 08:37:25,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:37:25,498 INFO L93 Difference]: Finished difference Result 12122 states and 38989 transitions. [2018-12-09 08:37:25,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 08:37:25,499 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-12-09 08:37:25,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:37:25,511 INFO L225 Difference]: With dead ends: 12122 [2018-12-09 08:37:25,511 INFO L226 Difference]: Without dead ends: 12122 [2018-12-09 08:37:25,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-09 08:37:25,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12122 states. [2018-12-09 08:37:25,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12122 to 9828. [2018-12-09 08:37:25,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9828 states. [2018-12-09 08:37:25,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9828 states to 9828 states and 31959 transitions. [2018-12-09 08:37:25,610 INFO L78 Accepts]: Start accepts. Automaton has 9828 states and 31959 transitions. Word has length 102 [2018-12-09 08:37:25,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:37:25,611 INFO L480 AbstractCegarLoop]: Abstraction has 9828 states and 31959 transitions. [2018-12-09 08:37:25,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 08:37:25,611 INFO L276 IsEmpty]: Start isEmpty. Operand 9828 states and 31959 transitions. [2018-12-09 08:37:25,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 08:37:25,618 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:37:25,619 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 08:37:25,619 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:37:25,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:37:25,619 INFO L82 PathProgramCache]: Analyzing trace with hash -597334546, now seen corresponding path program 2 times [2018-12-09 08:37:25,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:37:25,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:37:25,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:37:25,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:37:25,620 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:37:25,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:37:25,689 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 08:37:25,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:37:25,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 08:37:25,689 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 08:37:25,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 08:37:25,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 08:37:25,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-09 08:37:25,690 INFO L87 Difference]: Start difference. First operand 9828 states and 31959 transitions. Second operand 7 states. [2018-12-09 08:37:25,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:37:25,914 INFO L93 Difference]: Finished difference Result 9928 states and 32214 transitions. [2018-12-09 08:37:25,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 08:37:25,914 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-09 08:37:25,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:37:25,925 INFO L225 Difference]: With dead ends: 9928 [2018-12-09 08:37:25,925 INFO L226 Difference]: Without dead ends: 9928 [2018-12-09 08:37:25,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-12-09 08:37:25,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9928 states. [2018-12-09 08:37:26,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9928 to 9828. [2018-12-09 08:37:26,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9828 states. [2018-12-09 08:37:26,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9828 states to 9828 states and 31944 transitions. [2018-12-09 08:37:26,020 INFO L78 Accepts]: Start accepts. Automaton has 9828 states and 31944 transitions. Word has length 102 [2018-12-09 08:37:26,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:37:26,021 INFO L480 AbstractCegarLoop]: Abstraction has 9828 states and 31944 transitions. [2018-12-09 08:37:26,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 08:37:26,021 INFO L276 IsEmpty]: Start isEmpty. Operand 9828 states and 31944 transitions. [2018-12-09 08:37:26,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 08:37:26,029 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:37:26,029 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 08:37:26,029 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:37:26,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:37:26,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1904809647, now seen corresponding path program 1 times [2018-12-09 08:37:26,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:37:26,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:37:26,030 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 08:37:26,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:37:26,030 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:37:26,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:37:26,095 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 08:37:26,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:37:26,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 08:37:26,095 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 08:37:26,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 08:37:26,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 08:37:26,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 08:37:26,096 INFO L87 Difference]: Start difference. First operand 9828 states and 31944 transitions. Second operand 7 states. [2018-12-09 08:37:26,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:37:26,326 INFO L93 Difference]: Finished difference Result 14709 states and 48904 transitions. [2018-12-09 08:37:26,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 08:37:26,327 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-09 08:37:26,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:37:26,343 INFO L225 Difference]: With dead ends: 14709 [2018-12-09 08:37:26,343 INFO L226 Difference]: Without dead ends: 14709 [2018-12-09 08:37:26,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2018-12-09 08:37:26,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14709 states. [2018-12-09 08:37:26,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14709 to 8243. [2018-12-09 08:37:26,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8243 states. [2018-12-09 08:37:26,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8243 states to 8243 states and 26901 transitions. [2018-12-09 08:37:26,445 INFO L78 Accepts]: Start accepts. Automaton has 8243 states and 26901 transitions. Word has length 102 [2018-12-09 08:37:26,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:37:26,446 INFO L480 AbstractCegarLoop]: Abstraction has 8243 states and 26901 transitions. [2018-12-09 08:37:26,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 08:37:26,446 INFO L276 IsEmpty]: Start isEmpty. Operand 8243 states and 26901 transitions. [2018-12-09 08:37:26,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 08:37:26,452 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:37:26,452 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 08:37:26,452 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:37:26,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:37:26,453 INFO L82 PathProgramCache]: Analyzing trace with hash 989810927, now seen corresponding path program 1 times [2018-12-09 08:37:26,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:37:26,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:37:26,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:37:26,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:37:26,454 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:37:26,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:37:26,513 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 08:37:26,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:37:26,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 08:37:26,513 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 08:37:26,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 08:37:26,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 08:37:26,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 08:37:26,514 INFO L87 Difference]: Start difference. First operand 8243 states and 26901 transitions. Second operand 5 states. [2018-12-09 08:37:26,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:37:26,624 INFO L93 Difference]: Finished difference Result 9523 states and 31061 transitions. [2018-12-09 08:37:26,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 08:37:26,624 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2018-12-09 08:37:26,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:37:26,634 INFO L225 Difference]: With dead ends: 9523 [2018-12-09 08:37:26,634 INFO L226 Difference]: Without dead ends: 9523 [2018-12-09 08:37:26,634 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 08:37:26,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9523 states. [2018-12-09 08:37:26,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9523 to 8435. [2018-12-09 08:37:26,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8435 states. [2018-12-09 08:37:26,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8435 states to 8435 states and 27525 transitions. [2018-12-09 08:37:26,718 INFO L78 Accepts]: Start accepts. Automaton has 8435 states and 27525 transitions. Word has length 102 [2018-12-09 08:37:26,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:37:26,718 INFO L480 AbstractCegarLoop]: Abstraction has 8435 states and 27525 transitions. [2018-12-09 08:37:26,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 08:37:26,718 INFO L276 IsEmpty]: Start isEmpty. Operand 8435 states and 27525 transitions. [2018-12-09 08:37:26,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 08:37:26,725 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:37:26,725 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 08:37:26,725 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:37:26,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:37:26,725 INFO L82 PathProgramCache]: Analyzing trace with hash -2060391888, now seen corresponding path program 1 times [2018-12-09 08:37:26,725 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:37:26,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:37:26,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:37:26,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:37:26,726 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:37:26,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:37:26,815 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 08:37:26,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:37:26,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 08:37:26,815 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 08:37:26,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 08:37:26,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 08:37:26,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-09 08:37:26,816 INFO L87 Difference]: Start difference. First operand 8435 states and 27525 transitions. Second operand 10 states. [2018-12-09 08:37:27,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:37:27,118 INFO L93 Difference]: Finished difference Result 15915 states and 52351 transitions. [2018-12-09 08:37:27,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 08:37:27,119 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 102 [2018-12-09 08:37:27,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:37:27,127 INFO L225 Difference]: With dead ends: 15915 [2018-12-09 08:37:27,127 INFO L226 Difference]: Without dead ends: 7775 [2018-12-09 08:37:27,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-12-09 08:37:27,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7775 states. [2018-12-09 08:37:27,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7775 to 7775. [2018-12-09 08:37:27,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7775 states. [2018-12-09 08:37:27,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7775 states to 7775 states and 25605 transitions. [2018-12-09 08:37:27,197 INFO L78 Accepts]: Start accepts. Automaton has 7775 states and 25605 transitions. Word has length 102 [2018-12-09 08:37:27,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:37:27,198 INFO L480 AbstractCegarLoop]: Abstraction has 7775 states and 25605 transitions. [2018-12-09 08:37:27,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 08:37:27,198 INFO L276 IsEmpty]: Start isEmpty. Operand 7775 states and 25605 transitions. [2018-12-09 08:37:27,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 08:37:27,204 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:37:27,204 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 08:37:27,204 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:37:27,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:37:27,204 INFO L82 PathProgramCache]: Analyzing trace with hash 445470452, now seen corresponding path program 2 times [2018-12-09 08:37:27,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:37:27,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:37:27,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:37:27,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:37:27,206 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:37:27,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:37:27,256 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 08:37:27,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:37:27,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 08:37:27,256 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 08:37:27,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 08:37:27,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 08:37:27,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 08:37:27,257 INFO L87 Difference]: Start difference. First operand 7775 states and 25605 transitions. Second operand 7 states. [2018-12-09 08:37:27,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:37:27,434 INFO L93 Difference]: Finished difference Result 14385 states and 48108 transitions. [2018-12-09 08:37:27,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 08:37:27,435 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-09 08:37:27,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:37:27,442 INFO L225 Difference]: With dead ends: 14385 [2018-12-09 08:37:27,443 INFO L226 Difference]: Without dead ends: 6821 [2018-12-09 08:37:27,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-09 08:37:27,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6821 states. [2018-12-09 08:37:27,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6821 to 6821. [2018-12-09 08:37:27,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6821 states. [2018-12-09 08:37:27,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6821 states to 6821 states and 23055 transitions. [2018-12-09 08:37:27,508 INFO L78 Accepts]: Start accepts. Automaton has 6821 states and 23055 transitions. Word has length 102 [2018-12-09 08:37:27,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:37:27,508 INFO L480 AbstractCegarLoop]: Abstraction has 6821 states and 23055 transitions. [2018-12-09 08:37:27,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 08:37:27,508 INFO L276 IsEmpty]: Start isEmpty. Operand 6821 states and 23055 transitions. [2018-12-09 08:37:27,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 08:37:27,513 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:37:27,513 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 08:37:27,514 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:37:27,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:37:27,514 INFO L82 PathProgramCache]: Analyzing trace with hash 791009209, now seen corresponding path program 1 times [2018-12-09 08:37:27,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:37:27,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:37:27,515 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 08:37:27,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:37:27,515 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:37:27,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:37:27,581 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 08:37:27,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:37:27,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 08:37:27,582 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 08:37:27,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 08:37:27,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 08:37:27,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 08:37:27,583 INFO L87 Difference]: Start difference. First operand 6821 states and 23055 transitions. Second operand 6 states. [2018-12-09 08:37:27,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:37:27,631 INFO L93 Difference]: Finished difference Result 7165 states and 23925 transitions. [2018-12-09 08:37:27,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 08:37:27,632 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-12-09 08:37:27,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:37:27,640 INFO L225 Difference]: With dead ends: 7165 [2018-12-09 08:37:27,640 INFO L226 Difference]: Without dead ends: 7085 [2018-12-09 08:37:27,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-09 08:37:27,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7085 states. [2018-12-09 08:37:27,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7085 to 6789. [2018-12-09 08:37:27,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6789 states. [2018-12-09 08:37:27,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6789 states to 6789 states and 22927 transitions. [2018-12-09 08:37:27,706 INFO L78 Accepts]: Start accepts. Automaton has 6789 states and 22927 transitions. Word has length 102 [2018-12-09 08:37:27,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:37:27,706 INFO L480 AbstractCegarLoop]: Abstraction has 6789 states and 22927 transitions. [2018-12-09 08:37:27,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 08:37:27,706 INFO L276 IsEmpty]: Start isEmpty. Operand 6789 states and 22927 transitions. [2018-12-09 08:37:27,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 08:37:27,712 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:37:27,712 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 08:37:27,712 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:37:27,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:37:27,712 INFO L82 PathProgramCache]: Analyzing trace with hash 342312570, now seen corresponding path program 3 times [2018-12-09 08:37:27,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:37:27,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:37:27,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:37:27,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:37:27,713 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:37:27,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:37:27,809 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 08:37:27,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:37:27,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 08:37:27,810 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 08:37:27,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 08:37:27,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 08:37:27,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-09 08:37:27,810 INFO L87 Difference]: Start difference. First operand 6789 states and 22927 transitions. Second operand 12 states. [2018-12-09 08:37:28,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:37:28,207 INFO L93 Difference]: Finished difference Result 13177 states and 44650 transitions. [2018-12-09 08:37:28,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 08:37:28,208 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 102 [2018-12-09 08:37:28,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:37:28,217 INFO L225 Difference]: With dead ends: 13177 [2018-12-09 08:37:28,217 INFO L226 Difference]: Without dead ends: 9273 [2018-12-09 08:37:28,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-12-09 08:37:28,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9273 states. [2018-12-09 08:37:28,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9273 to 8665. [2018-12-09 08:37:28,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8665 states. [2018-12-09 08:37:28,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8665 states to 8665 states and 28570 transitions. [2018-12-09 08:37:28,297 INFO L78 Accepts]: Start accepts. Automaton has 8665 states and 28570 transitions. Word has length 102 [2018-12-09 08:37:28,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:37:28,297 INFO L480 AbstractCegarLoop]: Abstraction has 8665 states and 28570 transitions. [2018-12-09 08:37:28,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 08:37:28,297 INFO L276 IsEmpty]: Start isEmpty. Operand 8665 states and 28570 transitions. [2018-12-09 08:37:28,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 08:37:28,304 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:37:28,304 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 08:37:28,304 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:37:28,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:37:28,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1540221632, now seen corresponding path program 4 times [2018-12-09 08:37:28,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:37:28,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:37:28,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 08:37:28,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:37:28,305 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:37:28,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:37:28,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:37:28,349 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 08:37:28,430 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 08:37:28,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 08:37:28 BasicIcfg [2018-12-09 08:37:28,431 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 08:37:28,432 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 08:37:28,432 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 08:37:28,432 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 08:37:28,432 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:36:35" (3/4) ... [2018-12-09 08:37:28,434 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 08:37:28,502 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5f0cca6e-ada5-4589-aec2-4eb2e1bce30d/bin-2019/utaipan/witness.graphml [2018-12-09 08:37:28,502 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 08:37:28,503 INFO L168 Benchmark]: Toolchain (without parser) took 54069.91 ms. Allocated memory was 1.0 GB in the beginning and 7.4 GB in the end (delta: 6.4 GB). Free memory was 952.4 MB in the beginning and 4.7 GB in the end (delta: -3.8 GB). Peak memory consumption was 2.6 GB. Max. memory is 11.5 GB. [2018-12-09 08:37:28,504 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 981.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 08:37:28,504 INFO L168 Benchmark]: CACSL2BoogieTranslator took 333.14 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 71.8 MB). Free memory was 952.4 MB in the beginning and 1.0 GB in the end (delta: -94.1 MB). Peak memory consumption was 34.1 MB. Max. memory is 11.5 GB. [2018-12-09 08:37:28,504 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. [2018-12-09 08:37:28,504 INFO L168 Benchmark]: Boogie Preprocessor took 20.46 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 08:37:28,504 INFO L168 Benchmark]: RCFGBuilder took 377.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 992.7 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 11.5 GB. [2018-12-09 08:37:28,504 INFO L168 Benchmark]: TraceAbstraction took 53230.91 ms. Allocated memory was 1.1 GB in the beginning and 7.4 GB in the end (delta: 6.3 GB). Free memory was 992.7 MB in the beginning and 4.8 GB in the end (delta: -3.8 GB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. [2018-12-09 08:37:28,504 INFO L168 Benchmark]: Witness Printer took 70.68 ms. Allocated memory is still 7.4 GB. Free memory was 4.8 GB in the beginning and 4.7 GB in the end (delta: 36.1 MB). Peak memory consumption was 36.1 MB. Max. memory is 11.5 GB. [2018-12-09 08:37:28,505 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 981.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 333.14 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 71.8 MB). Free memory was 952.4 MB in the beginning and 1.0 GB in the end (delta: -94.1 MB). Peak memory consumption was 34.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.46 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 377.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 992.7 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 53230.91 ms. Allocated memory was 1.1 GB in the beginning and 7.4 GB in the end (delta: 6.3 GB). Free memory was 992.7 MB in the beginning and 4.8 GB in the end (delta: -3.8 GB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. * Witness Printer took 70.68 ms. Allocated memory is still 7.4 GB. Free memory was 4.8 GB in the beginning and 4.7 GB in the end (delta: 36.1 MB). Peak memory consumption was 36.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L675] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L676] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L678] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L680] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L681] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L682] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L683] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L684] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L685] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L686] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L687] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L688] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L689] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L690] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L691] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L692] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L693] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L694] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L695] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L696] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L698] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L699] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L700] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L776] -1 pthread_t t1512; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L777] FCALL, FORK -1 pthread_create(&t1512, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L778] -1 pthread_t t1513; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L779] FCALL, FORK -1 pthread_create(&t1513, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] -1 pthread_t t1514; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] FCALL, FORK -1 pthread_create(&t1514, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L739] 0 y$w_buff1 = y$w_buff0 [L740] 0 y$w_buff0 = 2 [L741] 0 y$w_buff1_used = y$w_buff0_used [L742] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L744] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L745] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L746] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L747] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L748] 0 y$r_buff0_thd3 = (_Bool)1 [L751] 0 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L754] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L704] 1 z = 1 [L707] 1 x = 1 [L712] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L719] 2 x = 2 [L722] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L725] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L725] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=1, z=1] [L725] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=1, z=1] [L725] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L726] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L726] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L727] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L727] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L728] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 0 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L728] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L755] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L756] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L757] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L758] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L758] 0 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L761] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L732] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L783] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L788] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L788] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L789] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L789] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L790] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L790] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L791] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L794] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L795] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L796] -1 y$flush_delayed = weak$$choice2 [L797] -1 y$mem_tmp = y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] -1 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L799] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] -1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L800] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] -1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L801] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] -1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L802] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L802] -1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L803] -1 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L804] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L804] -1 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] -1 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L806] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L806] -1 y = y$flush_delayed ? y$mem_tmp : y [L807] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 198 locations, 3 error locations. UNSAFE Result, 53.1s OverallTime, 29 OverallIterations, 1 TraceHistogramMax, 12.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6219 SDtfs, 6247 SDslu, 13541 SDs, 0 SdLazy, 4321 SolverSat, 280 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 274 GetRequests, 83 SyntacticMatches, 17 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=186422occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 23.1s AutomataMinimizationTime, 28 MinimizatonAttempts, 273892 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 2592 NumberOfCodeBlocks, 2592 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2462 ConstructedInterpolants, 0 QuantifiedInterpolants, 533351 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...