./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe034_rmo.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_ab0f6afc-2992-4a71-9a56-098e3c456789/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ab0f6afc-2992-4a71-9a56-098e3c456789/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ab0f6afc-2992-4a71-9a56-098e3c456789/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ab0f6afc-2992-4a71-9a56-098e3c456789/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe034_rmo.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ab0f6afc-2992-4a71-9a56-098e3c456789/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ab0f6afc-2992-4a71-9a56-098e3c456789/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 d093e8471a4be535d6456530b320065a9bf7dd1f .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 23:46:57,958 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 23:46:57,959 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 23:46:57,965 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 23:46:57,965 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 23:46:57,965 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 23:46:57,966 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 23:46:57,967 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 23:46:57,968 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 23:46:57,968 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 23:46:57,969 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 23:46:57,969 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 23:46:57,970 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 23:46:57,970 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 23:46:57,971 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 23:46:57,971 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 23:46:57,972 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 23:46:57,973 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 23:46:57,974 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 23:46:57,974 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 23:46:57,975 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 23:46:57,975 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 23:46:57,977 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 23:46:57,977 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 23:46:57,977 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 23:46:57,977 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 23:46:57,978 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 23:46:57,978 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 23:46:57,979 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 23:46:57,979 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 23:46:57,979 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 23:46:57,980 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 23:46:57,980 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 23:46:57,980 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 23:46:57,981 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 23:46:57,981 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 23:46:57,981 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ab0f6afc-2992-4a71-9a56-098e3c456789/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 23:46:57,988 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 23:46:57,988 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 23:46:57,989 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 23:46:57,989 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 23:46:57,989 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 23:46:57,989 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 23:46:57,989 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 23:46:57,989 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 23:46:57,990 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 23:46:57,990 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 23:46:57,990 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 23:46:57,990 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 23:46:57,990 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 23:46:57,990 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 23:46:57,991 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 23:46:57,991 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 23:46:57,991 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 23:46:57,991 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 23:46:57,991 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 23:46:57,991 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 23:46:57,991 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 23:46:57,991 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 23:46:57,991 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 23:46:57,992 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 23:46:57,992 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 23:46:57,992 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 23:46:57,992 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 23:46:57,992 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 23:46:57,992 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 23:46:57,992 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 23:46:57,992 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 23:46:57,993 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 23:46:57,993 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 23:46:57,993 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 23:46:57,993 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 23:46:57,993 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 23:46:57,993 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_ab0f6afc-2992-4a71-9a56-098e3c456789/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 -> d093e8471a4be535d6456530b320065a9bf7dd1f [2018-12-02 23:46:58,011 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 23:46:58,021 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 23:46:58,023 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 23:46:58,025 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 23:46:58,025 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 23:46:58,025 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ab0f6afc-2992-4a71-9a56-098e3c456789/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/safe034_rmo.oepc_false-unreach-call.i [2018-12-02 23:46:58,070 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ab0f6afc-2992-4a71-9a56-098e3c456789/bin-2019/utaipan/data/030adb72d/22ee505676eb49c9a456dd08bf612a12/FLAGa202df63f [2018-12-02 23:46:58,452 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 23:46:58,452 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ab0f6afc-2992-4a71-9a56-098e3c456789/sv-benchmarks/c/pthread-wmm/safe034_rmo.oepc_false-unreach-call.i [2018-12-02 23:46:58,459 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ab0f6afc-2992-4a71-9a56-098e3c456789/bin-2019/utaipan/data/030adb72d/22ee505676eb49c9a456dd08bf612a12/FLAGa202df63f [2018-12-02 23:46:58,467 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ab0f6afc-2992-4a71-9a56-098e3c456789/bin-2019/utaipan/data/030adb72d/22ee505676eb49c9a456dd08bf612a12 [2018-12-02 23:46:58,468 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 23:46:58,469 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 23:46:58,470 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 23:46:58,470 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 23:46:58,472 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 23:46:58,472 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:46:58" (1/1) ... [2018-12-02 23:46:58,474 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ca176b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:46:58, skipping insertion in model container [2018-12-02 23:46:58,474 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:46:58" (1/1) ... [2018-12-02 23:46:58,478 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 23:46:58,499 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 23:46:58,672 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 23:46:58,679 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 23:46:58,758 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 23:46:58,789 INFO L195 MainTranslator]: Completed translation [2018-12-02 23:46:58,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:46:58 WrapperNode [2018-12-02 23:46:58,789 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 23:46:58,790 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 23:46:58,790 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 23:46:58,790 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 23:46:58,795 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:46:58" (1/1) ... [2018-12-02 23:46:58,808 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:46:58" (1/1) ... [2018-12-02 23:46:58,829 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 23:46:58,830 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 23:46:58,830 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 23:46:58,830 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 23:46:58,836 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:46:58" (1/1) ... [2018-12-02 23:46:58,837 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:46:58" (1/1) ... [2018-12-02 23:46:58,840 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:46:58" (1/1) ... [2018-12-02 23:46:58,840 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:46:58" (1/1) ... [2018-12-02 23:46:58,848 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:46:58" (1/1) ... [2018-12-02 23:46:58,851 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:46:58" (1/1) ... [2018-12-02 23:46:58,853 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:46:58" (1/1) ... [2018-12-02 23:46:58,856 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 23:46:58,857 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 23:46:58,857 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 23:46:58,857 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 23:46:58,857 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:46:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ab0f6afc-2992-4a71-9a56-098e3c456789/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 23:46:58,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 23:46:58,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 23:46:58,896 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 23:46:58,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 23:46:58,896 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 23:46:58,896 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 23:46:58,896 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 23:46:58,896 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 23:46:58,896 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-02 23:46:58,897 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-02 23:46:58,897 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 23:46:58,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 23:46:58,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 23:46:58,898 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 23:46:59,181 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 23:46:59,181 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 23:46:59,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:46:59 BoogieIcfgContainer [2018-12-02 23:46:59,182 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 23:46:59,182 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 23:46:59,182 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 23:46:59,184 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 23:46:59,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 11:46:58" (1/3) ... [2018-12-02 23:46:59,184 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e5434e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:46:59, skipping insertion in model container [2018-12-02 23:46:59,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:46:58" (2/3) ... [2018-12-02 23:46:59,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e5434e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:46:59, skipping insertion in model container [2018-12-02 23:46:59,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:46:59" (3/3) ... [2018-12-02 23:46:59,186 INFO L112 eAbstractionObserver]: Analyzing ICFG safe034_rmo.oepc_false-unreach-call.i [2018-12-02 23:46:59,208 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,209 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,209 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,209 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,209 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,209 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,209 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,209 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,209 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,209 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,210 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,210 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,210 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,210 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,210 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,210 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,210 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,210 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,210 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,211 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,211 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,211 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,211 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,211 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,211 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,211 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,211 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,211 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,211 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,212 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,212 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,212 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,212 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,212 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,212 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,212 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,212 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,212 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,212 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,212 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,213 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,213 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,213 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,213 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,213 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,213 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,213 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,213 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,213 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,213 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,214 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,214 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,214 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,214 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,214 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,214 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,214 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,214 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,214 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,214 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,214 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,215 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,215 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,215 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,215 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,215 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,215 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,215 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,215 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,215 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,215 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,216 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,216 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,216 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,216 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,216 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,216 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,216 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,216 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,216 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,216 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,216 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,217 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,217 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,217 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,217 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,217 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,217 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,217 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,217 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,217 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,217 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,217 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,217 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,218 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,218 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,218 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,218 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,218 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,218 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,218 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,218 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,218 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,218 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,219 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,219 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,219 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,219 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,219 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,219 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,219 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,219 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,219 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,219 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,220 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,220 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,220 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,220 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,220 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,220 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,220 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,220 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,220 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,220 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,220 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,221 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,221 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,221 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,221 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,221 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,221 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,221 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,221 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,221 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,221 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,221 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,222 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,222 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,222 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,222 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,222 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,222 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,222 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,222 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,222 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,222 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,222 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,222 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,223 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,223 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:46:59,234 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 23:46:59,235 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 23:46:59,240 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 23:46:59,249 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 23:46:59,263 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 23:46:59,263 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 23:46:59,263 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 23:46:59,263 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 23:46:59,263 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 23:46:59,263 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 23:46:59,264 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 23:46:59,264 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 23:46:59,270 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 144places, 175 transitions [2018-12-02 23:47:19,007 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 149043 states. [2018-12-02 23:47:19,009 INFO L276 IsEmpty]: Start isEmpty. Operand 149043 states. [2018-12-02 23:47:19,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-02 23:47:19,016 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:47:19,017 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 23:47:19,018 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:47:19,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:47:19,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1284724798, now seen corresponding path program 1 times [2018-12-02 23:47:19,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:47:19,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:47:19,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:47:19,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:47:19,058 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:47:19,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:47:19,163 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 23:47:19,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:47:19,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 23:47:19,165 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:47:19,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 23:47:19,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 23:47:19,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 23:47:19,178 INFO L87 Difference]: Start difference. First operand 149043 states. Second operand 4 states. [2018-12-02 23:47:20,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:47:20,690 INFO L93 Difference]: Finished difference Result 257063 states and 1188602 transitions. [2018-12-02 23:47:20,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 23:47:20,692 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-12-02 23:47:20,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:47:21,372 INFO L225 Difference]: With dead ends: 257063 [2018-12-02 23:47:21,373 INFO L226 Difference]: Without dead ends: 174813 [2018-12-02 23:47:21,374 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 23:47:22,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174813 states. [2018-12-02 23:47:26,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174813 to 110553. [2018-12-02 23:47:26,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110553 states. [2018-12-02 23:47:26,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110553 states to 110553 states and 511484 transitions. [2018-12-02 23:47:26,441 INFO L78 Accepts]: Start accepts. Automaton has 110553 states and 511484 transitions. Word has length 44 [2018-12-02 23:47:26,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:47:26,442 INFO L480 AbstractCegarLoop]: Abstraction has 110553 states and 511484 transitions. [2018-12-02 23:47:26,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 23:47:26,442 INFO L276 IsEmpty]: Start isEmpty. Operand 110553 states and 511484 transitions. [2018-12-02 23:47:26,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-02 23:47:26,455 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:47:26,455 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:47:26,456 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:47:26,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:47:26,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1885719038, now seen corresponding path program 1 times [2018-12-02 23:47:26,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:47:26,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:47:26,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:47:26,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:47:26,461 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:47:26,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:47:26,521 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 23:47:26,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:47:26,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 23:47:26,521 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:47:26,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 23:47:26,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 23:47:26,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:47:26,522 INFO L87 Difference]: Start difference. First operand 110553 states and 511484 transitions. Second operand 5 states. [2018-12-02 23:47:28,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:47:28,230 INFO L93 Difference]: Finished difference Result 240603 states and 1068739 transitions. [2018-12-02 23:47:28,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 23:47:28,231 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-12-02 23:47:28,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:47:28,891 INFO L225 Difference]: With dead ends: 240603 [2018-12-02 23:47:28,891 INFO L226 Difference]: Without dead ends: 237053 [2018-12-02 23:47:28,892 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 23:47:29,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237053 states. [2018-12-02 23:47:32,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237053 to 160433. [2018-12-02 23:47:32,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160433 states. [2018-12-02 23:47:32,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160433 states to 160433 states and 716928 transitions. [2018-12-02 23:47:32,909 INFO L78 Accepts]: Start accepts. Automaton has 160433 states and 716928 transitions. Word has length 52 [2018-12-02 23:47:32,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:47:32,910 INFO L480 AbstractCegarLoop]: Abstraction has 160433 states and 716928 transitions. [2018-12-02 23:47:33,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 23:47:33,321 INFO L276 IsEmpty]: Start isEmpty. Operand 160433 states and 716928 transitions. [2018-12-02 23:47:33,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 23:47:33,331 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:47:33,331 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:47:33,332 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:47:33,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:47:33,332 INFO L82 PathProgramCache]: Analyzing trace with hash -369709651, now seen corresponding path program 1 times [2018-12-02 23:47:33,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:47:33,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:47:33,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:47:33,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:47:33,334 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:47:33,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:47:33,377 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 23:47:33,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:47:33,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 23:47:33,377 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:47:33,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 23:47:33,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 23:47:33,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:47:33,378 INFO L87 Difference]: Start difference. First operand 160433 states and 716928 transitions. Second operand 5 states. [2018-12-02 23:47:35,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:47:35,049 INFO L93 Difference]: Finished difference Result 317173 states and 1405285 transitions. [2018-12-02 23:47:35,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 23:47:35,049 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-12-02 23:47:35,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:47:36,007 INFO L225 Difference]: With dead ends: 317173 [2018-12-02 23:47:36,007 INFO L226 Difference]: Without dead ends: 314273 [2018-12-02 23:47:36,007 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 23:47:40,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314273 states. [2018-12-02 23:47:42,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314273 to 178273. [2018-12-02 23:47:42,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178273 states. [2018-12-02 23:47:43,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178273 states to 178273 states and 791490 transitions. [2018-12-02 23:47:43,804 INFO L78 Accepts]: Start accepts. Automaton has 178273 states and 791490 transitions. Word has length 53 [2018-12-02 23:47:43,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:47:43,804 INFO L480 AbstractCegarLoop]: Abstraction has 178273 states and 791490 transitions. [2018-12-02 23:47:43,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 23:47:43,804 INFO L276 IsEmpty]: Start isEmpty. Operand 178273 states and 791490 transitions. [2018-12-02 23:47:43,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-02 23:47:43,818 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:47:43,818 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] [2018-12-02 23:47:43,818 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:47:43,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:47:43,819 INFO L82 PathProgramCache]: Analyzing trace with hash 2073884627, now seen corresponding path program 1 times [2018-12-02 23:47:43,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:47:43,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:47:43,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:47:43,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:47:43,820 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:47:43,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:47:43,856 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 23:47:43,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:47:43,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:47:43,856 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:47:43,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:47:43,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:47:43,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:47:43,856 INFO L87 Difference]: Start difference. First operand 178273 states and 791490 transitions. Second operand 3 states. [2018-12-02 23:47:44,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:47:44,912 INFO L93 Difference]: Finished difference Result 231653 states and 1011274 transitions. [2018-12-02 23:47:44,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:47:44,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2018-12-02 23:47:44,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:47:45,533 INFO L225 Difference]: With dead ends: 231653 [2018-12-02 23:47:45,533 INFO L226 Difference]: Without dead ends: 231653 [2018-12-02 23:47:45,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:47:46,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231653 states. [2018-12-02 23:47:51,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231653 to 202938. [2018-12-02 23:47:51,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202938 states. [2018-12-02 23:47:52,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202938 states to 202938 states and 893562 transitions. [2018-12-02 23:47:52,513 INFO L78 Accepts]: Start accepts. Automaton has 202938 states and 893562 transitions. Word has length 55 [2018-12-02 23:47:52,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:47:52,513 INFO L480 AbstractCegarLoop]: Abstraction has 202938 states and 893562 transitions. [2018-12-02 23:47:52,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:47:52,513 INFO L276 IsEmpty]: Start isEmpty. Operand 202938 states and 893562 transitions. [2018-12-02 23:47:52,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-02 23:47:52,546 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:47:52,546 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] [2018-12-02 23:47:52,546 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:47:52,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:47:52,546 INFO L82 PathProgramCache]: Analyzing trace with hash -43565154, now seen corresponding path program 1 times [2018-12-02 23:47:52,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:47:52,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:47:52,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:47:52,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:47:52,548 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:47:52,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:47:52,601 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 23:47:52,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:47:52,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 23:47:52,601 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:47:52,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 23:47:52,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 23:47:52,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 23:47:52,602 INFO L87 Difference]: Start difference. First operand 202938 states and 893562 transitions. Second operand 6 states. [2018-12-02 23:47:54,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:47:54,939 INFO L93 Difference]: Finished difference Result 356173 states and 1552270 transitions. [2018-12-02 23:47:54,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 23:47:54,940 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2018-12-02 23:47:54,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:47:55,842 INFO L225 Difference]: With dead ends: 356173 [2018-12-02 23:47:55,842 INFO L226 Difference]: Without dead ends: 352823 [2018-12-02 23:47:55,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-02 23:47:57,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352823 states. [2018-12-02 23:48:03,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352823 to 205743. [2018-12-02 23:48:03,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205743 states. [2018-12-02 23:48:04,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205743 states to 205743 states and 906781 transitions. [2018-12-02 23:48:04,283 INFO L78 Accepts]: Start accepts. Automaton has 205743 states and 906781 transitions. Word has length 59 [2018-12-02 23:48:04,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:48:04,284 INFO L480 AbstractCegarLoop]: Abstraction has 205743 states and 906781 transitions. [2018-12-02 23:48:04,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 23:48:04,284 INFO L276 IsEmpty]: Start isEmpty. Operand 205743 states and 906781 transitions. [2018-12-02 23:48:04,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-02 23:48:04,317 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:48:04,317 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] [2018-12-02 23:48:04,318 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:48:04,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:48:04,318 INFO L82 PathProgramCache]: Analyzing trace with hash 396603386, now seen corresponding path program 1 times [2018-12-02 23:48:04,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:48:04,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:48:04,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:48:04,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:48:04,320 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:48:04,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:48:04,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:48:04,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:48:04,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:48:04,358 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:48:04,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:48:04,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:48:04,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:48:04,359 INFO L87 Difference]: Start difference. First operand 205743 states and 906781 transitions. Second operand 3 states. [2018-12-02 23:48:05,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:48:05,510 INFO L93 Difference]: Finished difference Result 227888 states and 1004312 transitions. [2018-12-02 23:48:05,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:48:05,511 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2018-12-02 23:48:05,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:48:06,611 INFO L225 Difference]: With dead ends: 227888 [2018-12-02 23:48:06,611 INFO L226 Difference]: Without dead ends: 227888 [2018-12-02 23:48:06,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:48:07,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227888 states. [2018-12-02 23:48:10,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227888 to 216543. [2018-12-02 23:48:10,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216543 states. [2018-12-02 23:48:11,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216543 states to 216543 states and 954421 transitions. [2018-12-02 23:48:11,370 INFO L78 Accepts]: Start accepts. Automaton has 216543 states and 954421 transitions. Word has length 59 [2018-12-02 23:48:11,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:48:11,370 INFO L480 AbstractCegarLoop]: Abstraction has 216543 states and 954421 transitions. [2018-12-02 23:48:11,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:48:11,371 INFO L276 IsEmpty]: Start isEmpty. Operand 216543 states and 954421 transitions. [2018-12-02 23:48:11,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-02 23:48:11,404 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:48:11,404 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] [2018-12-02 23:48:11,405 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:48:11,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:48:11,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1117448070, now seen corresponding path program 1 times [2018-12-02 23:48:11,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:48:11,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:48:11,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:48:11,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:48:11,407 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:48:11,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:48:11,464 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 23:48:11,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:48:11,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 23:48:11,464 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:48:11,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 23:48:11,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 23:48:11,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 23:48:11,465 INFO L87 Difference]: Start difference. First operand 216543 states and 954421 transitions. Second operand 6 states. [2018-12-02 23:48:13,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:48:13,433 INFO L93 Difference]: Finished difference Result 292218 states and 1274191 transitions. [2018-12-02 23:48:13,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 23:48:13,433 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2018-12-02 23:48:13,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:48:14,195 INFO L225 Difference]: With dead ends: 292218 [2018-12-02 23:48:14,195 INFO L226 Difference]: Without dead ends: 286523 [2018-12-02 23:48:14,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 23:48:15,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286523 states. [2018-12-02 23:48:21,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286523 to 261028. [2018-12-02 23:48:21,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261028 states. [2018-12-02 23:48:22,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261028 states to 261028 states and 1142704 transitions. [2018-12-02 23:48:22,772 INFO L78 Accepts]: Start accepts. Automaton has 261028 states and 1142704 transitions. Word has length 59 [2018-12-02 23:48:22,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:48:22,772 INFO L480 AbstractCegarLoop]: Abstraction has 261028 states and 1142704 transitions. [2018-12-02 23:48:22,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 23:48:22,772 INFO L276 IsEmpty]: Start isEmpty. Operand 261028 states and 1142704 transitions. [2018-12-02 23:48:22,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-02 23:48:22,813 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:48:22,814 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] [2018-12-02 23:48:22,814 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:48:22,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:48:22,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1380567867, now seen corresponding path program 1 times [2018-12-02 23:48:22,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:48:22,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:48:22,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:48:22,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:48:22,816 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:48:22,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:48:22,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:48:22,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:48:22,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 23:48:22,894 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:48:22,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 23:48:22,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 23:48:22,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 23:48:22,895 INFO L87 Difference]: Start difference. First operand 261028 states and 1142704 transitions. Second operand 7 states. [2018-12-02 23:48:25,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:48:25,409 INFO L93 Difference]: Finished difference Result 379443 states and 1607921 transitions. [2018-12-02 23:48:25,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 23:48:25,409 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2018-12-02 23:48:25,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:48:26,373 INFO L225 Difference]: With dead ends: 379443 [2018-12-02 23:48:26,373 INFO L226 Difference]: Without dead ends: 379443 [2018-12-02 23:48:26,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-02 23:48:28,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379443 states. [2018-12-02 23:48:35,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379443 to 308618. [2018-12-02 23:48:35,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308618 states. [2018-12-02 23:48:36,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308618 states to 308618 states and 1326661 transitions. [2018-12-02 23:48:36,874 INFO L78 Accepts]: Start accepts. Automaton has 308618 states and 1326661 transitions. Word has length 59 [2018-12-02 23:48:36,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:48:36,874 INFO L480 AbstractCegarLoop]: Abstraction has 308618 states and 1326661 transitions. [2018-12-02 23:48:36,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 23:48:36,874 INFO L276 IsEmpty]: Start isEmpty. Operand 308618 states and 1326661 transitions. [2018-12-02 23:48:36,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-02 23:48:36,918 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:48:36,918 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] [2018-12-02 23:48:36,918 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:48:36,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:48:36,918 INFO L82 PathProgramCache]: Analyzing trace with hash -2026895748, now seen corresponding path program 1 times [2018-12-02 23:48:36,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:48:36,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:48:36,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:48:36,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:48:36,920 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:48:36,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:48:36,955 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 23:48:36,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:48:36,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 23:48:36,955 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:48:36,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 23:48:36,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 23:48:36,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 23:48:36,956 INFO L87 Difference]: Start difference. First operand 308618 states and 1326661 transitions. Second operand 4 states. [2018-12-02 23:48:38,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:48:38,208 INFO L93 Difference]: Finished difference Result 267151 states and 1127019 transitions. [2018-12-02 23:48:38,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 23:48:38,209 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-12-02 23:48:38,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:48:39,434 INFO L225 Difference]: With dead ends: 267151 [2018-12-02 23:48:39,434 INFO L226 Difference]: Without dead ends: 259066 [2018-12-02 23:48:39,434 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 23:48:40,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259066 states. [2018-12-02 23:48:43,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259066 to 259066. [2018-12-02 23:48:43,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259066 states. [2018-12-02 23:48:44,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259066 states to 259066 states and 1099297 transitions. [2018-12-02 23:48:44,466 INFO L78 Accepts]: Start accepts. Automaton has 259066 states and 1099297 transitions. Word has length 59 [2018-12-02 23:48:44,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:48:44,466 INFO L480 AbstractCegarLoop]: Abstraction has 259066 states and 1099297 transitions. [2018-12-02 23:48:44,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 23:48:44,466 INFO L276 IsEmpty]: Start isEmpty. Operand 259066 states and 1099297 transitions. [2018-12-02 23:48:44,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 23:48:44,502 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:48:44,502 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] [2018-12-02 23:48:44,503 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:48:44,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:48:44,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1169735306, now seen corresponding path program 1 times [2018-12-02 23:48:44,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:48:44,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:48:44,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:48:44,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:48:44,504 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:48:44,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:48:44,538 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 23:48:44,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:48:44,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 23:48:44,538 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:48:44,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 23:48:44,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 23:48:44,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:48:44,539 INFO L87 Difference]: Start difference. First operand 259066 states and 1099297 transitions. Second operand 5 states. [2018-12-02 23:48:44,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:48:44,767 INFO L93 Difference]: Finished difference Result 57898 states and 224521 transitions. [2018-12-02 23:48:44,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 23:48:44,767 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2018-12-02 23:48:44,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:48:44,868 INFO L225 Difference]: With dead ends: 57898 [2018-12-02 23:48:44,868 INFO L226 Difference]: Without dead ends: 50982 [2018-12-02 23:48:44,868 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 23:48:44,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50982 states. [2018-12-02 23:48:45,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50982 to 50742. [2018-12-02 23:48:45,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50742 states. [2018-12-02 23:48:45,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50742 states to 50742 states and 196308 transitions. [2018-12-02 23:48:45,951 INFO L78 Accepts]: Start accepts. Automaton has 50742 states and 196308 transitions. Word has length 60 [2018-12-02 23:48:45,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:48:45,951 INFO L480 AbstractCegarLoop]: Abstraction has 50742 states and 196308 transitions. [2018-12-02 23:48:45,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 23:48:45,952 INFO L276 IsEmpty]: Start isEmpty. Operand 50742 states and 196308 transitions. [2018-12-02 23:48:45,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-02 23:48:45,968 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:48:45,968 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:48:45,968 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:48:45,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:48:45,969 INFO L82 PathProgramCache]: Analyzing trace with hash -779552109, now seen corresponding path program 1 times [2018-12-02 23:48:45,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:48:45,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:48:45,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:48:45,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:48:45,970 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:48:45,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:48:46,007 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 23:48:46,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:48:46,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 23:48:46,007 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:48:46,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 23:48:46,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 23:48:46,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 23:48:46,008 INFO L87 Difference]: Start difference. First operand 50742 states and 196308 transitions. Second operand 4 states. [2018-12-02 23:48:46,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:48:46,268 INFO L93 Difference]: Finished difference Result 59861 states and 230927 transitions. [2018-12-02 23:48:46,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 23:48:46,268 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2018-12-02 23:48:46,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:48:46,387 INFO L225 Difference]: With dead ends: 59861 [2018-12-02 23:48:46,387 INFO L226 Difference]: Without dead ends: 59861 [2018-12-02 23:48:46,388 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 23:48:46,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59861 states. [2018-12-02 23:48:47,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59861 to 53957. [2018-12-02 23:48:47,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53957 states. [2018-12-02 23:48:47,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53957 states to 53957 states and 208375 transitions. [2018-12-02 23:48:47,216 INFO L78 Accepts]: Start accepts. Automaton has 53957 states and 208375 transitions. Word has length 70 [2018-12-02 23:48:47,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:48:47,216 INFO L480 AbstractCegarLoop]: Abstraction has 53957 states and 208375 transitions. [2018-12-02 23:48:47,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 23:48:47,216 INFO L276 IsEmpty]: Start isEmpty. Operand 53957 states and 208375 transitions. [2018-12-02 23:48:47,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-02 23:48:47,235 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:48:47,235 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:48:47,235 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:48:47,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:48:47,235 INFO L82 PathProgramCache]: Analyzing trace with hash 963258226, now seen corresponding path program 1 times [2018-12-02 23:48:47,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:48:47,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:48:47,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:48:47,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:48:47,237 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:48:47,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:48:47,283 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 23:48:47,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:48:47,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 23:48:47,284 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:48:47,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 23:48:47,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 23:48:47,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 23:48:47,284 INFO L87 Difference]: Start difference. First operand 53957 states and 208375 transitions. Second operand 6 states. [2018-12-02 23:48:47,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:48:47,362 INFO L93 Difference]: Finished difference Result 14405 states and 48007 transitions. [2018-12-02 23:48:47,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 23:48:47,363 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2018-12-02 23:48:47,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:48:47,377 INFO L225 Difference]: With dead ends: 14405 [2018-12-02 23:48:47,378 INFO L226 Difference]: Without dead ends: 12149 [2018-12-02 23:48:47,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-02 23:48:47,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12149 states. [2018-12-02 23:48:48,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12149 to 11559. [2018-12-02 23:48:48,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11559 states. [2018-12-02 23:48:48,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11559 states to 11559 states and 37959 transitions. [2018-12-02 23:48:48,454 INFO L78 Accepts]: Start accepts. Automaton has 11559 states and 37959 transitions. Word has length 70 [2018-12-02 23:48:48,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:48:48,454 INFO L480 AbstractCegarLoop]: Abstraction has 11559 states and 37959 transitions. [2018-12-02 23:48:48,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 23:48:48,454 INFO L276 IsEmpty]: Start isEmpty. Operand 11559 states and 37959 transitions. [2018-12-02 23:48:48,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-02 23:48:48,464 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:48:48,464 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] [2018-12-02 23:48:48,465 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:48:48,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:48:48,465 INFO L82 PathProgramCache]: Analyzing trace with hash 571080501, now seen corresponding path program 1 times [2018-12-02 23:48:48,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:48:48,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:48:48,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:48:48,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:48:48,466 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:48:48,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:48:48,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:48:48,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:48:48,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 23:48:48,513 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:48:48,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 23:48:48,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 23:48:48,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 23:48:48,513 INFO L87 Difference]: Start difference. First operand 11559 states and 37959 transitions. Second operand 4 states. [2018-12-02 23:48:48,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:48:48,676 INFO L93 Difference]: Finished difference Result 16004 states and 51605 transitions. [2018-12-02 23:48:48,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 23:48:48,676 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2018-12-02 23:48:48,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:48:48,696 INFO L225 Difference]: With dead ends: 16004 [2018-12-02 23:48:48,696 INFO L226 Difference]: Without dead ends: 16004 [2018-12-02 23:48:48,696 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 23:48:48,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16004 states. [2018-12-02 23:48:48,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16004 to 14021. [2018-12-02 23:48:48,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14021 states. [2018-12-02 23:48:48,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14021 states to 14021 states and 45458 transitions. [2018-12-02 23:48:48,847 INFO L78 Accepts]: Start accepts. Automaton has 14021 states and 45458 transitions. Word has length 89 [2018-12-02 23:48:48,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:48:48,847 INFO L480 AbstractCegarLoop]: Abstraction has 14021 states and 45458 transitions. [2018-12-02 23:48:48,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 23:48:48,848 INFO L276 IsEmpty]: Start isEmpty. Operand 14021 states and 45458 transitions. [2018-12-02 23:48:48,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-02 23:48:48,860 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:48:48,860 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] [2018-12-02 23:48:48,860 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:48:48,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:48:48,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1506128842, now seen corresponding path program 1 times [2018-12-02 23:48:48,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:48:48,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:48:48,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:48:48,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:48:48,862 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:48:48,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:48:48,933 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 23:48:48,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:48:48,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 23:48:48,933 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:48:48,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 23:48:48,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 23:48:48,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 23:48:48,934 INFO L87 Difference]: Start difference. First operand 14021 states and 45458 transitions. Second operand 6 states. [2018-12-02 23:48:49,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:48:49,146 INFO L93 Difference]: Finished difference Result 20726 states and 66747 transitions. [2018-12-02 23:48:49,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 23:48:49,146 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2018-12-02 23:48:49,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:48:49,169 INFO L225 Difference]: With dead ends: 20726 [2018-12-02 23:48:49,169 INFO L226 Difference]: Without dead ends: 20598 [2018-12-02 23:48:49,169 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 23:48:49,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20598 states. [2018-12-02 23:48:49,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20598 to 17591. [2018-12-02 23:48:49,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17591 states. [2018-12-02 23:48:49,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17591 states to 17591 states and 56905 transitions. [2018-12-02 23:48:49,380 INFO L78 Accepts]: Start accepts. Automaton has 17591 states and 56905 transitions. Word has length 89 [2018-12-02 23:48:49,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:48:49,380 INFO L480 AbstractCegarLoop]: Abstraction has 17591 states and 56905 transitions. [2018-12-02 23:48:49,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 23:48:49,380 INFO L276 IsEmpty]: Start isEmpty. Operand 17591 states and 56905 transitions. [2018-12-02 23:48:49,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-02 23:48:49,398 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:48:49,398 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:48:49,398 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:48:49,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:48:49,398 INFO L82 PathProgramCache]: Analyzing trace with hash 991887095, now seen corresponding path program 1 times [2018-12-02 23:48:49,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:48:49,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:48:49,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:48:49,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:48:49,400 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:48:49,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:48:49,463 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 23:48:49,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:48:49,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 23:48:49,463 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:48:49,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 23:48:49,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 23:48:49,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 23:48:49,464 INFO L87 Difference]: Start difference. First operand 17591 states and 56905 transitions. Second operand 7 states. [2018-12-02 23:48:49,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:48:49,811 INFO L93 Difference]: Finished difference Result 33210 states and 107799 transitions. [2018-12-02 23:48:49,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 23:48:49,812 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2018-12-02 23:48:49,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:48:49,854 INFO L225 Difference]: With dead ends: 33210 [2018-12-02 23:48:49,854 INFO L226 Difference]: Without dead ends: 33210 [2018-12-02 23:48:49,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-12-02 23:48:49,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33210 states. [2018-12-02 23:48:50,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33210 to 21509. [2018-12-02 23:48:50,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21509 states. [2018-12-02 23:48:50,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21509 states to 21509 states and 70038 transitions. [2018-12-02 23:48:50,162 INFO L78 Accepts]: Start accepts. Automaton has 21509 states and 70038 transitions. Word has length 89 [2018-12-02 23:48:50,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:48:50,162 INFO L480 AbstractCegarLoop]: Abstraction has 21509 states and 70038 transitions. [2018-12-02 23:48:50,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 23:48:50,162 INFO L276 IsEmpty]: Start isEmpty. Operand 21509 states and 70038 transitions. [2018-12-02 23:48:50,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-02 23:48:50,184 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:48:50,184 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:48:50,185 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:48:50,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:48:50,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1879390776, now seen corresponding path program 1 times [2018-12-02 23:48:50,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:48:50,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:48:50,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:48:50,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:48:50,186 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:48:50,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:48:50,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:48:50,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:48:50,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 23:48:50,257 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:48:50,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 23:48:50,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 23:48:50,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 23:48:50,257 INFO L87 Difference]: Start difference. First operand 21509 states and 70038 transitions. Second operand 6 states. [2018-12-02 23:48:50,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:48:50,518 INFO L93 Difference]: Finished difference Result 23057 states and 74259 transitions. [2018-12-02 23:48:50,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 23:48:50,519 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2018-12-02 23:48:50,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:48:50,546 INFO L225 Difference]: With dead ends: 23057 [2018-12-02 23:48:50,546 INFO L226 Difference]: Without dead ends: 23057 [2018-12-02 23:48:50,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-02 23:48:50,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23057 states. [2018-12-02 23:48:50,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23057 to 18925. [2018-12-02 23:48:50,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18925 states. [2018-12-02 23:48:50,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18925 states to 18925 states and 60694 transitions. [2018-12-02 23:48:50,816 INFO L78 Accepts]: Start accepts. Automaton has 18925 states and 60694 transitions. Word has length 89 [2018-12-02 23:48:50,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:48:50,816 INFO L480 AbstractCegarLoop]: Abstraction has 18925 states and 60694 transitions. [2018-12-02 23:48:50,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 23:48:50,816 INFO L276 IsEmpty]: Start isEmpty. Operand 18925 states and 60694 transitions. [2018-12-02 23:48:50,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-02 23:48:50,835 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:48:50,835 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:48:50,835 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:48:50,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:48:50,836 INFO L82 PathProgramCache]: Analyzing trace with hash 684417056, now seen corresponding path program 1 times [2018-12-02 23:48:50,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:48:50,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:48:50,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:48:50,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:48:50,837 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:48:50,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:48:50,899 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 23:48:50,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:48:50,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 23:48:50,900 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:48:50,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 23:48:50,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 23:48:50,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 23:48:50,900 INFO L87 Difference]: Start difference. First operand 18925 states and 60694 transitions. Second operand 6 states. [2018-12-02 23:48:51,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:48:51,207 INFO L93 Difference]: Finished difference Result 22410 states and 70967 transitions. [2018-12-02 23:48:51,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 23:48:51,207 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2018-12-02 23:48:51,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:48:51,232 INFO L225 Difference]: With dead ends: 22410 [2018-12-02 23:48:51,232 INFO L226 Difference]: Without dead ends: 21890 [2018-12-02 23:48:51,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 23:48:51,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21890 states. [2018-12-02 23:48:51,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21890 to 20605. [2018-12-02 23:48:51,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20605 states. [2018-12-02 23:48:51,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20605 states to 20605 states and 65838 transitions. [2018-12-02 23:48:51,457 INFO L78 Accepts]: Start accepts. Automaton has 20605 states and 65838 transitions. Word has length 89 [2018-12-02 23:48:51,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:48:51,457 INFO L480 AbstractCegarLoop]: Abstraction has 20605 states and 65838 transitions. [2018-12-02 23:48:51,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 23:48:51,457 INFO L276 IsEmpty]: Start isEmpty. Operand 20605 states and 65838 transitions. [2018-12-02 23:48:51,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-02 23:48:51,478 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:48:51,478 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] [2018-12-02 23:48:51,479 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:48:51,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:48:51,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1269682249, now seen corresponding path program 2 times [2018-12-02 23:48:51,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:48:51,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:48:51,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:48:51,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:48:51,480 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:48:51,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:48:51,537 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 23:48:51,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:48:51,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 23:48:51,538 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:48:51,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 23:48:51,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 23:48:51,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 23:48:51,538 INFO L87 Difference]: Start difference. First operand 20605 states and 65838 transitions. Second operand 7 states. [2018-12-02 23:48:51,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:48:51,819 INFO L93 Difference]: Finished difference Result 23378 states and 74622 transitions. [2018-12-02 23:48:51,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 23:48:51,820 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2018-12-02 23:48:51,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:48:51,847 INFO L225 Difference]: With dead ends: 23378 [2018-12-02 23:48:51,847 INFO L226 Difference]: Without dead ends: 23378 [2018-12-02 23:48:51,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 23:48:51,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23378 states. [2018-12-02 23:48:52,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23378 to 20780. [2018-12-02 23:48:52,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20780 states. [2018-12-02 23:48:52,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20780 states to 20780 states and 66558 transitions. [2018-12-02 23:48:52,084 INFO L78 Accepts]: Start accepts. Automaton has 20780 states and 66558 transitions. Word has length 89 [2018-12-02 23:48:52,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:48:52,084 INFO L480 AbstractCegarLoop]: Abstraction has 20780 states and 66558 transitions. [2018-12-02 23:48:52,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 23:48:52,084 INFO L276 IsEmpty]: Start isEmpty. Operand 20780 states and 66558 transitions. [2018-12-02 23:48:52,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-02 23:48:52,105 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:48:52,105 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] [2018-12-02 23:48:52,105 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:48:52,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:48:52,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1325686785, now seen corresponding path program 1 times [2018-12-02 23:48:52,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:48:52,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:48:52,107 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 23:48:52,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:48:52,107 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:48:52,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:48:52,171 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 23:48:52,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:48:52,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 23:48:52,171 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:48:52,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 23:48:52,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 23:48:52,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 23:48:52,172 INFO L87 Difference]: Start difference. First operand 20780 states and 66558 transitions. Second operand 6 states. [2018-12-02 23:48:52,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:48:52,359 INFO L93 Difference]: Finished difference Result 22800 states and 71524 transitions. [2018-12-02 23:48:52,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 23:48:52,360 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2018-12-02 23:48:52,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:48:52,385 INFO L225 Difference]: With dead ends: 22800 [2018-12-02 23:48:52,385 INFO L226 Difference]: Without dead ends: 22800 [2018-12-02 23:48:52,385 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 23:48:52,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22800 states. [2018-12-02 23:48:52,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22800 to 21185. [2018-12-02 23:48:52,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21185 states. [2018-12-02 23:48:52,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21185 states to 21185 states and 66772 transitions. [2018-12-02 23:48:52,617 INFO L78 Accepts]: Start accepts. Automaton has 21185 states and 66772 transitions. Word has length 89 [2018-12-02 23:48:52,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:48:52,618 INFO L480 AbstractCegarLoop]: Abstraction has 21185 states and 66772 transitions. [2018-12-02 23:48:52,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 23:48:52,618 INFO L276 IsEmpty]: Start isEmpty. Operand 21185 states and 66772 transitions. [2018-12-02 23:48:52,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-02 23:48:52,639 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:48:52,639 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] [2018-12-02 23:48:52,639 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:48:52,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:48:52,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1580423330, now seen corresponding path program 1 times [2018-12-02 23:48:52,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:48:52,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:48:52,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:48:52,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:48:52,640 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:48:52,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:48:52,693 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 23:48:52,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:48:52,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 23:48:52,694 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:48:52,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 23:48:52,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 23:48:52,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 23:48:52,694 INFO L87 Difference]: Start difference. First operand 21185 states and 66772 transitions. Second operand 6 states. [2018-12-02 23:48:52,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:48:52,763 INFO L93 Difference]: Finished difference Result 19713 states and 60964 transitions. [2018-12-02 23:48:52,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 23:48:52,763 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2018-12-02 23:48:52,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:48:52,785 INFO L225 Difference]: With dead ends: 19713 [2018-12-02 23:48:52,785 INFO L226 Difference]: Without dead ends: 19713 [2018-12-02 23:48:52,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-02 23:48:52,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19713 states. [2018-12-02 23:48:52,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19713 to 12349. [2018-12-02 23:48:52,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12349 states. [2018-12-02 23:48:52,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12349 states to 12349 states and 38204 transitions. [2018-12-02 23:48:52,991 INFO L78 Accepts]: Start accepts. Automaton has 12349 states and 38204 transitions. Word has length 89 [2018-12-02 23:48:52,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:48:52,992 INFO L480 AbstractCegarLoop]: Abstraction has 12349 states and 38204 transitions. [2018-12-02 23:48:52,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 23:48:52,992 INFO L276 IsEmpty]: Start isEmpty. Operand 12349 states and 38204 transitions. [2018-12-02 23:48:53,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 23:48:53,003 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:48:53,003 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] [2018-12-02 23:48:53,003 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:48:53,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:48:53,003 INFO L82 PathProgramCache]: Analyzing trace with hash 2049629289, now seen corresponding path program 1 times [2018-12-02 23:48:53,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:48:53,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:48:53,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:48:53,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:48:53,004 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:48:53,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:48:53,073 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 23:48:53,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:48:53,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 23:48:53,073 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:48:53,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 23:48:53,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 23:48:53,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 23:48:53,074 INFO L87 Difference]: Start difference. First operand 12349 states and 38204 transitions. Second operand 6 states. [2018-12-02 23:48:53,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:48:53,198 INFO L93 Difference]: Finished difference Result 14279 states and 43813 transitions. [2018-12-02 23:48:53,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 23:48:53,198 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-12-02 23:48:53,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:48:53,214 INFO L225 Difference]: With dead ends: 14279 [2018-12-02 23:48:53,214 INFO L226 Difference]: Without dead ends: 13989 [2018-12-02 23:48:53,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-02 23:48:53,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13989 states. [2018-12-02 23:48:53,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13989 to 10869. [2018-12-02 23:48:53,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10869 states. [2018-12-02 23:48:53,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10869 states to 10869 states and 33340 transitions. [2018-12-02 23:48:53,342 INFO L78 Accepts]: Start accepts. Automaton has 10869 states and 33340 transitions. Word has length 91 [2018-12-02 23:48:53,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:48:53,343 INFO L480 AbstractCegarLoop]: Abstraction has 10869 states and 33340 transitions. [2018-12-02 23:48:53,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 23:48:53,343 INFO L276 IsEmpty]: Start isEmpty. Operand 10869 states and 33340 transitions. [2018-12-02 23:48:53,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 23:48:53,353 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:48:53,353 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] [2018-12-02 23:48:53,354 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:48:53,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:48:53,354 INFO L82 PathProgramCache]: Analyzing trace with hash -27580054, now seen corresponding path program 1 times [2018-12-02 23:48:53,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:48:53,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:48:53,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:48:53,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:48:53,356 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:48:53,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:48:53,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:48:53,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:48:53,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 23:48:53,436 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:48:53,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 23:48:53,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 23:48:53,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 23:48:53,436 INFO L87 Difference]: Start difference. First operand 10869 states and 33340 transitions. Second operand 7 states. [2018-12-02 23:48:53,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:48:53,579 INFO L93 Difference]: Finished difference Result 12896 states and 39484 transitions. [2018-12-02 23:48:53,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 23:48:53,579 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-12-02 23:48:53,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:48:53,591 INFO L225 Difference]: With dead ends: 12896 [2018-12-02 23:48:53,592 INFO L226 Difference]: Without dead ends: 12896 [2018-12-02 23:48:53,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-12-02 23:48:53,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12896 states. [2018-12-02 23:48:53,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12896 to 12832. [2018-12-02 23:48:53,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12832 states. [2018-12-02 23:48:53,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12832 states to 12832 states and 39276 transitions. [2018-12-02 23:48:53,724 INFO L78 Accepts]: Start accepts. Automaton has 12832 states and 39276 transitions. Word has length 91 [2018-12-02 23:48:53,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:48:53,724 INFO L480 AbstractCegarLoop]: Abstraction has 12832 states and 39276 transitions. [2018-12-02 23:48:53,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 23:48:53,724 INFO L276 IsEmpty]: Start isEmpty. Operand 12832 states and 39276 transitions. [2018-12-02 23:48:53,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 23:48:53,736 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:48:53,736 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] [2018-12-02 23:48:53,736 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:48:53,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:48:53,737 INFO L82 PathProgramCache]: Analyzing trace with hash 859923627, now seen corresponding path program 1 times [2018-12-02 23:48:53,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:48:53,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:48:53,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:48:53,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:48:53,738 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:48:53,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:48:53,803 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 23:48:53,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:48:53,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 23:48:53,803 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:48:53,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 23:48:53,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 23:48:53,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-02 23:48:53,804 INFO L87 Difference]: Start difference. First operand 12832 states and 39276 transitions. Second operand 8 states. [2018-12-02 23:48:54,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:48:54,084 INFO L93 Difference]: Finished difference Result 22594 states and 69060 transitions. [2018-12-02 23:48:54,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 23:48:54,084 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 91 [2018-12-02 23:48:54,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:48:54,095 INFO L225 Difference]: With dead ends: 22594 [2018-12-02 23:48:54,096 INFO L226 Difference]: Without dead ends: 11630 [2018-12-02 23:48:54,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-12-02 23:48:54,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11630 states. [2018-12-02 23:48:54,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11630 to 11060. [2018-12-02 23:48:54,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11060 states. [2018-12-02 23:48:54,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11060 states to 11060 states and 33600 transitions. [2018-12-02 23:48:54,201 INFO L78 Accepts]: Start accepts. Automaton has 11060 states and 33600 transitions. Word has length 91 [2018-12-02 23:48:54,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:48:54,201 INFO L480 AbstractCegarLoop]: Abstraction has 11060 states and 33600 transitions. [2018-12-02 23:48:54,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 23:48:54,201 INFO L276 IsEmpty]: Start isEmpty. Operand 11060 states and 33600 transitions. [2018-12-02 23:48:54,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 23:48:54,210 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:48:54,210 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] [2018-12-02 23:48:54,210 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:48:54,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:48:54,210 INFO L82 PathProgramCache]: Analyzing trace with hash -407237961, now seen corresponding path program 2 times [2018-12-02 23:48:54,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:48:54,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:48:54,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:48:54,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:48:54,211 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:48:54,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:48:54,291 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 23:48:54,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:48:54,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 23:48:54,292 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:48:54,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 23:48:54,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 23:48:54,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-02 23:48:54,292 INFO L87 Difference]: Start difference. First operand 11060 states and 33600 transitions. Second operand 10 states. [2018-12-02 23:48:54,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:48:54,661 INFO L93 Difference]: Finished difference Result 19780 states and 60368 transitions. [2018-12-02 23:48:54,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 23:48:54,661 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 91 [2018-12-02 23:48:54,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:48:54,668 INFO L225 Difference]: With dead ends: 19780 [2018-12-02 23:48:54,669 INFO L226 Difference]: Without dead ends: 7778 [2018-12-02 23:48:54,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-12-02 23:48:54,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7778 states. [2018-12-02 23:48:54,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7778 to 7778. [2018-12-02 23:48:54,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7778 states. [2018-12-02 23:48:54,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7778 states to 7778 states and 23721 transitions. [2018-12-02 23:48:54,739 INFO L78 Accepts]: Start accepts. Automaton has 7778 states and 23721 transitions. Word has length 91 [2018-12-02 23:48:54,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:48:54,739 INFO L480 AbstractCegarLoop]: Abstraction has 7778 states and 23721 transitions. [2018-12-02 23:48:54,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 23:48:54,739 INFO L276 IsEmpty]: Start isEmpty. Operand 7778 states and 23721 transitions. [2018-12-02 23:48:54,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 23:48:54,745 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:48:54,745 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] [2018-12-02 23:48:54,745 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:48:54,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:48:54,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1988001207, now seen corresponding path program 3 times [2018-12-02 23:48:54,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:48:54,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:48:54,746 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 23:48:54,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:48:54,746 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:48:54,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:48:54,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:48:54,784 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 23:48:54,860 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 23:48:54,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 11:48:54 BasicIcfg [2018-12-02 23:48:54,861 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 23:48:54,862 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 23:48:54,862 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 23:48:54,862 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 23:48:54,862 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:46:59" (3/4) ... [2018-12-02 23:48:54,864 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 23:48:54,938 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_ab0f6afc-2992-4a71-9a56-098e3c456789/bin-2019/utaipan/witness.graphml [2018-12-02 23:48:54,938 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 23:48:54,939 INFO L168 Benchmark]: Toolchain (without parser) took 116469.92 ms. Allocated memory was 1.0 GB in the beginning and 7.6 GB in the end (delta: 6.6 GB). Free memory was 947.0 MB in the beginning and 5.7 GB in the end (delta: -4.7 GB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2018-12-02 23:48:54,939 INFO L168 Benchmark]: CDTParser took 0.18 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 23:48:54,940 INFO L168 Benchmark]: CACSL2BoogieTranslator took 319.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -169.9 MB). Peak memory consumption was 32.5 MB. Max. memory is 11.5 GB. [2018-12-02 23:48:54,940 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-12-02 23:48:54,940 INFO L168 Benchmark]: Boogie Preprocessor took 26.47 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 23:48:54,940 INFO L168 Benchmark]: RCFGBuilder took 325.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 47.6 MB). Peak memory consumption was 47.6 MB. Max. memory is 11.5 GB. [2018-12-02 23:48:54,940 INFO L168 Benchmark]: TraceAbstraction took 115679.53 ms. Allocated memory was 1.2 GB in the beginning and 7.6 GB in the end (delta: 6.4 GB). Free memory was 1.1 GB in the beginning and 5.7 GB in the end (delta: -4.6 GB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2018-12-02 23:48:54,940 INFO L168 Benchmark]: Witness Printer took 76.49 ms. Allocated memory is still 7.6 GB. Free memory was 5.7 GB in the beginning and 5.7 GB in the end (delta: 28.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. [2018-12-02 23:48:54,941 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.18 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 319.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -169.9 MB). Peak memory consumption was 32.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.47 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 325.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 47.6 MB). Peak memory consumption was 47.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 115679.53 ms. Allocated memory was 1.2 GB in the beginning and 7.6 GB in the end (delta: 6.4 GB). Free memory was 1.1 GB in the beginning and 5.7 GB in the end (delta: -4.6 GB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. * Witness Printer took 76.49 ms. Allocated memory is still 7.6 GB. Free memory was 5.7 GB in the beginning and 5.7 GB in the end (delta: 28.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L677] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L678] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L680] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L682] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L683] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L684] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L685] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L686] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L687] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L688] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_buff0_thd3=0] [L689] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0] [L690] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L691] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L692] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L693] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L694] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L695] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L696] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L697] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L698] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L700] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L701] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L702] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] -1 pthread_t t2591; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L791] FCALL, FORK -1 pthread_create(&t2591, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L792] -1 pthread_t t2592; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L793] FCALL, FORK -1 pthread_create(&t2592, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L794] -1 pthread_t t2593; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L795] FCALL, FORK -1 pthread_create(&t2593, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L753] 0 y$w_buff1 = y$w_buff0 [L754] 0 y$w_buff0 = 1 [L755] 0 y$w_buff1_used = y$w_buff0_used [L756] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L758] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L759] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L760] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L761] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L762] 0 y$r_buff0_thd3 = (_Bool)1 [L765] 0 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L706] 1 z = 2 [L711] 1 __unbuffered_p0_EAX = x [L716] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L723] 2 x = 1 [L728] 2 weak$$choice0 = __VERIFIER_nondet_pointer() [L729] 2 weak$$choice2 = __VERIFIER_nondet_pointer() [L730] 2 y$flush_delayed = weak$$choice2 [L731] 2 y$mem_tmp = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L732] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L732] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L733] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L768] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L733] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L734] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L734] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L735] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L735] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L736] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L736] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L737] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L737] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L738] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L738] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L739] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L740] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L740] 2 y = y$flush_delayed ? y$mem_tmp : y [L741] 2 y$flush_delayed = (_Bool)0 [L746] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L768] 0 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L769] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L769] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L770] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L770] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L771] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L771] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L772] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L772] 0 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L775] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L797] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L801] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L801] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L801] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L801] -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) [L802] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L802] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L803] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L803] -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 [L804] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L804] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L805] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L805] -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 [L808] -1 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 217 locations, 3 error locations. UNSAFE Result, 115.6s OverallTime, 25 OverallIterations, 1 TraceHistogramMax, 26.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6393 SDtfs, 9021 SDslu, 13699 SDs, 0 SdLazy, 5378 SolverSat, 370 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 211 GetRequests, 57 SyntacticMatches, 9 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=308618occurred in iteration=8, 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: 66.4s AutomataMinimizationTime, 24 MinimizatonAttempts, 604513 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1866 NumberOfCodeBlocks, 1866 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1751 ConstructedInterpolants, 0 QuantifiedInterpolants, 369853 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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...