./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe010_pso.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_1a7a790c-2e56-4b7c-a7ed-6dadbba89678/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1a7a790c-2e56-4b7c-a7ed-6dadbba89678/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1a7a790c-2e56-4b7c-a7ed-6dadbba89678/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1a7a790c-2e56-4b7c-a7ed-6dadbba89678/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe010_pso.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_1a7a790c-2e56-4b7c-a7ed-6dadbba89678/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1a7a790c-2e56-4b7c-a7ed-6dadbba89678/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 6f5ae702128f84b20d08e8523b7c9183613a7383 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 17:21:55,831 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 17:21:55,832 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 17:21:55,838 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 17:21:55,838 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 17:21:55,839 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 17:21:55,840 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 17:21:55,841 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 17:21:55,841 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 17:21:55,842 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 17:21:55,842 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 17:21:55,842 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 17:21:55,843 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 17:21:55,843 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 17:21:55,844 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 17:21:55,844 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 17:21:55,845 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 17:21:55,845 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 17:21:55,846 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 17:21:55,847 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 17:21:55,848 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 17:21:55,848 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 17:21:55,849 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 17:21:55,849 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 17:21:55,850 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 17:21:55,850 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 17:21:55,850 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 17:21:55,851 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 17:21:55,851 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 17:21:55,852 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 17:21:55,852 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 17:21:55,852 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 17:21:55,852 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 17:21:55,852 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 17:21:55,853 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 17:21:55,853 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 17:21:55,853 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1a7a790c-2e56-4b7c-a7ed-6dadbba89678/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 17:21:55,860 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 17:21:55,861 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 17:21:55,861 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 17:21:55,861 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 17:21:55,861 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 17:21:55,861 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 17:21:55,861 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 17:21:55,862 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 17:21:55,862 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 17:21:55,862 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 17:21:55,862 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 17:21:55,862 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 17:21:55,862 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 17:21:55,862 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 17:21:55,862 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 17:21:55,862 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 17:21:55,862 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 17:21:55,863 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 17:21:55,863 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 17:21:55,863 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 17:21:55,863 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 17:21:55,863 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 17:21:55,863 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 17:21:55,863 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 17:21:55,863 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 17:21:55,863 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 17:21:55,863 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 17:21:55,863 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 17:21:55,863 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 17:21:55,863 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 17:21:55,864 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 17:21:55,864 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 17:21:55,864 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 17:21:55,864 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 17:21:55,864 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 17:21:55,864 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 17:21:55,864 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_1a7a790c-2e56-4b7c-a7ed-6dadbba89678/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 -> 6f5ae702128f84b20d08e8523b7c9183613a7383 [2018-12-02 17:21:55,881 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 17:21:55,887 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 17:21:55,889 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 17:21:55,890 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 17:21:55,890 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 17:21:55,891 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1a7a790c-2e56-4b7c-a7ed-6dadbba89678/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/safe010_pso.oepc_false-unreach-call.i [2018-12-02 17:21:55,925 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1a7a790c-2e56-4b7c-a7ed-6dadbba89678/bin-2019/utaipan/data/0d1118dce/adfa8c614ca449e79a34c4600649421d/FLAG737079329 [2018-12-02 17:21:56,441 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 17:21:56,441 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1a7a790c-2e56-4b7c-a7ed-6dadbba89678/sv-benchmarks/c/pthread-wmm/safe010_pso.oepc_false-unreach-call.i [2018-12-02 17:21:56,448 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1a7a790c-2e56-4b7c-a7ed-6dadbba89678/bin-2019/utaipan/data/0d1118dce/adfa8c614ca449e79a34c4600649421d/FLAG737079329 [2018-12-02 17:21:56,909 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1a7a790c-2e56-4b7c-a7ed-6dadbba89678/bin-2019/utaipan/data/0d1118dce/adfa8c614ca449e79a34c4600649421d [2018-12-02 17:21:56,911 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 17:21:56,912 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 17:21:56,913 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 17:21:56,913 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 17:21:56,915 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 17:21:56,915 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:21:56" (1/1) ... [2018-12-02 17:21:56,917 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e282df7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:21:56, skipping insertion in model container [2018-12-02 17:21:56,917 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:21:56" (1/1) ... [2018-12-02 17:21:56,921 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 17:21:56,948 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 17:21:57,128 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 17:21:57,135 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 17:21:57,220 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 17:21:57,265 INFO L195 MainTranslator]: Completed translation [2018-12-02 17:21:57,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:21:57 WrapperNode [2018-12-02 17:21:57,265 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 17:21:57,266 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 17:21:57,266 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 17:21:57,266 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 17:21:57,272 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:21:57" (1/1) ... [2018-12-02 17:21:57,285 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:21:57" (1/1) ... [2018-12-02 17:21:57,308 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 17:21:57,308 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 17:21:57,308 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 17:21:57,308 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 17:21:57,317 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:21:57" (1/1) ... [2018-12-02 17:21:57,317 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:21:57" (1/1) ... [2018-12-02 17:21:57,320 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:21:57" (1/1) ... [2018-12-02 17:21:57,321 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:21:57" (1/1) ... [2018-12-02 17:21:57,329 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:21:57" (1/1) ... [2018-12-02 17:21:57,332 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:21:57" (1/1) ... [2018-12-02 17:21:57,334 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:21:57" (1/1) ... [2018-12-02 17:21:57,337 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 17:21:57,338 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 17:21:57,338 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 17:21:57,338 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 17:21:57,339 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:21:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1a7a790c-2e56-4b7c-a7ed-6dadbba89678/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 17:21:57,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 17:21:57,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 17:21:57,374 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 17:21:57,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 17:21:57,374 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 17:21:57,374 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 17:21:57,374 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 17:21:57,375 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 17:21:57,375 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 17:21:57,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 17:21:57,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 17:21:57,376 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 17:21:57,670 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 17:21:57,670 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 17:21:57,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:21:57 BoogieIcfgContainer [2018-12-02 17:21:57,671 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 17:21:57,671 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 17:21:57,672 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 17:21:57,674 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 17:21:57,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 05:21:56" (1/3) ... [2018-12-02 17:21:57,675 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5949b26f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:21:57, skipping insertion in model container [2018-12-02 17:21:57,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:21:57" (2/3) ... [2018-12-02 17:21:57,676 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5949b26f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:21:57, skipping insertion in model container [2018-12-02 17:21:57,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:21:57" (3/3) ... [2018-12-02 17:21:57,677 INFO L112 eAbstractionObserver]: Analyzing ICFG safe010_pso.oepc_false-unreach-call.i [2018-12-02 17:21:57,706 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,707 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,707 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,707 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,707 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,707 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,707 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,708 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,708 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,708 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,708 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,708 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,708 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,709 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,709 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,709 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,709 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,709 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,709 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,709 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,710 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,710 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,710 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,710 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,710 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,710 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,710 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,711 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,711 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,711 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,711 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,711 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,711 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,711 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,712 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,712 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,712 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,712 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,712 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,713 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,713 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,713 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,713 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,713 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,713 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,713 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,714 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,714 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,714 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,714 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,714 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,714 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,714 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,714 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,715 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,715 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,715 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,715 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,715 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,715 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,716 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,716 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,716 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,716 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,716 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,716 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,717 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,717 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,717 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,717 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,717 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,717 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:21:57,725 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 17:21:57,725 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 17:21:57,732 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 17:21:57,745 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 17:21:57,762 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 17:21:57,763 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 17:21:57,763 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 17:21:57,763 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 17:21:57,763 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 17:21:57,763 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 17:21:57,763 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 17:21:57,763 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 17:21:57,771 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 141places, 179 transitions [2018-12-02 17:21:58,837 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25103 states. [2018-12-02 17:21:58,838 INFO L276 IsEmpty]: Start isEmpty. Operand 25103 states. [2018-12-02 17:21:58,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-02 17:21:58,843 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:21:58,843 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] [2018-12-02 17:21:58,845 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:21:58,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:21:58,848 INFO L82 PathProgramCache]: Analyzing trace with hash -969782754, now seen corresponding path program 1 times [2018-12-02 17:21:58,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:21:58,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:21:58,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:21:58,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:21:58,884 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:21:58,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:21:58,992 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 17:21:58,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:21:58,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:21:58,994 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:21:58,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:21:59,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:21:59,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:21:59,013 INFO L87 Difference]: Start difference. First operand 25103 states. Second operand 4 states. [2018-12-02 17:21:59,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:21:59,366 INFO L93 Difference]: Finished difference Result 45395 states and 177649 transitions. [2018-12-02 17:21:59,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:21:59,367 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-12-02 17:21:59,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:21:59,504 INFO L225 Difference]: With dead ends: 45395 [2018-12-02 17:21:59,505 INFO L226 Difference]: Without dead ends: 40635 [2018-12-02 17:21:59,506 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 17:21:59,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40635 states. [2018-12-02 17:22:00,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40635 to 23669. [2018-12-02 17:22:00,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23669 states. [2018-12-02 17:22:00,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23669 states to 23669 states and 92566 transitions. [2018-12-02 17:22:00,262 INFO L78 Accepts]: Start accepts. Automaton has 23669 states and 92566 transitions. Word has length 32 [2018-12-02 17:22:00,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:22:00,262 INFO L480 AbstractCegarLoop]: Abstraction has 23669 states and 92566 transitions. [2018-12-02 17:22:00,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:22:00,262 INFO L276 IsEmpty]: Start isEmpty. Operand 23669 states and 92566 transitions. [2018-12-02 17:22:00,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-02 17:22:00,265 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:22:00,265 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:22:00,265 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:22:00,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:22:00,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1661840205, now seen corresponding path program 1 times [2018-12-02 17:22:00,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:22:00,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:22:00,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:22:00,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:22:00,268 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:22:00,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:22:00,315 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 17:22:00,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:22:00,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 17:22:00,315 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:22:00,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 17:22:00,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 17:22:00,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:22:00,317 INFO L87 Difference]: Start difference. First operand 23669 states and 92566 transitions. Second operand 5 states. [2018-12-02 17:22:00,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:22:00,924 INFO L93 Difference]: Finished difference Result 64837 states and 241396 transitions. [2018-12-02 17:22:00,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 17:22:00,925 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-12-02 17:22:00,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:22:01,065 INFO L225 Difference]: With dead ends: 64837 [2018-12-02 17:22:01,065 INFO L226 Difference]: Without dead ends: 64677 [2018-12-02 17:22:01,065 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 17:22:01,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64677 states. [2018-12-02 17:22:01,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64677 to 37149. [2018-12-02 17:22:01,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37149 states. [2018-12-02 17:22:01,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37149 states to 37149 states and 138311 transitions. [2018-12-02 17:22:01,854 INFO L78 Accepts]: Start accepts. Automaton has 37149 states and 138311 transitions. Word has length 43 [2018-12-02 17:22:01,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:22:01,855 INFO L480 AbstractCegarLoop]: Abstraction has 37149 states and 138311 transitions. [2018-12-02 17:22:01,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 17:22:01,856 INFO L276 IsEmpty]: Start isEmpty. Operand 37149 states and 138311 transitions. [2018-12-02 17:22:01,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-02 17:22:01,858 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:22:01,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] [2018-12-02 17:22:01,858 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:22:01,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:22:01,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1508943518, now seen corresponding path program 1 times [2018-12-02 17:22:01,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:22:01,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:22:01,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:22:01,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:22:01,861 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:22:01,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:22:01,902 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 17:22:01,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:22:01,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:22:01,902 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:22:01,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:22:01,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:22:01,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:22:01,903 INFO L87 Difference]: Start difference. First operand 37149 states and 138311 transitions. Second operand 4 states. [2018-12-02 17:22:01,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:22:01,953 INFO L93 Difference]: Finished difference Result 12371 states and 41204 transitions. [2018-12-02 17:22:01,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 17:22:01,953 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-12-02 17:22:01,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:22:01,972 INFO L225 Difference]: With dead ends: 12371 [2018-12-02 17:22:01,973 INFO L226 Difference]: Without dead ends: 11850 [2018-12-02 17:22:01,973 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 17:22:02,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11850 states. [2018-12-02 17:22:02,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11850 to 11850. [2018-12-02 17:22:02,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11850 states. [2018-12-02 17:22:02,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11850 states to 11850 states and 39649 transitions. [2018-12-02 17:22:02,105 INFO L78 Accepts]: Start accepts. Automaton has 11850 states and 39649 transitions. Word has length 44 [2018-12-02 17:22:02,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:22:02,105 INFO L480 AbstractCegarLoop]: Abstraction has 11850 states and 39649 transitions. [2018-12-02 17:22:02,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:22:02,105 INFO L276 IsEmpty]: Start isEmpty. Operand 11850 states and 39649 transitions. [2018-12-02 17:22:02,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-02 17:22:02,108 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:22:02,108 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] [2018-12-02 17:22:02,108 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:22:02,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:22:02,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1699267050, now seen corresponding path program 1 times [2018-12-02 17:22:02,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:22:02,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:22:02,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:22:02,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:22:02,110 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:22:02,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:22:02,166 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 17:22:02,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:22:02,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:22:02,166 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:22:02,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:22:02,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:22:02,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:22:02,167 INFO L87 Difference]: Start difference. First operand 11850 states and 39649 transitions. Second operand 4 states. [2018-12-02 17:22:02,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:22:02,323 INFO L93 Difference]: Finished difference Result 17026 states and 55724 transitions. [2018-12-02 17:22:02,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 17:22:02,323 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2018-12-02 17:22:02,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:22:02,344 INFO L225 Difference]: With dead ends: 17026 [2018-12-02 17:22:02,344 INFO L226 Difference]: Without dead ends: 17026 [2018-12-02 17:22:02,344 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 17:22:02,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17026 states. [2018-12-02 17:22:02,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17026 to 12886. [2018-12-02 17:22:02,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12886 states. [2018-12-02 17:22:02,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12886 states to 12886 states and 42751 transitions. [2018-12-02 17:22:02,515 INFO L78 Accepts]: Start accepts. Automaton has 12886 states and 42751 transitions. Word has length 57 [2018-12-02 17:22:02,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:22:02,516 INFO L480 AbstractCegarLoop]: Abstraction has 12886 states and 42751 transitions. [2018-12-02 17:22:02,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:22:02,516 INFO L276 IsEmpty]: Start isEmpty. Operand 12886 states and 42751 transitions. [2018-12-02 17:22:02,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-02 17:22:02,520 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:22:02,520 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] [2018-12-02 17:22:02,520 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:22:02,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:22:02,521 INFO L82 PathProgramCache]: Analyzing trace with hash -852889911, now seen corresponding path program 1 times [2018-12-02 17:22:02,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:22:02,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:22:02,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:22:02,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:22:02,522 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:22:02,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:22:02,577 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 17:22:02,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:22:02,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:22:02,578 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:22:02,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:22:02,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:22:02,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:22:02,578 INFO L87 Difference]: Start difference. First operand 12886 states and 42751 transitions. Second operand 4 states. [2018-12-02 17:22:02,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:22:02,992 INFO L93 Difference]: Finished difference Result 18381 states and 60008 transitions. [2018-12-02 17:22:02,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 17:22:02,992 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2018-12-02 17:22:02,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:22:03,016 INFO L225 Difference]: With dead ends: 18381 [2018-12-02 17:22:03,017 INFO L226 Difference]: Without dead ends: 18381 [2018-12-02 17:22:03,017 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 17:22:03,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18381 states. [2018-12-02 17:22:03,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18381 to 16342. [2018-12-02 17:22:03,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16342 states. [2018-12-02 17:22:03,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16342 states to 16342 states and 53833 transitions. [2018-12-02 17:22:03,282 INFO L78 Accepts]: Start accepts. Automaton has 16342 states and 53833 transitions. Word has length 57 [2018-12-02 17:22:03,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:22:03,282 INFO L480 AbstractCegarLoop]: Abstraction has 16342 states and 53833 transitions. [2018-12-02 17:22:03,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:22:03,283 INFO L276 IsEmpty]: Start isEmpty. Operand 16342 states and 53833 transitions. [2018-12-02 17:22:03,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-02 17:22:03,286 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:22:03,286 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] [2018-12-02 17:22:03,287 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:22:03,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:22:03,287 INFO L82 PathProgramCache]: Analyzing trace with hash 500419786, now seen corresponding path program 1 times [2018-12-02 17:22:03,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:22:03,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:22:03,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:22:03,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:22:03,289 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:22:03,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:22:03,361 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 17:22:03,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:22:03,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 17:22:03,362 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:22:03,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 17:22:03,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 17:22:03,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 17:22:03,362 INFO L87 Difference]: Start difference. First operand 16342 states and 53833 transitions. Second operand 6 states. [2018-12-02 17:22:03,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:22:03,666 INFO L93 Difference]: Finished difference Result 24888 states and 80174 transitions. [2018-12-02 17:22:03,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 17:22:03,667 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2018-12-02 17:22:03,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:22:03,698 INFO L225 Difference]: With dead ends: 24888 [2018-12-02 17:22:03,698 INFO L226 Difference]: Without dead ends: 24888 [2018-12-02 17:22:03,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-02 17:22:03,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24888 states. [2018-12-02 17:22:03,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24888 to 16252. [2018-12-02 17:22:03,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16252 states. [2018-12-02 17:22:03,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16252 states to 16252 states and 52196 transitions. [2018-12-02 17:22:03,929 INFO L78 Accepts]: Start accepts. Automaton has 16252 states and 52196 transitions. Word has length 57 [2018-12-02 17:22:03,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:22:03,929 INFO L480 AbstractCegarLoop]: Abstraction has 16252 states and 52196 transitions. [2018-12-02 17:22:03,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 17:22:03,929 INFO L276 IsEmpty]: Start isEmpty. Operand 16252 states and 52196 transitions. [2018-12-02 17:22:03,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-02 17:22:03,932 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:22:03,932 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] [2018-12-02 17:22:03,932 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:22:03,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:22:03,932 INFO L82 PathProgramCache]: Analyzing trace with hash 207016779, now seen corresponding path program 1 times [2018-12-02 17:22:03,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:22:03,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:22:03,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:22:03,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:22:03,934 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:22:03,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:22:03,969 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 17:22:03,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:22:03,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 17:22:03,969 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:22:03,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 17:22:03,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 17:22:03,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:22:03,970 INFO L87 Difference]: Start difference. First operand 16252 states and 52196 transitions. Second operand 5 states. [2018-12-02 17:22:03,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:22:03,998 INFO L93 Difference]: Finished difference Result 2696 states and 7013 transitions. [2018-12-02 17:22:03,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 17:22:03,999 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2018-12-02 17:22:03,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:22:04,001 INFO L225 Difference]: With dead ends: 2696 [2018-12-02 17:22:04,001 INFO L226 Difference]: Without dead ends: 2224 [2018-12-02 17:22:04,001 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 17:22:04,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2224 states. [2018-12-02 17:22:04,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2224 to 2150. [2018-12-02 17:22:04,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2150 states. [2018-12-02 17:22:04,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2150 states to 2150 states and 5587 transitions. [2018-12-02 17:22:04,017 INFO L78 Accepts]: Start accepts. Automaton has 2150 states and 5587 transitions. Word has length 57 [2018-12-02 17:22:04,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:22:04,017 INFO L480 AbstractCegarLoop]: Abstraction has 2150 states and 5587 transitions. [2018-12-02 17:22:04,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 17:22:04,018 INFO L276 IsEmpty]: Start isEmpty. Operand 2150 states and 5587 transitions. [2018-12-02 17:22:04,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-02 17:22:04,019 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:22:04,020 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] [2018-12-02 17:22:04,020 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:22:04,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:22:04,020 INFO L82 PathProgramCache]: Analyzing trace with hash 954620282, now seen corresponding path program 1 times [2018-12-02 17:22:04,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:22:04,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:22:04,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:22:04,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:22:04,021 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:22:04,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:22:04,059 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 17:22:04,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:22:04,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:22:04,059 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:22:04,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:22:04,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:22:04,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:22:04,060 INFO L87 Difference]: Start difference. First operand 2150 states and 5587 transitions. Second operand 4 states. [2018-12-02 17:22:04,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:22:04,146 INFO L93 Difference]: Finished difference Result 3137 states and 7854 transitions. [2018-12-02 17:22:04,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 17:22:04,146 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-02 17:22:04,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:22:04,148 INFO L225 Difference]: With dead ends: 3137 [2018-12-02 17:22:04,148 INFO L226 Difference]: Without dead ends: 3137 [2018-12-02 17:22:04,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:22:04,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3137 states. [2018-12-02 17:22:04,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3137 to 2234. [2018-12-02 17:22:04,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2234 states. [2018-12-02 17:22:04,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2234 states to 2234 states and 5761 transitions. [2018-12-02 17:22:04,167 INFO L78 Accepts]: Start accepts. Automaton has 2234 states and 5761 transitions. Word has length 92 [2018-12-02 17:22:04,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:22:04,167 INFO L480 AbstractCegarLoop]: Abstraction has 2234 states and 5761 transitions. [2018-12-02 17:22:04,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:22:04,168 INFO L276 IsEmpty]: Start isEmpty. Operand 2234 states and 5761 transitions. [2018-12-02 17:22:04,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-02 17:22:04,169 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:22:04,169 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:22:04,170 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:22:04,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:22:04,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1216977146, now seen corresponding path program 1 times [2018-12-02 17:22:04,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:22:04,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:22:04,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:22:04,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:22:04,171 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:22:04,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:22:04,247 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 17:22:04,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:22:04,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 17:22:04,248 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:22:04,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 17:22:04,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 17:22:04,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 17:22:04,248 INFO L87 Difference]: Start difference. First operand 2234 states and 5761 transitions. Second operand 7 states. [2018-12-02 17:22:04,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:22:04,509 INFO L93 Difference]: Finished difference Result 2573 states and 6551 transitions. [2018-12-02 17:22:04,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 17:22:04,510 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2018-12-02 17:22:04,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:22:04,511 INFO L225 Difference]: With dead ends: 2573 [2018-12-02 17:22:04,511 INFO L226 Difference]: Without dead ends: 2573 [2018-12-02 17:22:04,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 17:22:04,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2573 states. [2018-12-02 17:22:04,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2573 to 2259. [2018-12-02 17:22:04,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2259 states. [2018-12-02 17:22:04,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2259 states to 2259 states and 5813 transitions. [2018-12-02 17:22:04,528 INFO L78 Accepts]: Start accepts. Automaton has 2259 states and 5813 transitions. Word has length 92 [2018-12-02 17:22:04,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:22:04,528 INFO L480 AbstractCegarLoop]: Abstraction has 2259 states and 5813 transitions. [2018-12-02 17:22:04,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 17:22:04,528 INFO L276 IsEmpty]: Start isEmpty. Operand 2259 states and 5813 transitions. [2018-12-02 17:22:04,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-02 17:22:04,530 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:22:04,530 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] [2018-12-02 17:22:04,530 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:22:04,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:22:04,530 INFO L82 PathProgramCache]: Analyzing trace with hash 2107041662, now seen corresponding path program 1 times [2018-12-02 17:22:04,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:22:04,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:22:04,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:22:04,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:22:04,531 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:22:04,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:22:04,566 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 17:22:04,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:22:04,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:22:04,566 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:22:04,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:22:04,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:22:04,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:22:04,567 INFO L87 Difference]: Start difference. First operand 2259 states and 5813 transitions. Second operand 4 states. [2018-12-02 17:22:04,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:22:04,631 INFO L93 Difference]: Finished difference Result 2866 states and 7203 transitions. [2018-12-02 17:22:04,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:22:04,631 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-02 17:22:04,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:22:04,633 INFO L225 Difference]: With dead ends: 2866 [2018-12-02 17:22:04,633 INFO L226 Difference]: Without dead ends: 2866 [2018-12-02 17:22:04,634 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 17:22:04,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2866 states. [2018-12-02 17:22:04,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2866 to 2313. [2018-12-02 17:22:04,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2313 states. [2018-12-02 17:22:04,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 2313 states and 5941 transitions. [2018-12-02 17:22:04,652 INFO L78 Accepts]: Start accepts. Automaton has 2313 states and 5941 transitions. Word has length 92 [2018-12-02 17:22:04,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:22:04,652 INFO L480 AbstractCegarLoop]: Abstraction has 2313 states and 5941 transitions. [2018-12-02 17:22:04,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:22:04,653 INFO L276 IsEmpty]: Start isEmpty. Operand 2313 states and 5941 transitions. [2018-12-02 17:22:04,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-02 17:22:04,655 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:22:04,655 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:22:04,655 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:22:04,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:22:04,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1113762732, now seen corresponding path program 1 times [2018-12-02 17:22:04,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:22:04,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:22:04,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:22:04,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:22:04,656 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:22:04,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:22:04,729 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 17:22:04,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:22:04,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 17:22:04,729 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:22:04,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 17:22:04,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 17:22:04,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 17:22:04,730 INFO L87 Difference]: Start difference. First operand 2313 states and 5941 transitions. Second operand 6 states. [2018-12-02 17:22:04,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:22:04,874 INFO L93 Difference]: Finished difference Result 2610 states and 6569 transitions. [2018-12-02 17:22:04,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 17:22:04,874 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2018-12-02 17:22:04,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:22:04,877 INFO L225 Difference]: With dead ends: 2610 [2018-12-02 17:22:04,877 INFO L226 Difference]: Without dead ends: 2610 [2018-12-02 17:22:04,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-12-02 17:22:04,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2610 states. [2018-12-02 17:22:04,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2610 to 2090. [2018-12-02 17:22:04,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2090 states. [2018-12-02 17:22:04,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 2090 states and 5399 transitions. [2018-12-02 17:22:04,901 INFO L78 Accepts]: Start accepts. Automaton has 2090 states and 5399 transitions. Word has length 92 [2018-12-02 17:22:04,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:22:04,901 INFO L480 AbstractCegarLoop]: Abstraction has 2090 states and 5399 transitions. [2018-12-02 17:22:04,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 17:22:04,901 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 5399 transitions. [2018-12-02 17:22:04,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-02 17:22:04,904 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:22:04,904 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] [2018-12-02 17:22:04,904 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:22:04,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:22:04,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1438573394, now seen corresponding path program 1 times [2018-12-02 17:22:04,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:22:04,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:22:04,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:22:04,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:22:04,906 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:22:04,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:22:05,004 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 17:22:05,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:22:05,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:22:05,005 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:22:05,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:22:05,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:22:05,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:22:05,005 INFO L87 Difference]: Start difference. First operand 2090 states and 5399 transitions. Second operand 4 states. [2018-12-02 17:22:05,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:22:05,077 INFO L93 Difference]: Finished difference Result 2426 states and 6319 transitions. [2018-12-02 17:22:05,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:22:05,077 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-02 17:22:05,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:22:05,079 INFO L225 Difference]: With dead ends: 2426 [2018-12-02 17:22:05,079 INFO L226 Difference]: Without dead ends: 2426 [2018-12-02 17:22:05,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:22:05,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2426 states. [2018-12-02 17:22:05,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2426 to 2394. [2018-12-02 17:22:05,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2394 states. [2018-12-02 17:22:05,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2394 states to 2394 states and 6239 transitions. [2018-12-02 17:22:05,094 INFO L78 Accepts]: Start accepts. Automaton has 2394 states and 6239 transitions. Word has length 92 [2018-12-02 17:22:05,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:22:05,095 INFO L480 AbstractCegarLoop]: Abstraction has 2394 states and 6239 transitions. [2018-12-02 17:22:05,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:22:05,095 INFO L276 IsEmpty]: Start isEmpty. Operand 2394 states and 6239 transitions. [2018-12-02 17:22:05,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-02 17:22:05,097 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:22:05,097 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] [2018-12-02 17:22:05,097 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:22:05,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:22:05,097 INFO L82 PathProgramCache]: Analyzing trace with hash -638635949, now seen corresponding path program 1 times [2018-12-02 17:22:05,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:22:05,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:22:05,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:22:05,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:22:05,098 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:22:05,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:22:05,170 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 17:22:05,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:22:05,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 17:22:05,170 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:22:05,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 17:22:05,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 17:22:05,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-02 17:22:05,171 INFO L87 Difference]: Start difference. First operand 2394 states and 6239 transitions. Second operand 8 states. [2018-12-02 17:22:05,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:22:05,443 INFO L93 Difference]: Finished difference Result 3803 states and 9763 transitions. [2018-12-02 17:22:05,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 17:22:05,443 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 92 [2018-12-02 17:22:05,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:22:05,446 INFO L225 Difference]: With dead ends: 3803 [2018-12-02 17:22:05,446 INFO L226 Difference]: Without dead ends: 3771 [2018-12-02 17:22:05,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-12-02 17:22:05,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3771 states. [2018-12-02 17:22:05,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3771 to 3218. [2018-12-02 17:22:05,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3218 states. [2018-12-02 17:22:05,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3218 states to 3218 states and 8332 transitions. [2018-12-02 17:22:05,470 INFO L78 Accepts]: Start accepts. Automaton has 3218 states and 8332 transitions. Word has length 92 [2018-12-02 17:22:05,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:22:05,471 INFO L480 AbstractCegarLoop]: Abstraction has 3218 states and 8332 transitions. [2018-12-02 17:22:05,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 17:22:05,471 INFO L276 IsEmpty]: Start isEmpty. Operand 3218 states and 8332 transitions. [2018-12-02 17:22:05,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-02 17:22:05,473 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:22:05,473 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:22:05,473 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:22:05,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:22:05,473 INFO L82 PathProgramCache]: Analyzing trace with hash 322978068, now seen corresponding path program 1 times [2018-12-02 17:22:05,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:22:05,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:22:05,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:22:05,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:22:05,475 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:22:05,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:22:05,525 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 17:22:05,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:22:05,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 17:22:05,525 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:22:05,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 17:22:05,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 17:22:05,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 17:22:05,525 INFO L87 Difference]: Start difference. First operand 3218 states and 8332 transitions. Second operand 7 states. [2018-12-02 17:22:05,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:22:05,765 INFO L93 Difference]: Finished difference Result 4294 states and 11046 transitions. [2018-12-02 17:22:05,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 17:22:05,765 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2018-12-02 17:22:05,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:22:05,768 INFO L225 Difference]: With dead ends: 4294 [2018-12-02 17:22:05,768 INFO L226 Difference]: Without dead ends: 4294 [2018-12-02 17:22:05,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-12-02 17:22:05,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4294 states. [2018-12-02 17:22:05,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4294 to 3682. [2018-12-02 17:22:05,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3682 states. [2018-12-02 17:22:05,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3682 states to 3682 states and 9574 transitions. [2018-12-02 17:22:05,795 INFO L78 Accepts]: Start accepts. Automaton has 3682 states and 9574 transitions. Word has length 92 [2018-12-02 17:22:05,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:22:05,795 INFO L480 AbstractCegarLoop]: Abstraction has 3682 states and 9574 transitions. [2018-12-02 17:22:05,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 17:22:05,795 INFO L276 IsEmpty]: Start isEmpty. Operand 3682 states and 9574 transitions. [2018-12-02 17:22:05,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-02 17:22:05,798 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:22:05,798 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] [2018-12-02 17:22:05,798 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:22:05,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:22:05,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1567742549, now seen corresponding path program 1 times [2018-12-02 17:22:05,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:22:05,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:22:05,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:22:05,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:22:05,799 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:22:05,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:22:05,862 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 17:22:05,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:22:05,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 17:22:05,862 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:22:05,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 17:22:05,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 17:22:05,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:22:05,863 INFO L87 Difference]: Start difference. First operand 3682 states and 9574 transitions. Second operand 5 states. [2018-12-02 17:22:05,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:22:05,889 INFO L93 Difference]: Finished difference Result 5498 states and 14496 transitions. [2018-12-02 17:22:05,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 17:22:05,889 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2018-12-02 17:22:05,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:22:05,894 INFO L225 Difference]: With dead ends: 5498 [2018-12-02 17:22:05,894 INFO L226 Difference]: Without dead ends: 5498 [2018-12-02 17:22:05,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 17:22:05,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5498 states. [2018-12-02 17:22:05,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5498 to 3248. [2018-12-02 17:22:05,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3248 states. [2018-12-02 17:22:05,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3248 states to 3248 states and 8414 transitions. [2018-12-02 17:22:05,928 INFO L78 Accepts]: Start accepts. Automaton has 3248 states and 8414 transitions. Word has length 92 [2018-12-02 17:22:05,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:22:05,928 INFO L480 AbstractCegarLoop]: Abstraction has 3248 states and 8414 transitions. [2018-12-02 17:22:05,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 17:22:05,928 INFO L276 IsEmpty]: Start isEmpty. Operand 3248 states and 8414 transitions. [2018-12-02 17:22:05,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-02 17:22:05,931 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:22:05,931 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:22:05,931 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:22:05,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:22:05,932 INFO L82 PathProgramCache]: Analyzing trace with hash 2048458965, now seen corresponding path program 1 times [2018-12-02 17:22:05,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:22:05,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:22:05,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:22:05,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:22:05,933 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:22:05,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:22:05,999 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 17:22:06,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:22:06,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 17:22:06,000 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:22:06,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 17:22:06,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 17:22:06,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 17:22:06,001 INFO L87 Difference]: Start difference. First operand 3248 states and 8414 transitions. Second operand 6 states. [2018-12-02 17:22:06,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:22:06,096 INFO L93 Difference]: Finished difference Result 2688 states and 6758 transitions. [2018-12-02 17:22:06,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 17:22:06,096 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2018-12-02 17:22:06,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:22:06,098 INFO L225 Difference]: With dead ends: 2688 [2018-12-02 17:22:06,098 INFO L226 Difference]: Without dead ends: 2688 [2018-12-02 17:22:06,098 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 17:22:06,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2688 states. [2018-12-02 17:22:06,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2688 to 2009. [2018-12-02 17:22:06,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2009 states. [2018-12-02 17:22:06,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2009 states to 2009 states and 5175 transitions. [2018-12-02 17:22:06,113 INFO L78 Accepts]: Start accepts. Automaton has 2009 states and 5175 transitions. Word has length 92 [2018-12-02 17:22:06,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:22:06,113 INFO L480 AbstractCegarLoop]: Abstraction has 2009 states and 5175 transitions. [2018-12-02 17:22:06,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 17:22:06,113 INFO L276 IsEmpty]: Start isEmpty. Operand 2009 states and 5175 transitions. [2018-12-02 17:22:06,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 17:22:06,115 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:22:06,115 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] [2018-12-02 17:22:06,115 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:22:06,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:22:06,115 INFO L82 PathProgramCache]: Analyzing trace with hash -157816760, now seen corresponding path program 1 times [2018-12-02 17:22:06,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:22:06,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:22:06,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:22:06,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:22:06,117 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:22:06,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:22:06,160 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 17:22:06,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:22:06,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 17:22:06,161 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:22:06,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 17:22:06,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 17:22:06,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 17:22:06,161 INFO L87 Difference]: Start difference. First operand 2009 states and 5175 transitions. Second operand 7 states. [2018-12-02 17:22:06,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:22:06,417 INFO L93 Difference]: Finished difference Result 3075 states and 7636 transitions. [2018-12-02 17:22:06,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 17:22:06,417 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-02 17:22:06,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:22:06,419 INFO L225 Difference]: With dead ends: 3075 [2018-12-02 17:22:06,420 INFO L226 Difference]: Without dead ends: 3075 [2018-12-02 17:22:06,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-02 17:22:06,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3075 states. [2018-12-02 17:22:06,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3075 to 2309. [2018-12-02 17:22:06,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2309 states. [2018-12-02 17:22:06,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2309 states to 2309 states and 5922 transitions. [2018-12-02 17:22:06,437 INFO L78 Accepts]: Start accepts. Automaton has 2309 states and 5922 transitions. Word has length 94 [2018-12-02 17:22:06,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:22:06,437 INFO L480 AbstractCegarLoop]: Abstraction has 2309 states and 5922 transitions. [2018-12-02 17:22:06,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 17:22:06,437 INFO L276 IsEmpty]: Start isEmpty. Operand 2309 states and 5922 transitions. [2018-12-02 17:22:06,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 17:22:06,439 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:22:06,439 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] [2018-12-02 17:22:06,439 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:22:06,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:22:06,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1086947721, now seen corresponding path program 1 times [2018-12-02 17:22:06,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:22:06,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:22:06,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:22:06,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:22:06,440 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:22:06,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:22:06,499 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 17:22:06,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:22:06,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 17:22:06,499 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:22:06,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 17:22:06,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 17:22:06,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 17:22:06,500 INFO L87 Difference]: Start difference. First operand 2309 states and 5922 transitions. Second operand 6 states. [2018-12-02 17:22:06,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:22:06,582 INFO L93 Difference]: Finished difference Result 2187 states and 5509 transitions. [2018-12-02 17:22:06,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 17:22:06,583 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-02 17:22:06,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:22:06,585 INFO L225 Difference]: With dead ends: 2187 [2018-12-02 17:22:06,585 INFO L226 Difference]: Without dead ends: 2187 [2018-12-02 17:22:06,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-02 17:22:06,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2187 states. [2018-12-02 17:22:06,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2187 to 2007. [2018-12-02 17:22:06,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2007 states. [2018-12-02 17:22:06,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2007 states to 2007 states and 5151 transitions. [2018-12-02 17:22:06,607 INFO L78 Accepts]: Start accepts. Automaton has 2007 states and 5151 transitions. Word has length 94 [2018-12-02 17:22:06,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:22:06,607 INFO L480 AbstractCegarLoop]: Abstraction has 2007 states and 5151 transitions. [2018-12-02 17:22:06,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 17:22:06,607 INFO L276 IsEmpty]: Start isEmpty. Operand 2007 states and 5151 transitions. [2018-12-02 17:22:06,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 17:22:06,610 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:22:06,610 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:22:06,610 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:22:06,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:22:06,610 INFO L82 PathProgramCache]: Analyzing trace with hash 171949001, now seen corresponding path program 1 times [2018-12-02 17:22:06,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:22:06,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:22:06,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:22:06,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:22:06,612 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:22:06,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:22:06,658 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 17:22:06,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:22:06,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 17:22:06,658 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:22:06,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 17:22:06,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 17:22:06,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:22:06,659 INFO L87 Difference]: Start difference. First operand 2007 states and 5151 transitions. Second operand 5 states. [2018-12-02 17:22:06,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:22:06,767 INFO L93 Difference]: Finished difference Result 2327 states and 5951 transitions. [2018-12-02 17:22:06,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 17:22:06,767 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-02 17:22:06,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:22:06,769 INFO L225 Difference]: With dead ends: 2327 [2018-12-02 17:22:06,769 INFO L226 Difference]: Without dead ends: 2327 [2018-12-02 17:22:06,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 17:22:06,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2327 states. [2018-12-02 17:22:06,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2327 to 2055. [2018-12-02 17:22:06,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2055 states. [2018-12-02 17:22:06,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2055 states to 2055 states and 5271 transitions. [2018-12-02 17:22:06,784 INFO L78 Accepts]: Start accepts. Automaton has 2055 states and 5271 transitions. Word has length 94 [2018-12-02 17:22:06,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:22:06,784 INFO L480 AbstractCegarLoop]: Abstraction has 2055 states and 5271 transitions. [2018-12-02 17:22:06,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 17:22:06,784 INFO L276 IsEmpty]: Start isEmpty. Operand 2055 states and 5271 transitions. [2018-12-02 17:22:06,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 17:22:06,786 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:22:06,786 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] [2018-12-02 17:22:06,786 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:22:06,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:22:06,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1416713482, now seen corresponding path program 1 times [2018-12-02 17:22:06,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:22:06,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:22:06,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:22:06,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:22:06,788 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:22:06,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:22:06,878 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 17:22:06,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:22:06,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 17:22:06,878 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:22:06,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 17:22:06,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 17:22:06,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-02 17:22:06,879 INFO L87 Difference]: Start difference. First operand 2055 states and 5271 transitions. Second operand 12 states. [2018-12-02 17:22:07,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:22:07,262 INFO L93 Difference]: Finished difference Result 3825 states and 9938 transitions. [2018-12-02 17:22:07,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 17:22:07,262 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2018-12-02 17:22:07,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:22:07,265 INFO L225 Difference]: With dead ends: 3825 [2018-12-02 17:22:07,265 INFO L226 Difference]: Without dead ends: 2849 [2018-12-02 17:22:07,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-12-02 17:22:07,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2849 states. [2018-12-02 17:22:07,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2849 to 2573. [2018-12-02 17:22:07,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2573 states. [2018-12-02 17:22:07,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2573 states to 2573 states and 6497 transitions. [2018-12-02 17:22:07,283 INFO L78 Accepts]: Start accepts. Automaton has 2573 states and 6497 transitions. Word has length 94 [2018-12-02 17:22:07,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:22:07,284 INFO L480 AbstractCegarLoop]: Abstraction has 2573 states and 6497 transitions. [2018-12-02 17:22:07,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 17:22:07,284 INFO L276 IsEmpty]: Start isEmpty. Operand 2573 states and 6497 transitions. [2018-12-02 17:22:07,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 17:22:07,286 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:22:07,286 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] [2018-12-02 17:22:07,286 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:22:07,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:22:07,286 INFO L82 PathProgramCache]: Analyzing trace with hash 962397168, now seen corresponding path program 2 times [2018-12-02 17:22:07,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:22:07,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:22:07,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:22:07,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:22:07,288 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:22:07,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:22:07,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:22:07,327 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 17:22:07,396 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 17:22:07,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 05:22:07 BasicIcfg [2018-12-02 17:22:07,397 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 17:22:07,398 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 17:22:07,398 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 17:22:07,398 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 17:22:07,398 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:21:57" (3/4) ... [2018-12-02 17:22:07,400 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 17:22:07,466 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_1a7a790c-2e56-4b7c-a7ed-6dadbba89678/bin-2019/utaipan/witness.graphml [2018-12-02 17:22:07,466 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 17:22:07,466 INFO L168 Benchmark]: Toolchain (without parser) took 10554.81 ms. Allocated memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: 1.3 GB). Free memory was 945.9 MB in the beginning and 990.0 MB in the end (delta: -44.0 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2018-12-02 17:22:07,467 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 17:22:07,467 INFO L168 Benchmark]: CACSL2BoogieTranslator took 352.86 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 62.9 MB). Free memory was 945.9 MB in the beginning and 1.0 GB in the end (delta: -90.9 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2018-12-02 17:22:07,468 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. [2018-12-02 17:22:07,468 INFO L168 Benchmark]: Boogie Preprocessor took 29.28 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 17:22:07,468 INFO L168 Benchmark]: RCFGBuilder took 333.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 982.0 MB in the end (delta: 47.7 MB). Peak memory consumption was 47.7 MB. Max. memory is 11.5 GB. [2018-12-02 17:22:07,469 INFO L168 Benchmark]: TraceAbstraction took 9725.99 ms. Allocated memory was 1.1 GB in the beginning and 2.4 GB in the end (delta: 1.3 GB). Free memory was 982.0 MB in the beginning and 1.0 GB in the end (delta: -36.8 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2018-12-02 17:22:07,469 INFO L168 Benchmark]: Witness Printer took 68.12 ms. Allocated memory is still 2.4 GB. Free memory was 1.0 GB in the beginning and 990.0 MB in the end (delta: 28.8 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. [2018-12-02 17:22:07,471 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 352.86 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 62.9 MB). Free memory was 945.9 MB in the beginning and 1.0 GB in the end (delta: -90.9 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.28 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 333.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 982.0 MB in the end (delta: 47.7 MB). Peak memory consumption was 47.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9725.99 ms. Allocated memory was 1.1 GB in the beginning and 2.4 GB in the end (delta: 1.3 GB). Free memory was 982.0 MB in the beginning and 1.0 GB in the end (delta: -36.8 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 68.12 ms. Allocated memory is still 2.4 GB. Free memory was 1.0 GB in the beginning and 990.0 MB in the end (delta: 28.8 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L674] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L675] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L677] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L679] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L680] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L681] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L682] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L683] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L684] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L685] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L686] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L687] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L688] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L689] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L690] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L691] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L692] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L693] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L694] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L695] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L755] -1 pthread_t t2015; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L756] FCALL, FORK -1 pthread_create(&t2015, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] 0 y$w_buff1 = y$w_buff0 [L700] 0 y$w_buff0 = 2 [L701] 0 y$w_buff1_used = y$w_buff0_used [L702] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L704] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L705] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L706] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L707] 0 y$r_buff0_thd1 = (_Bool)1 [L710] 0 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L713] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] -1 pthread_t t2016; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L758] FCALL, FORK -1 pthread_create(&t2016, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L727] 1 __unbuffered_p1_EAX = x [L730] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L713] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L714] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L733] EXPR 1 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_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L733] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L733] EXPR 1 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_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L733] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L734] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L734] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L735] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L735] 1 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 [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L737] EXPR 1 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_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L737] 1 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 [L740] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L714] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L715] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L715] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L716] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L716] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L717] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L717] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L720] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L760] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] 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_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] 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_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] -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) [L765] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L766] 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_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L766] -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 [L767] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L767] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L768] 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_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L768] -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 [L771] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L772] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L773] -1 y$flush_delayed = weak$$choice2 [L774] -1 y$mem_tmp = y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] -1 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L776] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] -1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L777] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] -1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L778] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L778] -1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L779] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] -1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L780] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] -1 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L781] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] -1 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L782] -1 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L783] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L783] -1 y = y$flush_delayed ? y$mem_tmp : y [L784] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 179 locations, 3 error locations. UNSAFE Result, 9.6s OverallTime, 21 OverallIterations, 1 TraceHistogramMax, 4.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4658 SDtfs, 4308 SDslu, 10752 SDs, 0 SdLazy, 3972 SolverSat, 222 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 202 GetRequests, 56 SyntacticMatches, 17 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37149occurred in iteration=2, 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: 2.6s AutomataMinimizationTime, 20 MinimizatonAttempts, 67293 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1645 NumberOfCodeBlocks, 1645 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1531 ConstructedInterpolants, 0 QuantifiedInterpolants, 367014 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...