./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi010_power.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_b3a21ee2-2d4e-460e-afef-56db9716e7a1/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b3a21ee2-2d4e-460e-afef-56db9716e7a1/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b3a21ee2-2d4e-460e-afef-56db9716e7a1/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b3a21ee2-2d4e-460e-afef-56db9716e7a1/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi010_power.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_b3a21ee2-2d4e-460e-afef-56db9716e7a1/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b3a21ee2-2d4e-460e-afef-56db9716e7a1/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 df6b0475df83f06f064c78d3a4d54c725d19829e ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 06:19:07,896 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 06:19:07,898 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 06:19:07,906 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 06:19:07,907 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 06:19:07,907 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 06:19:07,908 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 06:19:07,910 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 06:19:07,911 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 06:19:07,911 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 06:19:07,912 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 06:19:07,912 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 06:19:07,913 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 06:19:07,914 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 06:19:07,914 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 06:19:07,915 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 06:19:07,915 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 06:19:07,917 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 06:19:07,918 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 06:19:07,919 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 06:19:07,920 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 06:19:07,921 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 06:19:07,923 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 06:19:07,923 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 06:19:07,923 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 06:19:07,924 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 06:19:07,925 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 06:19:07,925 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 06:19:07,926 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 06:19:07,926 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 06:19:07,927 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 06:19:07,927 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 06:19:07,927 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 06:19:07,927 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 06:19:07,928 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 06:19:07,928 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 06:19:07,929 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b3a21ee2-2d4e-460e-afef-56db9716e7a1/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 06:19:07,939 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 06:19:07,939 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 06:19:07,940 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 06:19:07,940 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 06:19:07,940 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 06:19:07,940 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 06:19:07,940 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 06:19:07,940 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 06:19:07,941 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 06:19:07,941 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 06:19:07,941 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 06:19:07,941 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 06:19:07,941 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 06:19:07,942 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 06:19:07,942 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 06:19:07,942 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 06:19:07,942 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 06:19:07,942 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 06:19:07,943 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 06:19:07,943 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 06:19:07,943 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 06:19:07,943 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 06:19:07,943 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 06:19:07,943 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 06:19:07,943 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 06:19:07,944 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 06:19:07,944 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 06:19:07,944 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 06:19:07,944 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 06:19:07,944 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 06:19:07,944 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 06:19:07,944 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 06:19:07,944 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 06:19:07,944 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 06:19:07,944 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 06:19:07,944 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 06:19:07,945 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_b3a21ee2-2d4e-460e-afef-56db9716e7a1/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 -> df6b0475df83f06f064c78d3a4d54c725d19829e [2018-12-02 06:19:07,967 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 06:19:07,976 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 06:19:07,978 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 06:19:07,979 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 06:19:07,979 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 06:19:07,979 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b3a21ee2-2d4e-460e-afef-56db9716e7a1/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/rfi010_power.opt_false-unreach-call.i [2018-12-02 06:19:08,016 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b3a21ee2-2d4e-460e-afef-56db9716e7a1/bin-2019/utaipan/data/c608955e5/6eec61714a0d40c8be90931056de4364/FLAGc05a9358c [2018-12-02 06:19:08,348 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 06:19:08,348 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b3a21ee2-2d4e-460e-afef-56db9716e7a1/sv-benchmarks/c/pthread-wmm/rfi010_power.opt_false-unreach-call.i [2018-12-02 06:19:08,355 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b3a21ee2-2d4e-460e-afef-56db9716e7a1/bin-2019/utaipan/data/c608955e5/6eec61714a0d40c8be90931056de4364/FLAGc05a9358c [2018-12-02 06:19:08,363 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b3a21ee2-2d4e-460e-afef-56db9716e7a1/bin-2019/utaipan/data/c608955e5/6eec61714a0d40c8be90931056de4364 [2018-12-02 06:19:08,365 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 06:19:08,365 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 06:19:08,366 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 06:19:08,366 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 06:19:08,368 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 06:19:08,368 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:19:08" (1/1) ... [2018-12-02 06:19:08,370 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@201b218f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:19:08, skipping insertion in model container [2018-12-02 06:19:08,370 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:19:08" (1/1) ... [2018-12-02 06:19:08,374 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 06:19:08,394 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 06:19:08,574 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 06:19:08,582 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 06:19:08,658 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 06:19:08,689 INFO L195 MainTranslator]: Completed translation [2018-12-02 06:19:08,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:19:08 WrapperNode [2018-12-02 06:19:08,690 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 06:19:08,690 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 06:19:08,690 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 06:19:08,690 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 06:19:08,696 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:19:08" (1/1) ... [2018-12-02 06:19:08,706 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:19:08" (1/1) ... [2018-12-02 06:19:08,724 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 06:19:08,725 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 06:19:08,725 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 06:19:08,725 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 06:19:08,731 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:19:08" (1/1) ... [2018-12-02 06:19:08,731 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:19:08" (1/1) ... [2018-12-02 06:19:08,733 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:19:08" (1/1) ... [2018-12-02 06:19:08,734 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:19:08" (1/1) ... [2018-12-02 06:19:08,739 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:19:08" (1/1) ... [2018-12-02 06:19:08,742 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:19:08" (1/1) ... [2018-12-02 06:19:08,743 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:19:08" (1/1) ... [2018-12-02 06:19:08,746 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 06:19:08,746 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 06:19:08,746 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 06:19:08,746 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 06:19:08,747 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:19:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b3a21ee2-2d4e-460e-afef-56db9716e7a1/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 06:19:08,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 06:19:08,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 06:19:08,788 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 06:19:08,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 06:19:08,788 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 06:19:08,788 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 06:19:08,788 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 06:19:08,788 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 06:19:08,788 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 06:19:08,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 06:19:08,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 06:19:08,790 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-02 06:19:09,204 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 06:19:09,204 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 06:19:09,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:19:09 BoogieIcfgContainer [2018-12-02 06:19:09,205 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 06:19:09,205 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 06:19:09,205 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 06:19:09,207 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 06:19:09,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 06:19:08" (1/3) ... [2018-12-02 06:19:09,208 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a7f5b48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:19:09, skipping insertion in model container [2018-12-02 06:19:09,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:19:08" (2/3) ... [2018-12-02 06:19:09,208 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a7f5b48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:19:09, skipping insertion in model container [2018-12-02 06:19:09,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:19:09" (3/3) ... [2018-12-02 06:19:09,210 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi010_power.opt_false-unreach-call.i [2018-12-02 06:19:09,235 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,235 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,235 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,235 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,235 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,235 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,235 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,236 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,236 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,236 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,236 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,236 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,236 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,236 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,237 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,237 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,237 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,237 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,237 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,237 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,237 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,237 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,237 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,237 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,237 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,238 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,238 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,238 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,238 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,238 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,238 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,238 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,238 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,238 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,238 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,238 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,239 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,239 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,239 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,239 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,239 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,239 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,239 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,239 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,239 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,239 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,240 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,240 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,240 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,240 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,240 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,240 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,240 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,240 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,240 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,240 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,241 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,241 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,241 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,241 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,241 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,241 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,241 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,241 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,242 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,242 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,242 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,242 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,242 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,242 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,242 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,242 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,243 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,243 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,243 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,243 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,243 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,243 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,243 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,243 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,243 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,243 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,244 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,244 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,244 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,244 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,244 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,244 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,244 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,244 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,244 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,245 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,245 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,245 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,245 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,245 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,245 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,245 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,246 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,246 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,246 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,246 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,246 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,246 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,246 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,246 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,247 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,247 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,247 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,247 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,247 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,247 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,247 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,247 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,248 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,248 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,249 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,249 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,249 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,249 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,249 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,249 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,249 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,249 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,249 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,250 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,250 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,250 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,250 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,250 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,250 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,250 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,250 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,250 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,251 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,251 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,251 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,251 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,251 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,251 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,251 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,251 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,251 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,251 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,252 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,252 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,252 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,252 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,252 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,252 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,252 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,252 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,252 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,252 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,253 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,253 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,253 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,253 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,253 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,253 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,253 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,253 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,253 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,253 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,253 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,253 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,253 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,254 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,254 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,254 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,254 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,254 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,254 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,254 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,254 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,254 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,254 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,254 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,254 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,255 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,255 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,255 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,255 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,255 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,255 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,255 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,255 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,255 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,255 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,255 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,255 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,256 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,256 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,256 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,256 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,256 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,256 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,256 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,256 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,256 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,256 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,257 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,257 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,257 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,257 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,257 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,257 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,257 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,257 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,257 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,257 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,257 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,257 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,258 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,258 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,258 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,258 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,258 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,258 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,258 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,258 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,258 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,258 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,259 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:19:09,263 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 06:19:09,263 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 06:19:09,269 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 06:19:09,279 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 06:19:09,295 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 06:19:09,295 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 06:19:09,295 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 06:19:09,295 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 06:19:09,295 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 06:19:09,295 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 06:19:09,295 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 06:19:09,295 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 06:19:09,302 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 173places, 226 transitions [2018-12-02 06:19:14,953 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 83127 states. [2018-12-02 06:19:14,955 INFO L276 IsEmpty]: Start isEmpty. Operand 83127 states. [2018-12-02 06:19:14,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-02 06:19:14,960 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:19:14,961 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:19:14,962 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:19:14,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:19:14,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1645016021, now seen corresponding path program 1 times [2018-12-02 06:19:14,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:19:15,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:19:15,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:19:15,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:19:15,002 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:19:15,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:19:15,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:19:15,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:19:15,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 06:19:15,116 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:19:15,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 06:19:15,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 06:19:15,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 06:19:15,128 INFO L87 Difference]: Start difference. First operand 83127 states. Second operand 4 states. [2018-12-02 06:19:15,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:19:15,944 INFO L93 Difference]: Finished difference Result 150583 states and 603160 transitions. [2018-12-02 06:19:15,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 06:19:15,945 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-12-02 06:19:15,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:19:16,451 INFO L225 Difference]: With dead ends: 150583 [2018-12-02 06:19:16,451 INFO L226 Difference]: Without dead ends: 105839 [2018-12-02 06:19:16,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 06:19:17,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105839 states. [2018-12-02 06:19:18,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105839 to 61235. [2018-12-02 06:19:18,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61235 states. [2018-12-02 06:19:18,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61235 states to 61235 states and 248290 transitions. [2018-12-02 06:19:18,500 INFO L78 Accepts]: Start accepts. Automaton has 61235 states and 248290 transitions. Word has length 38 [2018-12-02 06:19:18,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:19:18,500 INFO L480 AbstractCegarLoop]: Abstraction has 61235 states and 248290 transitions. [2018-12-02 06:19:18,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 06:19:18,501 INFO L276 IsEmpty]: Start isEmpty. Operand 61235 states and 248290 transitions. [2018-12-02 06:19:18,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 06:19:18,507 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:19:18,507 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:19:18,507 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:19:18,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:19:18,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1043746306, now seen corresponding path program 1 times [2018-12-02 06:19:18,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:19:18,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:19:18,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:19:18,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:19:18,512 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:19:18,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:19:18,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:19:18,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:19:18,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 06:19:18,573 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:19:18,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 06:19:18,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:19:18,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:19:18,575 INFO L87 Difference]: Start difference. First operand 61235 states and 248290 transitions. Second operand 5 states. [2018-12-02 06:19:19,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:19:19,590 INFO L93 Difference]: Finished difference Result 146039 states and 554300 transitions. [2018-12-02 06:19:19,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 06:19:19,591 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-02 06:19:19,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:19:19,896 INFO L225 Difference]: With dead ends: 146039 [2018-12-02 06:19:19,896 INFO L226 Difference]: Without dead ends: 145471 [2018-12-02 06:19:19,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 06:19:22,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145471 states. [2018-12-02 06:19:23,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145471 to 96613. [2018-12-02 06:19:23,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96613 states. [2018-12-02 06:19:23,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96613 states to 96613 states and 368455 transitions. [2018-12-02 06:19:23,725 INFO L78 Accepts]: Start accepts. Automaton has 96613 states and 368455 transitions. Word has length 46 [2018-12-02 06:19:23,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:19:23,726 INFO L480 AbstractCegarLoop]: Abstraction has 96613 states and 368455 transitions. [2018-12-02 06:19:23,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 06:19:23,726 INFO L276 IsEmpty]: Start isEmpty. Operand 96613 states and 368455 transitions. [2018-12-02 06:19:23,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-02 06:19:23,729 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:19:23,729 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:19:23,729 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:19:23,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:19:23,730 INFO L82 PathProgramCache]: Analyzing trace with hash 136646938, now seen corresponding path program 1 times [2018-12-02 06:19:23,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:19:23,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:19:23,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:19:23,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:19:23,732 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:19:23,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:19:23,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:19:23,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:19:23,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 06:19:23,771 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:19:23,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 06:19:23,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:19:23,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:19:23,772 INFO L87 Difference]: Start difference. First operand 96613 states and 368455 transitions. Second operand 5 states. [2018-12-02 06:19:24,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:19:24,755 INFO L93 Difference]: Finished difference Result 199269 states and 748089 transitions. [2018-12-02 06:19:24,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 06:19:24,756 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-02 06:19:24,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:19:25,170 INFO L225 Difference]: With dead ends: 199269 [2018-12-02 06:19:25,170 INFO L226 Difference]: Without dead ends: 198805 [2018-12-02 06:19:25,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 06:19:26,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198805 states. [2018-12-02 06:19:28,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198805 to 108296. [2018-12-02 06:19:28,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108296 states. [2018-12-02 06:19:28,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108296 states to 108296 states and 408659 transitions. [2018-12-02 06:19:28,331 INFO L78 Accepts]: Start accepts. Automaton has 108296 states and 408659 transitions. Word has length 47 [2018-12-02 06:19:28,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:19:28,331 INFO L480 AbstractCegarLoop]: Abstraction has 108296 states and 408659 transitions. [2018-12-02 06:19:28,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 06:19:28,331 INFO L276 IsEmpty]: Start isEmpty. Operand 108296 states and 408659 transitions. [2018-12-02 06:19:28,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-02 06:19:28,337 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:19:28,337 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:19:28,337 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:19:28,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:19:28,337 INFO L82 PathProgramCache]: Analyzing trace with hash -943699264, now seen corresponding path program 1 times [2018-12-02 06:19:28,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:19:28,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:19:28,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:19:28,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:19:28,339 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:19:28,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:19:28,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:19:28,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:19:28,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:19:28,359 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:19:28,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:19:28,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:19:28,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:19:28,359 INFO L87 Difference]: Start difference. First operand 108296 states and 408659 transitions. Second operand 3 states. [2018-12-02 06:19:28,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:19:28,993 INFO L93 Difference]: Finished difference Result 179115 states and 655174 transitions. [2018-12-02 06:19:28,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:19:28,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-02 06:19:28,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:19:29,340 INFO L225 Difference]: With dead ends: 179115 [2018-12-02 06:19:29,340 INFO L226 Difference]: Without dead ends: 179115 [2018-12-02 06:19:29,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:19:30,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179115 states. [2018-12-02 06:19:32,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179115 to 163646. [2018-12-02 06:19:32,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163646 states. [2018-12-02 06:19:32,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163646 states to 163646 states and 603625 transitions. [2018-12-02 06:19:32,836 INFO L78 Accepts]: Start accepts. Automaton has 163646 states and 603625 transitions. Word has length 49 [2018-12-02 06:19:32,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:19:32,836 INFO L480 AbstractCegarLoop]: Abstraction has 163646 states and 603625 transitions. [2018-12-02 06:19:32,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:19:32,837 INFO L276 IsEmpty]: Start isEmpty. Operand 163646 states and 603625 transitions. [2018-12-02 06:19:32,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 06:19:32,849 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:19:32,849 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:19:32,849 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:19:32,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:19:32,849 INFO L82 PathProgramCache]: Analyzing trace with hash -721809298, now seen corresponding path program 1 times [2018-12-02 06:19:32,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:19:32,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:19:32,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:19:32,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:19:32,851 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:19:32,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:19:32,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:19:32,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:19:32,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 06:19:32,906 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:19:32,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 06:19:32,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 06:19:32,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:19:32,906 INFO L87 Difference]: Start difference. First operand 163646 states and 603625 transitions. Second operand 6 states. [2018-12-02 06:19:34,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:19:34,275 INFO L93 Difference]: Finished difference Result 214598 states and 788311 transitions. [2018-12-02 06:19:34,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 06:19:34,276 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-02 06:19:34,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:19:34,726 INFO L225 Difference]: With dead ends: 214598 [2018-12-02 06:19:34,726 INFO L226 Difference]: Without dead ends: 214598 [2018-12-02 06:19:34,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 06:19:36,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214598 states. [2018-12-02 06:19:40,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214598 to 200128. [2018-12-02 06:19:40,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200128 states. [2018-12-02 06:19:40,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200128 states to 200128 states and 735197 transitions. [2018-12-02 06:19:40,715 INFO L78 Accepts]: Start accepts. Automaton has 200128 states and 735197 transitions. Word has length 53 [2018-12-02 06:19:40,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:19:40,715 INFO L480 AbstractCegarLoop]: Abstraction has 200128 states and 735197 transitions. [2018-12-02 06:19:40,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 06:19:40,715 INFO L276 IsEmpty]: Start isEmpty. Operand 200128 states and 735197 transitions. [2018-12-02 06:19:40,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 06:19:40,733 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:19:40,733 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:19:40,733 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:19:40,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:19:40,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1776206639, now seen corresponding path program 1 times [2018-12-02 06:19:40,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:19:40,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:19:40,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:19:40,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:19:40,735 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:19:40,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:19:40,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:19:40,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:19:40,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 06:19:40,793 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:19:40,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 06:19:40,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 06:19:40,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 06:19:40,794 INFO L87 Difference]: Start difference. First operand 200128 states and 735197 transitions. Second operand 7 states. [2018-12-02 06:19:42,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:19:42,433 INFO L93 Difference]: Finished difference Result 283834 states and 1009167 transitions. [2018-12-02 06:19:42,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 06:19:42,434 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-12-02 06:19:42,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:19:43,004 INFO L225 Difference]: With dead ends: 283834 [2018-12-02 06:19:43,005 INFO L226 Difference]: Without dead ends: 283834 [2018-12-02 06:19:43,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-02 06:19:45,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283834 states. [2018-12-02 06:19:49,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283834 to 228356. [2018-12-02 06:19:49,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228356 states. [2018-12-02 06:19:50,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228356 states to 228356 states and 826700 transitions. [2018-12-02 06:19:50,025 INFO L78 Accepts]: Start accepts. Automaton has 228356 states and 826700 transitions. Word has length 53 [2018-12-02 06:19:50,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:19:50,026 INFO L480 AbstractCegarLoop]: Abstraction has 228356 states and 826700 transitions. [2018-12-02 06:19:50,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 06:19:50,026 INFO L276 IsEmpty]: Start isEmpty. Operand 228356 states and 826700 transitions. [2018-12-02 06:19:50,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 06:19:50,042 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:19:50,042 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:19:50,042 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:19:50,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:19:50,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1631256976, now seen corresponding path program 1 times [2018-12-02 06:19:50,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:19:50,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:19:50,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:19:50,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:19:50,044 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:19:50,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:19:50,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:19:50,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:19:50,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 06:19:50,077 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:19:50,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 06:19:50,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 06:19:50,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 06:19:50,078 INFO L87 Difference]: Start difference. First operand 228356 states and 826700 transitions. Second operand 4 states. [2018-12-02 06:19:50,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:19:50,194 INFO L93 Difference]: Finished difference Result 38827 states and 123113 transitions. [2018-12-02 06:19:50,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 06:19:50,195 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2018-12-02 06:19:50,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:19:50,238 INFO L225 Difference]: With dead ends: 38827 [2018-12-02 06:19:50,239 INFO L226 Difference]: Without dead ends: 32376 [2018-12-02 06:19:50,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:19:50,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32376 states. [2018-12-02 06:19:50,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32376 to 32135. [2018-12-02 06:19:50,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32135 states. [2018-12-02 06:19:50,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32135 states to 32135 states and 100387 transitions. [2018-12-02 06:19:50,584 INFO L78 Accepts]: Start accepts. Automaton has 32135 states and 100387 transitions. Word has length 53 [2018-12-02 06:19:50,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:19:50,584 INFO L480 AbstractCegarLoop]: Abstraction has 32135 states and 100387 transitions. [2018-12-02 06:19:50,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 06:19:50,584 INFO L276 IsEmpty]: Start isEmpty. Operand 32135 states and 100387 transitions. [2018-12-02 06:19:50,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 06:19:50,586 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:19:50,586 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:19:50,586 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:19:50,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:19:50,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1658594805, now seen corresponding path program 1 times [2018-12-02 06:19:50,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:19:50,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:19:50,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:19:50,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:19:50,587 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:19:50,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:19:50,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:19:50,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:19:50,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 06:19:50,628 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:19:50,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 06:19:50,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 06:19:50,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:19:50,629 INFO L87 Difference]: Start difference. First operand 32135 states and 100387 transitions. Second operand 6 states. [2018-12-02 06:19:51,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:19:51,056 INFO L93 Difference]: Finished difference Result 42537 states and 131570 transitions. [2018-12-02 06:19:51,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 06:19:51,056 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-02 06:19:51,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:19:51,107 INFO L225 Difference]: With dead ends: 42537 [2018-12-02 06:19:51,108 INFO L226 Difference]: Without dead ends: 42440 [2018-12-02 06:19:51,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-12-02 06:19:51,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42440 states. [2018-12-02 06:19:51,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42440 to 31836. [2018-12-02 06:19:51,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31836 states. [2018-12-02 06:19:51,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31836 states to 31836 states and 99515 transitions. [2018-12-02 06:19:51,772 INFO L78 Accepts]: Start accepts. Automaton has 31836 states and 99515 transitions. Word has length 53 [2018-12-02 06:19:51,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:19:51,772 INFO L480 AbstractCegarLoop]: Abstraction has 31836 states and 99515 transitions. [2018-12-02 06:19:51,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 06:19:51,773 INFO L276 IsEmpty]: Start isEmpty. Operand 31836 states and 99515 transitions. [2018-12-02 06:19:51,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-02 06:19:51,777 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:19:51,777 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:19:51,777 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:19:51,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:19:51,777 INFO L82 PathProgramCache]: Analyzing trace with hash 228917533, now seen corresponding path program 1 times [2018-12-02 06:19:51,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:19:51,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:19:51,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:19:51,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:19:51,779 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:19:51,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:19:51,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:19:51,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:19:51,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 06:19:51,818 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:19:51,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 06:19:51,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 06:19:51,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 06:19:51,819 INFO L87 Difference]: Start difference. First operand 31836 states and 99515 transitions. Second operand 4 states. [2018-12-02 06:19:52,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:19:52,033 INFO L93 Difference]: Finished difference Result 41208 states and 129949 transitions. [2018-12-02 06:19:52,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 06:19:52,034 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-02 06:19:52,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:19:52,085 INFO L225 Difference]: With dead ends: 41208 [2018-12-02 06:19:52,086 INFO L226 Difference]: Without dead ends: 41208 [2018-12-02 06:19:52,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:19:52,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41208 states. [2018-12-02 06:19:52,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41208 to 35932. [2018-12-02 06:19:52,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35932 states. [2018-12-02 06:19:52,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35932 states to 35932 states and 112644 transitions. [2018-12-02 06:19:52,500 INFO L78 Accepts]: Start accepts. Automaton has 35932 states and 112644 transitions. Word has length 63 [2018-12-02 06:19:52,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:19:52,500 INFO L480 AbstractCegarLoop]: Abstraction has 35932 states and 112644 transitions. [2018-12-02 06:19:52,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 06:19:52,500 INFO L276 IsEmpty]: Start isEmpty. Operand 35932 states and 112644 transitions. [2018-12-02 06:19:52,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-02 06:19:52,505 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:19:52,505 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:19:52,506 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:19:52,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:19:52,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1971727868, now seen corresponding path program 1 times [2018-12-02 06:19:52,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:19:52,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:19:52,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:19:52,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:19:52,507 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:19:52,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:19:52,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:19:52,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:19:52,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 06:19:52,546 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:19:52,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 06:19:52,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 06:19:52,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:19:52,547 INFO L87 Difference]: Start difference. First operand 35932 states and 112644 transitions. Second operand 6 states. [2018-12-02 06:19:53,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:19:53,103 INFO L93 Difference]: Finished difference Result 72509 states and 225560 transitions. [2018-12-02 06:19:53,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 06:19:53,103 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2018-12-02 06:19:53,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:19:53,209 INFO L225 Difference]: With dead ends: 72509 [2018-12-02 06:19:53,209 INFO L226 Difference]: Without dead ends: 72445 [2018-12-02 06:19:53,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-02 06:19:53,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72445 states. [2018-12-02 06:19:53,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72445 to 40892. [2018-12-02 06:19:53,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40892 states. [2018-12-02 06:19:53,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40892 states to 40892 states and 126622 transitions. [2018-12-02 06:19:53,847 INFO L78 Accepts]: Start accepts. Automaton has 40892 states and 126622 transitions. Word has length 63 [2018-12-02 06:19:53,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:19:53,848 INFO L480 AbstractCegarLoop]: Abstraction has 40892 states and 126622 transitions. [2018-12-02 06:19:53,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 06:19:53,848 INFO L276 IsEmpty]: Start isEmpty. Operand 40892 states and 126622 transitions. [2018-12-02 06:19:53,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-02 06:19:53,857 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:19:53,858 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:19:53,858 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:19:53,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:19:53,858 INFO L82 PathProgramCache]: Analyzing trace with hash -203492115, now seen corresponding path program 1 times [2018-12-02 06:19:53,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:19:53,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:19:53,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:19:53,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:19:53,859 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:19:53,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:19:53,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:19:53,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:19:53,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:19:53,873 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:19:53,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:19:53,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:19:53,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:19:53,874 INFO L87 Difference]: Start difference. First operand 40892 states and 126622 transitions. Second operand 3 states. [2018-12-02 06:19:54,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:19:54,006 INFO L93 Difference]: Finished difference Result 46897 states and 143099 transitions. [2018-12-02 06:19:54,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:19:54,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-12-02 06:19:54,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:19:54,062 INFO L225 Difference]: With dead ends: 46897 [2018-12-02 06:19:54,062 INFO L226 Difference]: Without dead ends: 46897 [2018-12-02 06:19:54,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:19:54,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46897 states. [2018-12-02 06:19:54,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46897 to 40580. [2018-12-02 06:19:54,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40580 states. [2018-12-02 06:19:54,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40580 states to 40580 states and 123024 transitions. [2018-12-02 06:19:54,717 INFO L78 Accepts]: Start accepts. Automaton has 40580 states and 123024 transitions. Word has length 69 [2018-12-02 06:19:54,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:19:54,717 INFO L480 AbstractCegarLoop]: Abstraction has 40580 states and 123024 transitions. [2018-12-02 06:19:54,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:19:54,717 INFO L276 IsEmpty]: Start isEmpty. Operand 40580 states and 123024 transitions. [2018-12-02 06:19:54,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-02 06:19:54,726 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:19:54,726 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:19:54,726 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:19:54,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:19:54,727 INFO L82 PathProgramCache]: Analyzing trace with hash 756655101, now seen corresponding path program 1 times [2018-12-02 06:19:54,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:19:54,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:19:54,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:19:54,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:19:54,728 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:19:54,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:19:54,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:19:54,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:19:54,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 06:19:54,781 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:19:54,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 06:19:54,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 06:19:54,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 06:19:54,782 INFO L87 Difference]: Start difference. First operand 40580 states and 123024 transitions. Second operand 7 states. [2018-12-02 06:19:55,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:19:55,605 INFO L93 Difference]: Finished difference Result 56545 states and 170864 transitions. [2018-12-02 06:19:55,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 06:19:55,605 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2018-12-02 06:19:55,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:19:55,676 INFO L225 Difference]: With dead ends: 56545 [2018-12-02 06:19:55,676 INFO L226 Difference]: Without dead ends: 56241 [2018-12-02 06:19:55,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-12-02 06:19:55,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56241 states. [2018-12-02 06:19:56,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56241 to 47672. [2018-12-02 06:19:56,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47672 states. [2018-12-02 06:19:56,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47672 states to 47672 states and 144131 transitions. [2018-12-02 06:19:56,215 INFO L78 Accepts]: Start accepts. Automaton has 47672 states and 144131 transitions. Word has length 70 [2018-12-02 06:19:56,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:19:56,215 INFO L480 AbstractCegarLoop]: Abstraction has 47672 states and 144131 transitions. [2018-12-02 06:19:56,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 06:19:56,215 INFO L276 IsEmpty]: Start isEmpty. Operand 47672 states and 144131 transitions. [2018-12-02 06:19:56,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-02 06:19:56,226 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:19:56,226 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:19:56,226 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:19:56,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:19:56,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1040296258, now seen corresponding path program 1 times [2018-12-02 06:19:56,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:19:56,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:19:56,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:19:56,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:19:56,227 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:19:56,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:19:56,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:19:56,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:19:56,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 06:19:56,298 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:19:56,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 06:19:56,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 06:19:56,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-02 06:19:56,298 INFO L87 Difference]: Start difference. First operand 47672 states and 144131 transitions. Second operand 8 states. [2018-12-02 06:19:57,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:19:57,065 INFO L93 Difference]: Finished difference Result 57838 states and 172357 transitions. [2018-12-02 06:19:57,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 06:19:57,065 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 70 [2018-12-02 06:19:57,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:19:57,135 INFO L225 Difference]: With dead ends: 57838 [2018-12-02 06:19:57,135 INFO L226 Difference]: Without dead ends: 57838 [2018-12-02 06:19:57,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-12-02 06:19:57,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57838 states. [2018-12-02 06:19:57,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57838 to 50532. [2018-12-02 06:19:57,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50532 states. [2018-12-02 06:19:57,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50532 states to 50532 states and 152080 transitions. [2018-12-02 06:19:57,948 INFO L78 Accepts]: Start accepts. Automaton has 50532 states and 152080 transitions. Word has length 70 [2018-12-02 06:19:57,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:19:57,949 INFO L480 AbstractCegarLoop]: Abstraction has 50532 states and 152080 transitions. [2018-12-02 06:19:57,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 06:19:57,949 INFO L276 IsEmpty]: Start isEmpty. Operand 50532 states and 152080 transitions. [2018-12-02 06:19:57,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-02 06:19:57,960 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:19:57,960 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:19:57,961 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:19:57,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:19:57,961 INFO L82 PathProgramCache]: Analyzing trace with hash -152792577, now seen corresponding path program 1 times [2018-12-02 06:19:57,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:19:57,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:19:57,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:19:57,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:19:57,962 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:19:57,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:19:57,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:19:57,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:19:57,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 06:19:57,994 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:19:57,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 06:19:57,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:19:57,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:19:57,995 INFO L87 Difference]: Start difference. First operand 50532 states and 152080 transitions. Second operand 5 states. [2018-12-02 06:19:58,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:19:58,043 INFO L93 Difference]: Finished difference Result 13236 states and 33132 transitions. [2018-12-02 06:19:58,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 06:19:58,043 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-12-02 06:19:58,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:19:58,052 INFO L225 Difference]: With dead ends: 13236 [2018-12-02 06:19:58,052 INFO L226 Difference]: Without dead ends: 11116 [2018-12-02 06:19:58,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 06:19:58,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11116 states. [2018-12-02 06:19:58,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11116 to 8545. [2018-12-02 06:19:58,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8545 states. [2018-12-02 06:19:58,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8545 states to 8545 states and 21304 transitions. [2018-12-02 06:19:58,134 INFO L78 Accepts]: Start accepts. Automaton has 8545 states and 21304 transitions. Word has length 70 [2018-12-02 06:19:58,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:19:58,135 INFO L480 AbstractCegarLoop]: Abstraction has 8545 states and 21304 transitions. [2018-12-02 06:19:58,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 06:19:58,135 INFO L276 IsEmpty]: Start isEmpty. Operand 8545 states and 21304 transitions. [2018-12-02 06:19:58,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-02 06:19:58,140 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:19:58,140 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-02 06:19:58,141 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:19:58,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:19:58,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1361713172, now seen corresponding path program 1 times [2018-12-02 06:19:58,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:19:58,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:19:58,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:19:58,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:19:58,142 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:19:58,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:19:58,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:19:58,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:19:58,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 06:19:58,182 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:19:58,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 06:19:58,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 06:19:58,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 06:19:58,183 INFO L87 Difference]: Start difference. First operand 8545 states and 21304 transitions. Second operand 4 states. [2018-12-02 06:19:58,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:19:58,323 INFO L93 Difference]: Finished difference Result 9960 states and 24428 transitions. [2018-12-02 06:19:58,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 06:19:58,324 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2018-12-02 06:19:58,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:19:58,330 INFO L225 Difference]: With dead ends: 9960 [2018-12-02 06:19:58,331 INFO L226 Difference]: Without dead ends: 9960 [2018-12-02 06:19:58,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 06:19:58,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9960 states. [2018-12-02 06:19:58,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9960 to 9441. [2018-12-02 06:19:58,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9441 states. [2018-12-02 06:19:58,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9441 states to 9441 states and 23271 transitions. [2018-12-02 06:19:58,409 INFO L78 Accepts]: Start accepts. Automaton has 9441 states and 23271 transitions. Word has length 98 [2018-12-02 06:19:58,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:19:58,409 INFO L480 AbstractCegarLoop]: Abstraction has 9441 states and 23271 transitions. [2018-12-02 06:19:58,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 06:19:58,409 INFO L276 IsEmpty]: Start isEmpty. Operand 9441 states and 23271 transitions. [2018-12-02 06:19:58,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-02 06:19:58,418 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:19:58,418 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-02 06:19:58,418 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:19:58,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:19:58,419 INFO L82 PathProgramCache]: Analyzing trace with hash 856044781, now seen corresponding path program 1 times [2018-12-02 06:19:58,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:19:58,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:19:58,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:19:58,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:19:58,420 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:19:58,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:19:58,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:19:58,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:19:58,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:19:58,450 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:19:58,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:19:58,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:19:58,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:19:58,450 INFO L87 Difference]: Start difference. First operand 9441 states and 23271 transitions. Second operand 3 states. [2018-12-02 06:19:58,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:19:58,604 INFO L93 Difference]: Finished difference Result 12725 states and 30850 transitions. [2018-12-02 06:19:58,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:19:58,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2018-12-02 06:19:58,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:19:58,614 INFO L225 Difference]: With dead ends: 12725 [2018-12-02 06:19:58,614 INFO L226 Difference]: Without dead ends: 12725 [2018-12-02 06:19:58,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:19:58,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12725 states. [2018-12-02 06:19:58,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12725 to 11524. [2018-12-02 06:19:58,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11524 states. [2018-12-02 06:19:58,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11524 states to 11524 states and 28181 transitions. [2018-12-02 06:19:58,716 INFO L78 Accepts]: Start accepts. Automaton has 11524 states and 28181 transitions. Word has length 98 [2018-12-02 06:19:58,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:19:58,716 INFO L480 AbstractCegarLoop]: Abstraction has 11524 states and 28181 transitions. [2018-12-02 06:19:58,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:19:58,716 INFO L276 IsEmpty]: Start isEmpty. Operand 11524 states and 28181 transitions. [2018-12-02 06:19:58,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-02 06:19:58,725 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:19:58,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] [2018-12-02 06:19:58,725 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:19:58,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:19:58,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1723288819, now seen corresponding path program 2 times [2018-12-02 06:19:58,725 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:19:58,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:19:58,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:19:58,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:19:58,726 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:19:58,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:19:58,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:19:58,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:19:58,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 06:19:58,786 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:19:58,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 06:19:58,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 06:19:58,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:19:58,787 INFO L87 Difference]: Start difference. First operand 11524 states and 28181 transitions. Second operand 6 states. [2018-12-02 06:19:59,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:19:59,064 INFO L93 Difference]: Finished difference Result 14264 states and 34204 transitions. [2018-12-02 06:19:59,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 06:19:59,064 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2018-12-02 06:19:59,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:19:59,074 INFO L225 Difference]: With dead ends: 14264 [2018-12-02 06:19:59,074 INFO L226 Difference]: Without dead ends: 14264 [2018-12-02 06:19:59,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-02 06:19:59,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14264 states. [2018-12-02 06:19:59,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14264 to 11317. [2018-12-02 06:19:59,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11317 states. [2018-12-02 06:19:59,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11317 states to 11317 states and 27219 transitions. [2018-12-02 06:19:59,174 INFO L78 Accepts]: Start accepts. Automaton has 11317 states and 27219 transitions. Word has length 98 [2018-12-02 06:19:59,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:19:59,174 INFO L480 AbstractCegarLoop]: Abstraction has 11317 states and 27219 transitions. [2018-12-02 06:19:59,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 06:19:59,174 INFO L276 IsEmpty]: Start isEmpty. Operand 11317 states and 27219 transitions. [2018-12-02 06:19:59,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-02 06:19:59,182 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:19:59,182 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-02 06:19:59,182 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:19:59,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:19:59,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1844120649, now seen corresponding path program 1 times [2018-12-02 06:19:59,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:19:59,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:19:59,184 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 06:19:59,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:19:59,184 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:19:59,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:19:59,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:19:59,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:19:59,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 06:19:59,270 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:19:59,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 06:19:59,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 06:19:59,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-02 06:19:59,271 INFO L87 Difference]: Start difference. First operand 11317 states and 27219 transitions. Second operand 8 states. [2018-12-02 06:19:59,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:19:59,655 INFO L93 Difference]: Finished difference Result 15645 states and 37757 transitions. [2018-12-02 06:19:59,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 06:19:59,655 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 100 [2018-12-02 06:19:59,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:19:59,666 INFO L225 Difference]: With dead ends: 15645 [2018-12-02 06:19:59,666 INFO L226 Difference]: Without dead ends: 15613 [2018-12-02 06:19:59,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-12-02 06:19:59,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15613 states. [2018-12-02 06:19:59,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15613 to 13044. [2018-12-02 06:19:59,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13044 states. [2018-12-02 06:19:59,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13044 states to 13044 states and 31554 transitions. [2018-12-02 06:19:59,787 INFO L78 Accepts]: Start accepts. Automaton has 13044 states and 31554 transitions. Word has length 100 [2018-12-02 06:19:59,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:19:59,787 INFO L480 AbstractCegarLoop]: Abstraction has 13044 states and 31554 transitions. [2018-12-02 06:19:59,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 06:19:59,787 INFO L276 IsEmpty]: Start isEmpty. Operand 13044 states and 31554 transitions. [2018-12-02 06:19:59,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-02 06:19:59,796 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:19:59,797 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-02 06:19:59,797 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:19:59,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:19:59,797 INFO L82 PathProgramCache]: Analyzing trace with hash 47169290, now seen corresponding path program 1 times [2018-12-02 06:19:59,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:19:59,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:19:59,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:19:59,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:19:59,798 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:19:59,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:19:59,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:19:59,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:19:59,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 06:19:59,848 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:19:59,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 06:19:59,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 06:19:59,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 06:19:59,849 INFO L87 Difference]: Start difference. First operand 13044 states and 31554 transitions. Second operand 7 states. [2018-12-02 06:20:00,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:20:00,231 INFO L93 Difference]: Finished difference Result 18318 states and 44570 transitions. [2018-12-02 06:20:00,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 06:20:00,231 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2018-12-02 06:20:00,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:20:00,246 INFO L225 Difference]: With dead ends: 18318 [2018-12-02 06:20:00,246 INFO L226 Difference]: Without dead ends: 18318 [2018-12-02 06:20:00,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-12-02 06:20:00,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18318 states. [2018-12-02 06:20:00,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18318 to 13525. [2018-12-02 06:20:00,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13525 states. [2018-12-02 06:20:00,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13525 states to 13525 states and 32837 transitions. [2018-12-02 06:20:00,602 INFO L78 Accepts]: Start accepts. Automaton has 13525 states and 32837 transitions. Word has length 100 [2018-12-02 06:20:00,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:20:00,602 INFO L480 AbstractCegarLoop]: Abstraction has 13525 states and 32837 transitions. [2018-12-02 06:20:00,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 06:20:00,602 INFO L276 IsEmpty]: Start isEmpty. Operand 13525 states and 32837 transitions. [2018-12-02 06:20:00,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-02 06:20:00,612 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:20:00,612 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-02 06:20:00,612 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:20:00,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:20:00,612 INFO L82 PathProgramCache]: Analyzing trace with hash 934672971, now seen corresponding path program 1 times [2018-12-02 06:20:00,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:20:00,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:20:00,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:20:00,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:20:00,614 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:20:00,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:20:00,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:20:00,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:20:00,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 06:20:00,667 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:20:00,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 06:20:00,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 06:20:00,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-02 06:20:00,668 INFO L87 Difference]: Start difference. First operand 13525 states and 32837 transitions. Second operand 8 states. [2018-12-02 06:20:01,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:20:01,038 INFO L93 Difference]: Finished difference Result 15997 states and 38734 transitions. [2018-12-02 06:20:01,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 06:20:01,038 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 100 [2018-12-02 06:20:01,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:20:01,049 INFO L225 Difference]: With dead ends: 15997 [2018-12-02 06:20:01,049 INFO L226 Difference]: Without dead ends: 15997 [2018-12-02 06:20:01,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-12-02 06:20:01,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15997 states. [2018-12-02 06:20:01,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15997 to 13587. [2018-12-02 06:20:01,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13587 states. [2018-12-02 06:20:01,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13587 states to 13587 states and 32969 transitions. [2018-12-02 06:20:01,174 INFO L78 Accepts]: Start accepts. Automaton has 13587 states and 32969 transitions. Word has length 100 [2018-12-02 06:20:01,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:20:01,175 INFO L480 AbstractCegarLoop]: Abstraction has 13587 states and 32969 transitions. [2018-12-02 06:20:01,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 06:20:01,175 INFO L276 IsEmpty]: Start isEmpty. Operand 13587 states and 32969 transitions. [2018-12-02 06:20:01,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-02 06:20:01,184 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:20:01,184 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-02 06:20:01,184 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:20:01,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:20:01,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1990886999, now seen corresponding path program 1 times [2018-12-02 06:20:01,184 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:20:01,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:20:01,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:20:01,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:20:01,185 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:20:01,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:20:01,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:20:01,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:20:01,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 06:20:01,272 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:20:01,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 06:20:01,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 06:20:01,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:20:01,272 INFO L87 Difference]: Start difference. First operand 13587 states and 32969 transitions. Second operand 6 states. [2018-12-02 06:20:01,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:20:01,393 INFO L93 Difference]: Finished difference Result 13315 states and 32017 transitions. [2018-12-02 06:20:01,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 06:20:01,394 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-02 06:20:01,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:20:01,403 INFO L225 Difference]: With dead ends: 13315 [2018-12-02 06:20:01,403 INFO L226 Difference]: Without dead ends: 13315 [2018-12-02 06:20:01,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-02 06:20:01,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13315 states. [2018-12-02 06:20:01,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13315 to 11142. [2018-12-02 06:20:01,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11142 states. [2018-12-02 06:20:01,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11142 states to 11142 states and 26898 transitions. [2018-12-02 06:20:01,502 INFO L78 Accepts]: Start accepts. Automaton has 11142 states and 26898 transitions. Word has length 100 [2018-12-02 06:20:01,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:20:01,502 INFO L480 AbstractCegarLoop]: Abstraction has 11142 states and 26898 transitions. [2018-12-02 06:20:01,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 06:20:01,502 INFO L276 IsEmpty]: Start isEmpty. Operand 11142 states and 26898 transitions. [2018-12-02 06:20:01,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-02 06:20:01,509 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:20:01,509 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-02 06:20:01,510 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:20:01,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:20:01,510 INFO L82 PathProgramCache]: Analyzing trace with hash -22235627, now seen corresponding path program 1 times [2018-12-02 06:20:01,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:20:01,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:20:01,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:20:01,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:20:01,511 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:20:01,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:20:01,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:20:01,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:20:01,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 06:20:01,554 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:20:01,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 06:20:01,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:20:01,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:20:01,555 INFO L87 Difference]: Start difference. First operand 11142 states and 26898 transitions. Second operand 5 states. [2018-12-02 06:20:01,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:20:01,721 INFO L93 Difference]: Finished difference Result 12940 states and 30676 transitions. [2018-12-02 06:20:01,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 06:20:01,721 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2018-12-02 06:20:01,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:20:01,730 INFO L225 Difference]: With dead ends: 12940 [2018-12-02 06:20:01,731 INFO L226 Difference]: Without dead ends: 12940 [2018-12-02 06:20:01,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 06:20:01,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12940 states. [2018-12-02 06:20:01,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12940 to 11271. [2018-12-02 06:20:01,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11271 states. [2018-12-02 06:20:01,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11271 states to 11271 states and 27163 transitions. [2018-12-02 06:20:01,832 INFO L78 Accepts]: Start accepts. Automaton has 11271 states and 27163 transitions. Word has length 100 [2018-12-02 06:20:01,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:20:01,833 INFO L480 AbstractCegarLoop]: Abstraction has 11271 states and 27163 transitions. [2018-12-02 06:20:01,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 06:20:01,833 INFO L276 IsEmpty]: Start isEmpty. Operand 11271 states and 27163 transitions. [2018-12-02 06:20:01,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-02 06:20:01,841 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:20:01,841 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-02 06:20:01,841 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:20:01,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:20:01,841 INFO L82 PathProgramCache]: Analyzing trace with hash -909176834, now seen corresponding path program 1 times [2018-12-02 06:20:01,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:20:01,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:20:01,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:20:01,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:20:01,842 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:20:01,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:20:01,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:20:01,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:20:01,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 06:20:01,894 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:20:01,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 06:20:01,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 06:20:01,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-02 06:20:01,895 INFO L87 Difference]: Start difference. First operand 11271 states and 27163 transitions. Second operand 8 states. [2018-12-02 06:20:02,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:20:02,776 INFO L93 Difference]: Finished difference Result 17784 states and 41718 transitions. [2018-12-02 06:20:02,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-02 06:20:02,776 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 102 [2018-12-02 06:20:02,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:20:02,789 INFO L225 Difference]: With dead ends: 17784 [2018-12-02 06:20:02,789 INFO L226 Difference]: Without dead ends: 17689 [2018-12-02 06:20:02,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2018-12-02 06:20:02,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17689 states. [2018-12-02 06:20:02,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17689 to 13165. [2018-12-02 06:20:02,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13165 states. [2018-12-02 06:20:02,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13165 states to 13165 states and 31423 transitions. [2018-12-02 06:20:02,918 INFO L78 Accepts]: Start accepts. Automaton has 13165 states and 31423 transitions. Word has length 102 [2018-12-02 06:20:02,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:20:02,918 INFO L480 AbstractCegarLoop]: Abstraction has 13165 states and 31423 transitions. [2018-12-02 06:20:02,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 06:20:02,918 INFO L276 IsEmpty]: Start isEmpty. Operand 13165 states and 31423 transitions. [2018-12-02 06:20:02,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-02 06:20:02,927 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:20:02,927 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-02 06:20:02,927 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:20:02,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:20:02,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1308581119, now seen corresponding path program 1 times [2018-12-02 06:20:02,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:20:02,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:20:02,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:20:02,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:20:02,928 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:20:02,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:20:02,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:20:02,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:20:02,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 06:20:02,994 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:20:02,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 06:20:02,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 06:20:02,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 06:20:02,994 INFO L87 Difference]: Start difference. First operand 13165 states and 31423 transitions. Second operand 7 states. [2018-12-02 06:20:03,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:20:03,293 INFO L93 Difference]: Finished difference Result 18127 states and 42049 transitions. [2018-12-02 06:20:03,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 06:20:03,293 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-02 06:20:03,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:20:03,306 INFO L225 Difference]: With dead ends: 18127 [2018-12-02 06:20:03,306 INFO L226 Difference]: Without dead ends: 18127 [2018-12-02 06:20:03,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-12-02 06:20:03,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18127 states. [2018-12-02 06:20:03,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18127 to 15594. [2018-12-02 06:20:03,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15594 states. [2018-12-02 06:20:03,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15594 states to 15594 states and 36654 transitions. [2018-12-02 06:20:03,482 INFO L78 Accepts]: Start accepts. Automaton has 15594 states and 36654 transitions. Word has length 102 [2018-12-02 06:20:03,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:20:03,482 INFO L480 AbstractCegarLoop]: Abstraction has 15594 states and 36654 transitions. [2018-12-02 06:20:03,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 06:20:03,482 INFO L276 IsEmpty]: Start isEmpty. Operand 15594 states and 36654 transitions. [2018-12-02 06:20:03,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-02 06:20:03,493 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:20:03,494 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:20:03,494 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:20:03,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:20:03,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1519932032, now seen corresponding path program 1 times [2018-12-02 06:20:03,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:20:03,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:20:03,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:20:03,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:20:03,495 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:20:03,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:20:03,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:20:03,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:20:03,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 06:20:03,562 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:20:03,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 06:20:03,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 06:20:03,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 06:20:03,562 INFO L87 Difference]: Start difference. First operand 15594 states and 36654 transitions. Second operand 7 states. [2018-12-02 06:20:03,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:20:03,722 INFO L93 Difference]: Finished difference Result 16268 states and 38127 transitions. [2018-12-02 06:20:03,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 06:20:03,723 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-02 06:20:03,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:20:03,734 INFO L225 Difference]: With dead ends: 16268 [2018-12-02 06:20:03,734 INFO L226 Difference]: Without dead ends: 16268 [2018-12-02 06:20:03,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-12-02 06:20:03,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16268 states. [2018-12-02 06:20:03,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16268 to 16121. [2018-12-02 06:20:03,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16121 states. [2018-12-02 06:20:03,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16121 states to 16121 states and 37834 transitions. [2018-12-02 06:20:03,866 INFO L78 Accepts]: Start accepts. Automaton has 16121 states and 37834 transitions. Word has length 102 [2018-12-02 06:20:03,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:20:03,866 INFO L480 AbstractCegarLoop]: Abstraction has 16121 states and 37834 transitions. [2018-12-02 06:20:03,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 06:20:03,866 INFO L276 IsEmpty]: Start isEmpty. Operand 16121 states and 37834 transitions. [2018-12-02 06:20:03,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-02 06:20:03,877 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:20:03,877 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-02 06:20:03,877 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:20:03,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:20:03,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1887531583, now seen corresponding path program 1 times [2018-12-02 06:20:03,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:20:03,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:20:03,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:20:03,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:20:03,879 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:20:03,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:20:03,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:20:03,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:20:03,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 06:20:03,944 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:20:03,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 06:20:03,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 06:20:03,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-02 06:20:03,945 INFO L87 Difference]: Start difference. First operand 16121 states and 37834 transitions. Second operand 9 states. [2018-12-02 06:20:04,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:20:04,067 INFO L93 Difference]: Finished difference Result 19649 states and 46341 transitions. [2018-12-02 06:20:04,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 06:20:04,067 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2018-12-02 06:20:04,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:20:04,069 INFO L225 Difference]: With dead ends: 19649 [2018-12-02 06:20:04,069 INFO L226 Difference]: Without dead ends: 3718 [2018-12-02 06:20:04,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-12-02 06:20:04,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3718 states. [2018-12-02 06:20:04,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3718 to 3716. [2018-12-02 06:20:04,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3716 states. [2018-12-02 06:20:04,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3716 states to 3716 states and 8809 transitions. [2018-12-02 06:20:04,092 INFO L78 Accepts]: Start accepts. Automaton has 3716 states and 8809 transitions. Word has length 102 [2018-12-02 06:20:04,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:20:04,093 INFO L480 AbstractCegarLoop]: Abstraction has 3716 states and 8809 transitions. [2018-12-02 06:20:04,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 06:20:04,093 INFO L276 IsEmpty]: Start isEmpty. Operand 3716 states and 8809 transitions. [2018-12-02 06:20:04,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-02 06:20:04,095 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:20:04,095 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:20:04,095 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:20:04,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:20:04,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1248174073, now seen corresponding path program 1 times [2018-12-02 06:20:04,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:20:04,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:20:04,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:20:04,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:20:04,096 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:20:04,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:20:04,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:20:04,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:20:04,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 06:20:04,131 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:20:04,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 06:20:04,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:20:04,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:20:04,132 INFO L87 Difference]: Start difference. First operand 3716 states and 8809 transitions. Second operand 5 states. [2018-12-02 06:20:04,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:20:04,236 INFO L93 Difference]: Finished difference Result 4151 states and 9753 transitions. [2018-12-02 06:20:04,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 06:20:04,236 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2018-12-02 06:20:04,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:20:04,239 INFO L225 Difference]: With dead ends: 4151 [2018-12-02 06:20:04,239 INFO L226 Difference]: Without dead ends: 4116 [2018-12-02 06:20:04,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:20:04,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4116 states. [2018-12-02 06:20:04,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4116 to 3772. [2018-12-02 06:20:04,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3772 states. [2018-12-02 06:20:04,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3772 states to 3772 states and 8934 transitions. [2018-12-02 06:20:04,266 INFO L78 Accepts]: Start accepts. Automaton has 3772 states and 8934 transitions. Word has length 102 [2018-12-02 06:20:04,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:20:04,266 INFO L480 AbstractCegarLoop]: Abstraction has 3772 states and 8934 transitions. [2018-12-02 06:20:04,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 06:20:04,266 INFO L276 IsEmpty]: Start isEmpty. Operand 3772 states and 8934 transitions. [2018-12-02 06:20:04,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-02 06:20:04,268 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:20:04,269 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-02 06:20:04,269 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:20:04,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:20:04,269 INFO L82 PathProgramCache]: Analyzing trace with hash 923632257, now seen corresponding path program 1 times [2018-12-02 06:20:04,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:20:04,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:20:04,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:20:04,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:20:04,270 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:20:04,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:20:04,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:20:04,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:20:04,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 06:20:04,308 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:20:04,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 06:20:04,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 06:20:04,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 06:20:04,308 INFO L87 Difference]: Start difference. First operand 3772 states and 8934 transitions. Second operand 7 states. [2018-12-02 06:20:04,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:20:04,496 INFO L93 Difference]: Finished difference Result 4206 states and 9846 transitions. [2018-12-02 06:20:04,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 06:20:04,496 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-02 06:20:04,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:20:04,499 INFO L225 Difference]: With dead ends: 4206 [2018-12-02 06:20:04,499 INFO L226 Difference]: Without dead ends: 4206 [2018-12-02 06:20:04,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-02 06:20:04,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4206 states. [2018-12-02 06:20:04,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4206 to 3714. [2018-12-02 06:20:04,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3714 states. [2018-12-02 06:20:04,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3714 states to 3714 states and 8816 transitions. [2018-12-02 06:20:04,526 INFO L78 Accepts]: Start accepts. Automaton has 3714 states and 8816 transitions. Word has length 102 [2018-12-02 06:20:04,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:20:04,526 INFO L480 AbstractCegarLoop]: Abstraction has 3714 states and 8816 transitions. [2018-12-02 06:20:04,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 06:20:04,526 INFO L276 IsEmpty]: Start isEmpty. Operand 3714 states and 8816 transitions. [2018-12-02 06:20:04,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-02 06:20:04,528 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:20:04,528 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-02 06:20:04,529 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:20:04,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:20:04,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1515826752, now seen corresponding path program 2 times [2018-12-02 06:20:04,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:20:04,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:20:04,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:20:04,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:20:04,530 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:20:04,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:20:04,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:20:04,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:20:04,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 06:20:04,635 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:20:04,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 06:20:04,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 06:20:04,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-12-02 06:20:04,636 INFO L87 Difference]: Start difference. First operand 3714 states and 8816 transitions. Second operand 12 states. [2018-12-02 06:20:05,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:20:05,134 INFO L93 Difference]: Finished difference Result 5110 states and 11911 transitions. [2018-12-02 06:20:05,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 06:20:05,135 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 102 [2018-12-02 06:20:05,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:20:05,138 INFO L225 Difference]: With dead ends: 5110 [2018-12-02 06:20:05,138 INFO L226 Difference]: Without dead ends: 5110 [2018-12-02 06:20:05,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2018-12-02 06:20:05,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5110 states. [2018-12-02 06:20:05,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5110 to 3759. [2018-12-02 06:20:05,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3759 states. [2018-12-02 06:20:05,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3759 states to 3759 states and 8900 transitions. [2018-12-02 06:20:05,168 INFO L78 Accepts]: Start accepts. Automaton has 3759 states and 8900 transitions. Word has length 102 [2018-12-02 06:20:05,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:20:05,168 INFO L480 AbstractCegarLoop]: Abstraction has 3759 states and 8900 transitions. [2018-12-02 06:20:05,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 06:20:05,169 INFO L276 IsEmpty]: Start isEmpty. Operand 3759 states and 8900 transitions. [2018-12-02 06:20:05,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-02 06:20:05,171 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:20:05,171 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-02 06:20:05,171 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:20:05,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:20:05,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1891636863, now seen corresponding path program 2 times [2018-12-02 06:20:05,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:20:05,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:20:05,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 06:20:05,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:20:05,172 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:20:05,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:20:05,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:20:05,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:20:05,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-02 06:20:05,280 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:20:05,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 06:20:05,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 06:20:05,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-12-02 06:20:05,281 INFO L87 Difference]: Start difference. First operand 3759 states and 8900 transitions. Second operand 13 states. [2018-12-02 06:20:05,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:20:05,708 INFO L93 Difference]: Finished difference Result 6089 states and 14213 transitions. [2018-12-02 06:20:05,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 06:20:05,708 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 102 [2018-12-02 06:20:05,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:20:05,711 INFO L225 Difference]: With dead ends: 6089 [2018-12-02 06:20:05,711 INFO L226 Difference]: Without dead ends: 4362 [2018-12-02 06:20:05,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2018-12-02 06:20:05,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4362 states. [2018-12-02 06:20:05,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4362 to 3815. [2018-12-02 06:20:05,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3815 states. [2018-12-02 06:20:05,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3815 states to 3815 states and 8962 transitions. [2018-12-02 06:20:05,738 INFO L78 Accepts]: Start accepts. Automaton has 3815 states and 8962 transitions. Word has length 102 [2018-12-02 06:20:05,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:20:05,738 INFO L480 AbstractCegarLoop]: Abstraction has 3815 states and 8962 transitions. [2018-12-02 06:20:05,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 06:20:05,739 INFO L276 IsEmpty]: Start isEmpty. Operand 3815 states and 8962 transitions. [2018-12-02 06:20:05,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-02 06:20:05,741 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:20:05,741 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-02 06:20:05,741 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:20:05,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:20:05,741 INFO L82 PathProgramCache]: Analyzing trace with hash -604299489, now seen corresponding path program 3 times [2018-12-02 06:20:05,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:20:05,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:20:05,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 06:20:05,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:20:05,742 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:20:05,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:20:05,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:20:05,776 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 06:20:05,846 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 06:20:05,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 06:20:05 BasicIcfg [2018-12-02 06:20:05,847 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 06:20:05,847 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 06:20:05,847 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 06:20:05,847 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 06:20:05,848 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:19:09" (3/4) ... [2018-12-02 06:20:05,849 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 06:20:05,923 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_b3a21ee2-2d4e-460e-afef-56db9716e7a1/bin-2019/utaipan/witness.graphml [2018-12-02 06:20:05,923 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 06:20:05,924 INFO L168 Benchmark]: Toolchain (without parser) took 57558.86 ms. Allocated memory was 1.0 GB in the beginning and 6.5 GB in the end (delta: 5.5 GB). Free memory was 952.4 MB in the beginning and 3.0 GB in the end (delta: -2.1 GB). Peak memory consumption was 3.4 GB. Max. memory is 11.5 GB. [2018-12-02 06:20:05,925 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 06:20:05,925 INFO L168 Benchmark]: CACSL2BoogieTranslator took 324.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.1 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -188.4 MB). Peak memory consumption was 37.1 MB. Max. memory is 11.5 GB. [2018-12-02 06:20:05,925 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-02 06:20:05,926 INFO L168 Benchmark]: Boogie Preprocessor took 21.20 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 06:20:05,926 INFO L168 Benchmark]: RCFGBuilder took 458.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 53.7 MB). Peak memory consumption was 53.7 MB. Max. memory is 11.5 GB. [2018-12-02 06:20:05,926 INFO L168 Benchmark]: TraceAbstraction took 56641.62 ms. Allocated memory was 1.2 GB in the beginning and 6.5 GB in the end (delta: 5.3 GB). Free memory was 1.1 GB in the beginning and 3.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. [2018-12-02 06:20:05,926 INFO L168 Benchmark]: Witness Printer took 76.05 ms. Allocated memory is still 6.5 GB. Free memory was 3.1 GB in the beginning and 3.0 GB in the end (delta: 57.1 MB). Peak memory consumption was 57.1 MB. Max. memory is 11.5 GB. [2018-12-02 06:20:05,928 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 324.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.1 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -188.4 MB). Peak memory consumption was 37.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.20 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 458.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 53.7 MB). Peak memory consumption was 53.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 56641.62 ms. Allocated memory was 1.2 GB in the beginning and 6.5 GB in the end (delta: 5.3 GB). Free memory was 1.1 GB in the beginning and 3.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. * Witness Printer took 76.05 ms. Allocated memory is still 6.5 GB. Free memory was 3.1 GB in the beginning and 3.0 GB in the end (delta: 57.1 MB). Peak memory consumption was 57.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L678] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L679] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L680] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L682] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L684] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L685] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L686] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L687] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L688] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L689] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L690] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L691] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L692] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L693] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L694] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L695] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L696] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L697] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L698] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L699] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L700] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L786] -1 pthread_t t1765; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] FCALL, FORK -1 pthread_create(&t1765, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L788] -1 pthread_t t1766; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L789] FCALL, FORK -1 pthread_create(&t1766, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L734] 0 y$w_buff1 = y$w_buff0 [L735] 0 y$w_buff0 = 1 [L736] 0 y$w_buff1_used = y$w_buff0_used [L737] 0 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L739] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L740] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L741] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L742] 0 y$r_buff0_thd2 = (_Bool)1 [L745] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L746] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L747] 0 y$flush_delayed = weak$$choice2 [L748] 0 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] 0 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L750] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L751] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L751] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L752] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L753] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L753] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L754] EXPR 0 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 0 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L755] EXPR 0 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L755] 0 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L756] 0 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] EXPR 0 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 0 y = y$flush_delayed ? y$mem_tmp : y [L758] 0 y$flush_delayed = (_Bool)0 [L761] 0 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L704] 1 x = 1 [L709] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L710] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L711] 1 y$flush_delayed = weak$$choice2 [L712] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L713] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] 0 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L765] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L765] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L766] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L766] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L713] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L714] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L714] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L715] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L715] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L767] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L767] 0 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L768] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L768] 0 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L771] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L716] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L716] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L717] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L717] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L718] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L718] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L719] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L719] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L720] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L721] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L721] 1 y = y$flush_delayed ? y$mem_tmp : y [L722] 1 y$flush_delayed = (_Bool)0 [L727] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L791] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L796] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L796] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L797] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L798] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L799] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L802] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L5] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L5] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 283 locations, 3 error locations. UNSAFE Result, 56.5s OverallTime, 31 OverallIterations, 1 TraceHistogramMax, 17.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 11076 SDtfs, 14062 SDslu, 30992 SDs, 0 SdLazy, 12920 SolverSat, 696 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 329 GetRequests, 78 SyntacticMatches, 21 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=228356occurred in iteration=6, 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: 31.3s AutomataMinimizationTime, 30 MinimizatonAttempts, 370046 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 2509 NumberOfCodeBlocks, 2509 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2377 ConstructedInterpolants, 0 QuantifiedInterpolants, 515019 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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...