./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix031_rmo.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_8bec92a1-8781-46ab-9cae-0596eab80e6c/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8bec92a1-8781-46ab-9cae-0596eab80e6c/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8bec92a1-8781-46ab-9cae-0596eab80e6c/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8bec92a1-8781-46ab-9cae-0596eab80e6c/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix031_rmo.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_8bec92a1-8781-46ab-9cae-0596eab80e6c/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8bec92a1-8781-46ab-9cae-0596eab80e6c/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 4f221d833e364c3e33adbf7c282934490fb85058 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 20:39:46,086 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 20:39:46,087 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 20:39:46,093 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 20:39:46,094 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 20:39:46,094 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 20:39:46,095 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 20:39:46,096 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 20:39:46,097 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 20:39:46,097 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 20:39:46,098 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 20:39:46,098 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 20:39:46,098 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 20:39:46,099 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 20:39:46,099 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 20:39:46,100 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 20:39:46,100 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 20:39:46,101 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 20:39:46,102 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 20:39:46,103 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 20:39:46,103 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 20:39:46,104 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 20:39:46,105 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 20:39:46,105 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 20:39:46,105 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 20:39:46,106 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 20:39:46,106 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 20:39:46,107 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 20:39:46,107 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 20:39:46,108 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 20:39:46,108 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 20:39:46,108 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 20:39:46,108 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 20:39:46,108 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 20:39:46,109 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 20:39:46,109 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 20:39:46,110 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8bec92a1-8781-46ab-9cae-0596eab80e6c/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 20:39:46,117 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 20:39:46,117 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 20:39:46,118 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 20:39:46,118 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 20:39:46,118 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 20:39:46,118 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 20:39:46,118 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 20:39:46,118 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 20:39:46,118 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 20:39:46,119 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 20:39:46,119 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 20:39:46,119 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 20:39:46,119 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 20:39:46,119 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 20:39:46,119 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 20:39:46,119 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 20:39:46,119 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 20:39:46,120 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 20:39:46,120 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 20:39:46,120 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 20:39:46,120 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 20:39:46,120 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 20:39:46,120 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 20:39:46,120 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 20:39:46,120 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 20:39:46,120 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 20:39:46,120 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 20:39:46,120 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 20:39:46,120 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 20:39:46,121 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 20:39:46,121 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 20:39:46,121 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 20:39:46,121 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 20:39:46,121 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 20:39:46,121 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 20:39:46,121 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 20:39:46,121 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_8bec92a1-8781-46ab-9cae-0596eab80e6c/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 -> 4f221d833e364c3e33adbf7c282934490fb85058 [2018-12-02 20:39:46,139 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 20:39:46,148 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 20:39:46,150 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 20:39:46,152 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 20:39:46,152 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 20:39:46,152 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8bec92a1-8781-46ab-9cae-0596eab80e6c/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix031_rmo.opt_false-unreach-call.i [2018-12-02 20:39:46,196 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8bec92a1-8781-46ab-9cae-0596eab80e6c/bin-2019/utaipan/data/705b3c698/aa50dd62ebb34c9396795940e585abf3/FLAGfffa531d9 [2018-12-02 20:39:46,653 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 20:39:46,653 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8bec92a1-8781-46ab-9cae-0596eab80e6c/sv-benchmarks/c/pthread-wmm/mix031_rmo.opt_false-unreach-call.i [2018-12-02 20:39:46,661 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8bec92a1-8781-46ab-9cae-0596eab80e6c/bin-2019/utaipan/data/705b3c698/aa50dd62ebb34c9396795940e585abf3/FLAGfffa531d9 [2018-12-02 20:39:46,669 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8bec92a1-8781-46ab-9cae-0596eab80e6c/bin-2019/utaipan/data/705b3c698/aa50dd62ebb34c9396795940e585abf3 [2018-12-02 20:39:46,671 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 20:39:46,672 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 20:39:46,672 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 20:39:46,673 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 20:39:46,675 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 20:39:46,675 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:39:46" (1/1) ... [2018-12-02 20:39:46,677 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ab2707f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:39:46, skipping insertion in model container [2018-12-02 20:39:46,677 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:39:46" (1/1) ... [2018-12-02 20:39:46,681 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 20:39:46,707 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 20:39:46,909 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 20:39:46,917 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 20:39:46,997 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 20:39:47,029 INFO L195 MainTranslator]: Completed translation [2018-12-02 20:39:47,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:39:47 WrapperNode [2018-12-02 20:39:47,029 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 20:39:47,030 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 20:39:47,030 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 20:39:47,030 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 20:39:47,036 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:39:47" (1/1) ... [2018-12-02 20:39:47,045 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:39:47" (1/1) ... [2018-12-02 20:39:47,061 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 20:39:47,061 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 20:39:47,061 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 20:39:47,061 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 20:39:47,067 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:39:47" (1/1) ... [2018-12-02 20:39:47,067 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:39:47" (1/1) ... [2018-12-02 20:39:47,070 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:39:47" (1/1) ... [2018-12-02 20:39:47,070 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:39:47" (1/1) ... [2018-12-02 20:39:47,075 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:39:47" (1/1) ... [2018-12-02 20:39:47,077 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:39:47" (1/1) ... [2018-12-02 20:39:47,079 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:39:47" (1/1) ... [2018-12-02 20:39:47,081 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 20:39:47,081 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 20:39:47,081 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 20:39:47,081 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 20:39:47,082 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:39:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8bec92a1-8781-46ab-9cae-0596eab80e6c/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 20:39:47,114 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 20:39:47,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 20:39:47,114 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 20:39:47,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 20:39:47,114 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 20:39:47,114 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 20:39:47,114 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 20:39:47,114 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 20:39:47,114 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 20:39:47,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 20:39:47,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 20:39:47,115 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 20:39:47,393 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 20:39:47,393 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 20:39:47,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:39:47 BoogieIcfgContainer [2018-12-02 20:39:47,394 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 20:39:47,394 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 20:39:47,394 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 20:39:47,397 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 20:39:47,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 08:39:46" (1/3) ... [2018-12-02 20:39:47,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18773852 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:39:47, skipping insertion in model container [2018-12-02 20:39:47,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:39:47" (2/3) ... [2018-12-02 20:39:47,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18773852 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:39:47, skipping insertion in model container [2018-12-02 20:39:47,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:39:47" (3/3) ... [2018-12-02 20:39:47,400 INFO L112 eAbstractionObserver]: Analyzing ICFG mix031_rmo.opt_false-unreach-call.i [2018-12-02 20:39:47,428 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,428 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,428 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,428 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,428 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,429 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,429 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,429 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,429 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,429 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,429 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,429 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,429 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,430 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,430 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,430 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,430 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,430 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,430 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,430 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,430 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,431 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,431 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,431 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,431 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,431 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,432 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,432 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,432 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,432 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,432 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,432 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,433 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,433 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,433 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,433 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,433 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,433 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,433 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,434 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,434 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,434 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,434 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,434 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,434 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,434 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,435 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,435 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,435 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,435 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,435 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,435 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,435 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,435 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,435 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,436 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,436 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,436 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,436 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,436 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,436 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,437 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,437 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,437 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,437 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,437 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,437 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,437 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,438 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,438 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,438 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,438 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,438 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,439 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,439 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,439 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,439 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,439 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,439 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,439 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,440 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,440 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,440 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,440 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,440 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,440 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,440 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,441 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,441 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,441 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,441 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,441 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,441 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,441 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,442 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,442 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,442 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,442 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,442 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,443 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,443 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,443 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,443 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,443 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,443 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,443 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,444 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,444 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,444 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,444 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,444 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,444 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,445 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,445 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,445 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,445 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,445 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,445 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,446 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,446 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,446 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,446 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,446 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,446 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,446 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,447 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,447 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,447 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,447 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,447 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,447 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,447 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,448 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,448 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,448 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,448 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:39:47,452 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 20:39:47,452 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 20:39:47,459 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 20:39:47,469 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 20:39:47,484 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 20:39:47,484 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 20:39:47,484 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 20:39:47,484 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 20:39:47,484 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 20:39:47,484 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 20:39:47,484 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 20:39:47,484 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 20:39:47,490 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 134places, 166 transitions [2018-12-02 20:39:48,607 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27858 states. [2018-12-02 20:39:48,608 INFO L276 IsEmpty]: Start isEmpty. Operand 27858 states. [2018-12-02 20:39:48,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-02 20:39:48,614 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:39:48,614 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] [2018-12-02 20:39:48,616 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:39:48,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:39:48,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1858856236, now seen corresponding path program 1 times [2018-12-02 20:39:48,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:39:48,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:48,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:39:48,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:48,655 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:39:48,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:39:48,756 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 20:39:48,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:39:48,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 20:39:48,758 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:39:48,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 20:39:48,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 20:39:48,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 20:39:48,770 INFO L87 Difference]: Start difference. First operand 27858 states. Second operand 4 states. [2018-12-02 20:39:49,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:39:49,174 INFO L93 Difference]: Finished difference Result 47770 states and 183121 transitions. [2018-12-02 20:39:49,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 20:39:49,175 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-12-02 20:39:49,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:39:49,377 INFO L225 Difference]: With dead ends: 47770 [2018-12-02 20:39:49,377 INFO L226 Difference]: Without dead ends: 34610 [2018-12-02 20:39:49,378 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 20:39:49,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34610 states. [2018-12-02 20:39:49,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34610 to 21758. [2018-12-02 20:39:49,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21758 states. [2018-12-02 20:39:49,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21758 states to 21758 states and 83443 transitions. [2018-12-02 20:39:49,908 INFO L78 Accepts]: Start accepts. Automaton has 21758 states and 83443 transitions. Word has length 41 [2018-12-02 20:39:49,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:39:49,908 INFO L480 AbstractCegarLoop]: Abstraction has 21758 states and 83443 transitions. [2018-12-02 20:39:49,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 20:39:49,909 INFO L276 IsEmpty]: Start isEmpty. Operand 21758 states and 83443 transitions. [2018-12-02 20:39:49,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-02 20:39:49,913 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:39:49,913 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:39:49,914 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:39:49,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:39:49,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1910881222, now seen corresponding path program 1 times [2018-12-02 20:39:49,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:39:49,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:49,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:39:49,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:49,917 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:39:49,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:39:49,958 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 20:39:49,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:39:49,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 20:39:49,958 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:39:49,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 20:39:49,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 20:39:49,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 20:39:49,960 INFO L87 Difference]: Start difference. First operand 21758 states and 83443 transitions. Second operand 4 states. [2018-12-02 20:39:50,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:39:50,027 INFO L93 Difference]: Finished difference Result 7172 states and 23628 transitions. [2018-12-02 20:39:50,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 20:39:50,027 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-12-02 20:39:50,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:39:50,039 INFO L225 Difference]: With dead ends: 7172 [2018-12-02 20:39:50,040 INFO L226 Difference]: Without dead ends: 6326 [2018-12-02 20:39:50,040 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 20:39:50,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6326 states. [2018-12-02 20:39:50,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6326 to 6326. [2018-12-02 20:39:50,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6326 states. [2018-12-02 20:39:50,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6326 states to 6326 states and 20700 transitions. [2018-12-02 20:39:50,132 INFO L78 Accepts]: Start accepts. Automaton has 6326 states and 20700 transitions. Word has length 49 [2018-12-02 20:39:50,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:39:50,133 INFO L480 AbstractCegarLoop]: Abstraction has 6326 states and 20700 transitions. [2018-12-02 20:39:50,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 20:39:50,133 INFO L276 IsEmpty]: Start isEmpty. Operand 6326 states and 20700 transitions. [2018-12-02 20:39:50,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-02 20:39:50,134 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:39:50,134 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:39:50,134 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:39:50,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:39:50,134 INFO L82 PathProgramCache]: Analyzing trace with hash 844464111, now seen corresponding path program 1 times [2018-12-02 20:39:50,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:39:50,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:50,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:39:50,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:50,137 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:39:50,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:39:50,185 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 20:39:50,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:39:50,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 20:39:50,186 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:39:50,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 20:39:50,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 20:39:50,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 20:39:50,186 INFO L87 Difference]: Start difference. First operand 6326 states and 20700 transitions. Second operand 5 states. [2018-12-02 20:39:50,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:39:50,390 INFO L93 Difference]: Finished difference Result 12022 states and 38786 transitions. [2018-12-02 20:39:50,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 20:39:50,391 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-12-02 20:39:50,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:39:50,406 INFO L225 Difference]: With dead ends: 12022 [2018-12-02 20:39:50,406 INFO L226 Difference]: Without dead ends: 11947 [2018-12-02 20:39:50,407 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 20:39:50,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11947 states. [2018-12-02 20:39:50,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11947 to 8291. [2018-12-02 20:39:50,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8291 states. [2018-12-02 20:39:50,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8291 states to 8291 states and 26553 transitions. [2018-12-02 20:39:50,516 INFO L78 Accepts]: Start accepts. Automaton has 8291 states and 26553 transitions. Word has length 50 [2018-12-02 20:39:50,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:39:50,517 INFO L480 AbstractCegarLoop]: Abstraction has 8291 states and 26553 transitions. [2018-12-02 20:39:50,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 20:39:50,517 INFO L276 IsEmpty]: Start isEmpty. Operand 8291 states and 26553 transitions. [2018-12-02 20:39:50,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-02 20:39:50,519 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:39:50,519 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 20:39:50,519 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:39:50,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:39:50,519 INFO L82 PathProgramCache]: Analyzing trace with hash 663764693, now seen corresponding path program 1 times [2018-12-02 20:39:50,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:39:50,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:50,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:39:50,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:50,521 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:39:50,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:39:50,548 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 20:39:50,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:39:50,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 20:39:50,548 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:39:50,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 20:39:50,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 20:39:50,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 20:39:50,549 INFO L87 Difference]: Start difference. First operand 8291 states and 26553 transitions. Second operand 3 states. [2018-12-02 20:39:50,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:39:50,589 INFO L93 Difference]: Finished difference Result 10987 states and 34708 transitions. [2018-12-02 20:39:50,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 20:39:50,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-12-02 20:39:50,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:39:50,605 INFO L225 Difference]: With dead ends: 10987 [2018-12-02 20:39:50,605 INFO L226 Difference]: Without dead ends: 10983 [2018-12-02 20:39:50,606 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 20:39:50,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10983 states. [2018-12-02 20:39:50,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10983 to 8509. [2018-12-02 20:39:50,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8509 states. [2018-12-02 20:39:50,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8509 states to 8509 states and 26989 transitions. [2018-12-02 20:39:50,703 INFO L78 Accepts]: Start accepts. Automaton has 8509 states and 26989 transitions. Word has length 52 [2018-12-02 20:39:50,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:39:50,703 INFO L480 AbstractCegarLoop]: Abstraction has 8509 states and 26989 transitions. [2018-12-02 20:39:50,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 20:39:50,703 INFO L276 IsEmpty]: Start isEmpty. Operand 8509 states and 26989 transitions. [2018-12-02 20:39:50,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-02 20:39:50,705 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:39:50,705 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] [2018-12-02 20:39:50,705 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:39:50,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:39:50,705 INFO L82 PathProgramCache]: Analyzing trace with hash -324933472, now seen corresponding path program 1 times [2018-12-02 20:39:50,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:39:50,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:50,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:39:50,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:50,707 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:39:50,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:39:50,748 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 20:39:50,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:39:50,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 20:39:50,749 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:39:50,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 20:39:50,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 20:39:50,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 20:39:50,749 INFO L87 Difference]: Start difference. First operand 8509 states and 26989 transitions. Second operand 6 states. [2018-12-02 20:39:50,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:39:50,990 INFO L93 Difference]: Finished difference Result 11925 states and 37200 transitions. [2018-12-02 20:39:50,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 20:39:50,990 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2018-12-02 20:39:50,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:39:51,003 INFO L225 Difference]: With dead ends: 11925 [2018-12-02 20:39:51,003 INFO L226 Difference]: Without dead ends: 11828 [2018-12-02 20:39:51,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-12-02 20:39:51,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11828 states. [2018-12-02 20:39:51,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11828 to 9283. [2018-12-02 20:39:51,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9283 states. [2018-12-02 20:39:51,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9283 states to 9283 states and 29433 transitions. [2018-12-02 20:39:51,155 INFO L78 Accepts]: Start accepts. Automaton has 9283 states and 29433 transitions. Word has length 56 [2018-12-02 20:39:51,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:39:51,155 INFO L480 AbstractCegarLoop]: Abstraction has 9283 states and 29433 transitions. [2018-12-02 20:39:51,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 20:39:51,156 INFO L276 IsEmpty]: Start isEmpty. Operand 9283 states and 29433 transitions. [2018-12-02 20:39:51,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 20:39:51,160 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:39:51,160 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] [2018-12-02 20:39:51,160 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:39:51,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:39:51,160 INFO L82 PathProgramCache]: Analyzing trace with hash 841395753, now seen corresponding path program 1 times [2018-12-02 20:39:51,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:39:51,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:51,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:39:51,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:51,161 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:39:51,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:39:51,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:39:51,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:39:51,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 20:39:51,192 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:39:51,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 20:39:51,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 20:39:51,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 20:39:51,193 INFO L87 Difference]: Start difference. First operand 9283 states and 29433 transitions. Second operand 4 states. [2018-12-02 20:39:51,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:39:51,307 INFO L93 Difference]: Finished difference Result 10902 states and 34384 transitions. [2018-12-02 20:39:51,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 20:39:51,307 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-12-02 20:39:51,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:39:51,320 INFO L225 Difference]: With dead ends: 10902 [2018-12-02 20:39:51,320 INFO L226 Difference]: Without dead ends: 10902 [2018-12-02 20:39:51,320 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 20:39:51,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10902 states. [2018-12-02 20:39:51,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10902 to 9934. [2018-12-02 20:39:51,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9934 states. [2018-12-02 20:39:51,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9934 states to 9934 states and 31410 transitions. [2018-12-02 20:39:51,426 INFO L78 Accepts]: Start accepts. Automaton has 9934 states and 31410 transitions. Word has length 66 [2018-12-02 20:39:51,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:39:51,426 INFO L480 AbstractCegarLoop]: Abstraction has 9934 states and 31410 transitions. [2018-12-02 20:39:51,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 20:39:51,426 INFO L276 IsEmpty]: Start isEmpty. Operand 9934 states and 31410 transitions. [2018-12-02 20:39:51,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 20:39:51,430 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:39:51,430 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] [2018-12-02 20:39:51,431 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:39:51,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:39:51,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1710761208, now seen corresponding path program 1 times [2018-12-02 20:39:51,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:39:51,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:51,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:39:51,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:51,433 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:39:51,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:39:51,476 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 20:39:51,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:39:51,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 20:39:51,476 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:39:51,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 20:39:51,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 20:39:51,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 20:39:51,477 INFO L87 Difference]: Start difference. First operand 9934 states and 31410 transitions. Second operand 6 states. [2018-12-02 20:39:51,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:39:51,807 INFO L93 Difference]: Finished difference Result 21765 states and 67782 transitions. [2018-12-02 20:39:51,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 20:39:51,807 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-12-02 20:39:51,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:39:51,831 INFO L225 Difference]: With dead ends: 21765 [2018-12-02 20:39:51,831 INFO L226 Difference]: Without dead ends: 21701 [2018-12-02 20:39:51,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-02 20:39:51,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21701 states. [2018-12-02 20:39:51,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21701 to 13159. [2018-12-02 20:39:51,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13159 states. [2018-12-02 20:39:52,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13159 states to 13159 states and 40991 transitions. [2018-12-02 20:39:52,009 INFO L78 Accepts]: Start accepts. Automaton has 13159 states and 40991 transitions. Word has length 66 [2018-12-02 20:39:52,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:39:52,009 INFO L480 AbstractCegarLoop]: Abstraction has 13159 states and 40991 transitions. [2018-12-02 20:39:52,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 20:39:52,009 INFO L276 IsEmpty]: Start isEmpty. Operand 13159 states and 40991 transitions. [2018-12-02 20:39:52,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-02 20:39:52,015 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:39:52,015 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] [2018-12-02 20:39:52,016 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:39:52,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:39:52,016 INFO L82 PathProgramCache]: Analyzing trace with hash -52804182, now seen corresponding path program 1 times [2018-12-02 20:39:52,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:39:52,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:52,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:39:52,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:52,017 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:39:52,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:39:52,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:39:52,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:39:52,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 20:39:52,069 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:39:52,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 20:39:52,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 20:39:52,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 20:39:52,069 INFO L87 Difference]: Start difference. First operand 13159 states and 40991 transitions. Second operand 4 states. [2018-12-02 20:39:52,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:39:52,256 INFO L93 Difference]: Finished difference Result 16698 states and 51258 transitions. [2018-12-02 20:39:52,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 20:39:52,256 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2018-12-02 20:39:52,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:39:52,279 INFO L225 Difference]: With dead ends: 16698 [2018-12-02 20:39:52,279 INFO L226 Difference]: Without dead ends: 16698 [2018-12-02 20:39:52,279 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 20:39:52,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16698 states. [2018-12-02 20:39:52,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16698 to 15122. [2018-12-02 20:39:52,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15122 states. [2018-12-02 20:39:52,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15122 states to 15122 states and 46581 transitions. [2018-12-02 20:39:52,528 INFO L78 Accepts]: Start accepts. Automaton has 15122 states and 46581 transitions. Word has length 68 [2018-12-02 20:39:52,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:39:52,528 INFO L480 AbstractCegarLoop]: Abstraction has 15122 states and 46581 transitions. [2018-12-02 20:39:52,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 20:39:52,528 INFO L276 IsEmpty]: Start isEmpty. Operand 15122 states and 46581 transitions. [2018-12-02 20:39:52,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-02 20:39:52,534 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:39:52,535 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] [2018-12-02 20:39:52,535 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:39:52,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:39:52,535 INFO L82 PathProgramCache]: Analyzing trace with hash -2130013525, now seen corresponding path program 1 times [2018-12-02 20:39:52,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:39:52,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:52,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:39:52,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:52,537 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:39:52,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:39:52,572 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 20:39:52,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:39:52,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 20:39:52,573 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:39:52,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 20:39:52,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 20:39:52,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 20:39:52,573 INFO L87 Difference]: Start difference. First operand 15122 states and 46581 transitions. Second operand 3 states. [2018-12-02 20:39:52,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:39:52,696 INFO L93 Difference]: Finished difference Result 15720 states and 48233 transitions. [2018-12-02 20:39:52,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 20:39:52,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-12-02 20:39:52,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:39:52,714 INFO L225 Difference]: With dead ends: 15720 [2018-12-02 20:39:52,714 INFO L226 Difference]: Without dead ends: 15720 [2018-12-02 20:39:52,714 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 20:39:52,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15720 states. [2018-12-02 20:39:52,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15720 to 15448. [2018-12-02 20:39:52,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15448 states. [2018-12-02 20:39:52,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15448 states to 15448 states and 47475 transitions. [2018-12-02 20:39:52,873 INFO L78 Accepts]: Start accepts. Automaton has 15448 states and 47475 transitions. Word has length 68 [2018-12-02 20:39:52,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:39:52,873 INFO L480 AbstractCegarLoop]: Abstraction has 15448 states and 47475 transitions. [2018-12-02 20:39:52,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 20:39:52,873 INFO L276 IsEmpty]: Start isEmpty. Operand 15448 states and 47475 transitions. [2018-12-02 20:39:52,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-02 20:39:52,881 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:39:52,881 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 20:39:52,881 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:39:52,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:39:52,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1509935379, now seen corresponding path program 1 times [2018-12-02 20:39:52,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:39:52,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:52,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:39:52,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:52,883 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:39:52,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:39:52,932 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 20:39:52,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:39:52,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 20:39:52,932 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:39:52,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 20:39:52,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 20:39:52,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 20:39:52,933 INFO L87 Difference]: Start difference. First operand 15448 states and 47475 transitions. Second operand 6 states. [2018-12-02 20:39:53,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:39:53,542 INFO L93 Difference]: Finished difference Result 18771 states and 56913 transitions. [2018-12-02 20:39:53,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 20:39:53,543 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2018-12-02 20:39:53,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:39:53,563 INFO L225 Difference]: With dead ends: 18771 [2018-12-02 20:39:53,563 INFO L226 Difference]: Without dead ends: 18771 [2018-12-02 20:39:53,563 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 20:39:53,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18771 states. [2018-12-02 20:39:53,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18771 to 17775. [2018-12-02 20:39:53,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17775 states. [2018-12-02 20:39:53,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17775 states to 17775 states and 54207 transitions. [2018-12-02 20:39:53,744 INFO L78 Accepts]: Start accepts. Automaton has 17775 states and 54207 transitions. Word has length 70 [2018-12-02 20:39:53,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:39:53,745 INFO L480 AbstractCegarLoop]: Abstraction has 17775 states and 54207 transitions. [2018-12-02 20:39:53,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 20:39:53,745 INFO L276 IsEmpty]: Start isEmpty. Operand 17775 states and 54207 transitions. [2018-12-02 20:39:53,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-02 20:39:53,755 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:39:53,755 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 20:39:53,755 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:39:53,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:39:53,755 INFO L82 PathProgramCache]: Analyzing trace with hash -567273964, now seen corresponding path program 1 times [2018-12-02 20:39:53,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:39:53,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:53,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:39:53,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:53,756 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:39:53,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:39:53,827 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 20:39:53,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:39:53,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 20:39:53,827 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:39:53,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 20:39:53,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 20:39:53,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 20:39:53,827 INFO L87 Difference]: Start difference. First operand 17775 states and 54207 transitions. Second operand 6 states. [2018-12-02 20:39:54,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:39:54,103 INFO L93 Difference]: Finished difference Result 20829 states and 61550 transitions. [2018-12-02 20:39:54,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 20:39:54,103 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2018-12-02 20:39:54,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:39:54,122 INFO L225 Difference]: With dead ends: 20829 [2018-12-02 20:39:54,122 INFO L226 Difference]: Without dead ends: 20829 [2018-12-02 20:39:54,122 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 20:39:54,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20829 states. [2018-12-02 20:39:54,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20829 to 18076. [2018-12-02 20:39:54,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18076 states. [2018-12-02 20:39:54,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18076 states to 18076 states and 54063 transitions. [2018-12-02 20:39:54,305 INFO L78 Accepts]: Start accepts. Automaton has 18076 states and 54063 transitions. Word has length 70 [2018-12-02 20:39:54,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:39:54,305 INFO L480 AbstractCegarLoop]: Abstraction has 18076 states and 54063 transitions. [2018-12-02 20:39:54,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 20:39:54,306 INFO L276 IsEmpty]: Start isEmpty. Operand 18076 states and 54063 transitions. [2018-12-02 20:39:54,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-02 20:39:54,316 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:39:54,316 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 20:39:54,317 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:39:54,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:39:54,317 INFO L82 PathProgramCache]: Analyzing trace with hash -355923051, now seen corresponding path program 1 times [2018-12-02 20:39:54,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:39:54,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:54,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:39:54,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:54,318 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:39:54,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:39:54,365 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 20:39:54,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:39:54,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 20:39:54,365 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:39:54,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 20:39:54,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 20:39:54,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 20:39:54,366 INFO L87 Difference]: Start difference. First operand 18076 states and 54063 transitions. Second operand 5 states. [2018-12-02 20:39:54,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:39:54,554 INFO L93 Difference]: Finished difference Result 22793 states and 67730 transitions. [2018-12-02 20:39:54,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 20:39:54,555 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-12-02 20:39:54,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:39:54,578 INFO L225 Difference]: With dead ends: 22793 [2018-12-02 20:39:54,578 INFO L226 Difference]: Without dead ends: 22793 [2018-12-02 20:39:54,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 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 20:39:54,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22793 states. [2018-12-02 20:39:54,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22793 to 19399. [2018-12-02 20:39:54,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19399 states. [2018-12-02 20:39:54,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19399 states to 19399 states and 57544 transitions. [2018-12-02 20:39:54,772 INFO L78 Accepts]: Start accepts. Automaton has 19399 states and 57544 transitions. Word has length 70 [2018-12-02 20:39:54,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:39:54,772 INFO L480 AbstractCegarLoop]: Abstraction has 19399 states and 57544 transitions. [2018-12-02 20:39:54,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 20:39:54,772 INFO L276 IsEmpty]: Start isEmpty. Operand 19399 states and 57544 transitions. [2018-12-02 20:39:54,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-02 20:39:54,782 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:39:54,782 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 20:39:54,782 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:39:54,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:39:54,782 INFO L82 PathProgramCache]: Analyzing trace with hash -866457228, now seen corresponding path program 1 times [2018-12-02 20:39:54,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:39:54,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:54,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:39:54,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:54,783 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:39:54,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:39:54,850 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 20:39:54,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:39:54,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 20:39:54,850 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:39:54,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 20:39:54,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 20:39:54,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 20:39:54,851 INFO L87 Difference]: Start difference. First operand 19399 states and 57544 transitions. Second operand 5 states. [2018-12-02 20:39:55,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:39:55,148 INFO L93 Difference]: Finished difference Result 26466 states and 78091 transitions. [2018-12-02 20:39:55,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 20:39:55,149 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-12-02 20:39:55,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:39:55,178 INFO L225 Difference]: With dead ends: 26466 [2018-12-02 20:39:55,178 INFO L226 Difference]: Without dead ends: 26466 [2018-12-02 20:39:55,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 20:39:55,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26466 states. [2018-12-02 20:39:55,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26466 to 20584. [2018-12-02 20:39:55,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20584 states. [2018-12-02 20:39:55,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20584 states to 20584 states and 61050 transitions. [2018-12-02 20:39:55,422 INFO L78 Accepts]: Start accepts. Automaton has 20584 states and 61050 transitions. Word has length 70 [2018-12-02 20:39:55,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:39:55,422 INFO L480 AbstractCegarLoop]: Abstraction has 20584 states and 61050 transitions. [2018-12-02 20:39:55,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 20:39:55,422 INFO L276 IsEmpty]: Start isEmpty. Operand 20584 states and 61050 transitions. [2018-12-02 20:39:55,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-02 20:39:55,433 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:39:55,433 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 20:39:55,433 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:39:55,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:39:55,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1621055605, now seen corresponding path program 1 times [2018-12-02 20:39:55,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:39:55,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:55,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:39:55,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:55,434 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:39:55,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:39:55,467 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 20:39:55,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:39:55,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 20:39:55,467 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:39:55,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 20:39:55,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 20:39:55,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 20:39:55,468 INFO L87 Difference]: Start difference. First operand 20584 states and 61050 transitions. Second operand 4 states. [2018-12-02 20:39:55,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:39:55,801 INFO L93 Difference]: Finished difference Result 28448 states and 84504 transitions. [2018-12-02 20:39:55,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 20:39:55,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2018-12-02 20:39:55,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:39:55,836 INFO L225 Difference]: With dead ends: 28448 [2018-12-02 20:39:55,836 INFO L226 Difference]: Without dead ends: 28028 [2018-12-02 20:39:55,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 20:39:55,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28028 states. [2018-12-02 20:39:56,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28028 to 25836. [2018-12-02 20:39:56,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25836 states. [2018-12-02 20:39:56,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25836 states to 25836 states and 76852 transitions. [2018-12-02 20:39:56,159 INFO L78 Accepts]: Start accepts. Automaton has 25836 states and 76852 transitions. Word has length 70 [2018-12-02 20:39:56,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:39:56,159 INFO L480 AbstractCegarLoop]: Abstraction has 25836 states and 76852 transitions. [2018-12-02 20:39:56,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 20:39:56,160 INFO L276 IsEmpty]: Start isEmpty. Operand 25836 states and 76852 transitions. [2018-12-02 20:39:56,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-02 20:39:56,172 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:39:56,172 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 20:39:56,172 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:39:56,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:39:56,172 INFO L82 PathProgramCache]: Analyzing trace with hash -175895754, now seen corresponding path program 1 times [2018-12-02 20:39:56,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:39:56,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:56,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:39:56,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:56,173 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:39:56,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:39:56,207 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 20:39:56,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:39:56,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 20:39:56,208 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:39:56,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 20:39:56,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 20:39:56,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 20:39:56,208 INFO L87 Difference]: Start difference. First operand 25836 states and 76852 transitions. Second operand 5 states. [2018-12-02 20:39:56,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:39:56,236 INFO L93 Difference]: Finished difference Result 7052 states and 16992 transitions. [2018-12-02 20:39:56,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 20:39:56,237 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-12-02 20:39:56,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:39:56,240 INFO L225 Difference]: With dead ends: 7052 [2018-12-02 20:39:56,241 INFO L226 Difference]: Without dead ends: 5565 [2018-12-02 20:39:56,241 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 20:39:56,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5565 states. [2018-12-02 20:39:56,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5565 to 4891. [2018-12-02 20:39:56,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4891 states. [2018-12-02 20:39:56,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4891 states to 4891 states and 11544 transitions. [2018-12-02 20:39:56,277 INFO L78 Accepts]: Start accepts. Automaton has 4891 states and 11544 transitions. Word has length 70 [2018-12-02 20:39:56,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:39:56,277 INFO L480 AbstractCegarLoop]: Abstraction has 4891 states and 11544 transitions. [2018-12-02 20:39:56,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 20:39:56,277 INFO L276 IsEmpty]: Start isEmpty. Operand 4891 states and 11544 transitions. [2018-12-02 20:39:56,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-02 20:39:56,280 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:39:56,280 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] [2018-12-02 20:39:56,281 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:39:56,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:39:56,281 INFO L82 PathProgramCache]: Analyzing trace with hash 912313909, now seen corresponding path program 1 times [2018-12-02 20:39:56,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:39:56,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:56,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:39:56,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:56,282 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:39:56,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:39:56,355 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 20:39:56,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:39:56,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 20:39:56,355 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:39:56,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 20:39:56,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 20:39:56,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 20:39:56,356 INFO L87 Difference]: Start difference. First operand 4891 states and 11544 transitions. Second operand 7 states. [2018-12-02 20:39:56,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:39:56,609 INFO L93 Difference]: Finished difference Result 6133 states and 14405 transitions. [2018-12-02 20:39:56,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 20:39:56,610 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2018-12-02 20:39:56,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:39:56,614 INFO L225 Difference]: With dead ends: 6133 [2018-12-02 20:39:56,614 INFO L226 Difference]: Without dead ends: 6133 [2018-12-02 20:39:56,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 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 20:39:56,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6133 states. [2018-12-02 20:39:56,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6133 to 5041. [2018-12-02 20:39:56,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5041 states. [2018-12-02 20:39:56,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5041 states to 5041 states and 11934 transitions. [2018-12-02 20:39:56,652 INFO L78 Accepts]: Start accepts. Automaton has 5041 states and 11934 transitions. Word has length 85 [2018-12-02 20:39:56,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:39:56,652 INFO L480 AbstractCegarLoop]: Abstraction has 5041 states and 11934 transitions. [2018-12-02 20:39:56,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 20:39:56,652 INFO L276 IsEmpty]: Start isEmpty. Operand 5041 states and 11934 transitions. [2018-12-02 20:39:56,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-02 20:39:56,656 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:39:56,656 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] [2018-12-02 20:39:56,656 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:39:56,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:39:56,656 INFO L82 PathProgramCache]: Analyzing trace with hash 581741880, now seen corresponding path program 1 times [2018-12-02 20:39:56,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:39:56,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:56,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:39:56,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:56,658 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:39:56,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:39:56,695 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 20:39:56,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:39:56,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 20:39:56,696 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:39:56,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 20:39:56,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 20:39:56,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 20:39:56,696 INFO L87 Difference]: Start difference. First operand 5041 states and 11934 transitions. Second operand 5 states. [2018-12-02 20:39:56,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:39:56,819 INFO L93 Difference]: Finished difference Result 5883 states and 13764 transitions. [2018-12-02 20:39:56,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 20:39:56,819 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2018-12-02 20:39:56,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:39:56,823 INFO L225 Difference]: With dead ends: 5883 [2018-12-02 20:39:56,823 INFO L226 Difference]: Without dead ends: 5849 [2018-12-02 20:39:56,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 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 20:39:56,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5849 states. [2018-12-02 20:39:56,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5849 to 5197. [2018-12-02 20:39:56,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5197 states. [2018-12-02 20:39:56,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5197 states to 5197 states and 12242 transitions. [2018-12-02 20:39:56,858 INFO L78 Accepts]: Start accepts. Automaton has 5197 states and 12242 transitions. Word has length 85 [2018-12-02 20:39:56,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:39:56,858 INFO L480 AbstractCegarLoop]: Abstraction has 5197 states and 12242 transitions. [2018-12-02 20:39:56,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 20:39:56,858 INFO L276 IsEmpty]: Start isEmpty. Operand 5197 states and 12242 transitions. [2018-12-02 20:39:56,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-02 20:39:56,861 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:39:56,861 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] [2018-12-02 20:39:56,862 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:39:56,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:39:56,862 INFO L82 PathProgramCache]: Analyzing trace with hash -793157718, now seen corresponding path program 2 times [2018-12-02 20:39:56,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:39:56,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:56,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:39:56,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:56,863 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:39:56,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:39:56,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 20:39:56,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:39:56,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 20:39:56,933 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:39:56,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 20:39:56,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 20:39:56,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 20:39:56,934 INFO L87 Difference]: Start difference. First operand 5197 states and 12242 transitions. Second operand 6 states. [2018-12-02 20:39:56,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:39:56,963 INFO L93 Difference]: Finished difference Result 4941 states and 11426 transitions. [2018-12-02 20:39:56,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 20:39:56,963 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2018-12-02 20:39:56,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:39:56,966 INFO L225 Difference]: With dead ends: 4941 [2018-12-02 20:39:56,966 INFO L226 Difference]: Without dead ends: 4941 [2018-12-02 20:39:56,967 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 20:39:56,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4941 states. [2018-12-02 20:39:56,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4941 to 3289. [2018-12-02 20:39:56,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3289 states. [2018-12-02 20:39:56,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3289 states to 3289 states and 7670 transitions. [2018-12-02 20:39:56,993 INFO L78 Accepts]: Start accepts. Automaton has 3289 states and 7670 transitions. Word has length 85 [2018-12-02 20:39:56,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:39:56,993 INFO L480 AbstractCegarLoop]: Abstraction has 3289 states and 7670 transitions. [2018-12-02 20:39:56,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 20:39:56,993 INFO L276 IsEmpty]: Start isEmpty. Operand 3289 states and 7670 transitions. [2018-12-02 20:39:56,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-02 20:39:56,995 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:39:56,995 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] [2018-12-02 20:39:56,995 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:39:56,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:39:56,995 INFO L82 PathProgramCache]: Analyzing trace with hash 358607745, now seen corresponding path program 1 times [2018-12-02 20:39:56,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:39:56,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:56,996 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 20:39:56,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:56,996 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:39:57,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:39:57,089 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 20:39:57,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:39:57,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 20:39:57,090 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:39:57,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 20:39:57,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 20:39:57,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-02 20:39:57,090 INFO L87 Difference]: Start difference. First operand 3289 states and 7670 transitions. Second operand 10 states. [2018-12-02 20:39:57,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:39:57,458 INFO L93 Difference]: Finished difference Result 6298 states and 14804 transitions. [2018-12-02 20:39:57,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 20:39:57,458 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 87 [2018-12-02 20:39:57,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:39:57,460 INFO L225 Difference]: With dead ends: 6298 [2018-12-02 20:39:57,460 INFO L226 Difference]: Without dead ends: 2478 [2018-12-02 20:39:57,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-12-02 20:39:57,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2478 states. [2018-12-02 20:39:57,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2478 to 2478. [2018-12-02 20:39:57,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2478 states. [2018-12-02 20:39:57,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2478 states to 2478 states and 5845 transitions. [2018-12-02 20:39:57,475 INFO L78 Accepts]: Start accepts. Automaton has 2478 states and 5845 transitions. Word has length 87 [2018-12-02 20:39:57,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:39:57,475 INFO L480 AbstractCegarLoop]: Abstraction has 2478 states and 5845 transitions. [2018-12-02 20:39:57,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 20:39:57,475 INFO L276 IsEmpty]: Start isEmpty. Operand 2478 states and 5845 transitions. [2018-12-02 20:39:57,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-02 20:39:57,476 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:39:57,476 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] [2018-12-02 20:39:57,476 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:39:57,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:39:57,477 INFO L82 PathProgramCache]: Analyzing trace with hash 792045687, now seen corresponding path program 2 times [2018-12-02 20:39:57,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:39:57,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:57,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:39:57,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:57,478 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:39:57,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:39:57,560 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 20:39:57,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:39:57,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 20:39:57,560 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:39:57,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 20:39:57,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 20:39:57,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-02 20:39:57,561 INFO L87 Difference]: Start difference. First operand 2478 states and 5845 transitions. Second operand 11 states. [2018-12-02 20:39:58,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:39:58,128 INFO L93 Difference]: Finished difference Result 4068 states and 9576 transitions. [2018-12-02 20:39:58,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 20:39:58,129 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 87 [2018-12-02 20:39:58,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:39:58,131 INFO L225 Difference]: With dead ends: 4068 [2018-12-02 20:39:58,132 INFO L226 Difference]: Without dead ends: 2719 [2018-12-02 20:39:58,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2018-12-02 20:39:58,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2719 states. [2018-12-02 20:39:58,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2719 to 2513. [2018-12-02 20:39:58,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2513 states. [2018-12-02 20:39:58,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2513 states to 2513 states and 5872 transitions. [2018-12-02 20:39:58,155 INFO L78 Accepts]: Start accepts. Automaton has 2513 states and 5872 transitions. Word has length 87 [2018-12-02 20:39:58,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:39:58,155 INFO L480 AbstractCegarLoop]: Abstraction has 2513 states and 5872 transitions. [2018-12-02 20:39:58,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 20:39:58,155 INFO L276 IsEmpty]: Start isEmpty. Operand 2513 states and 5872 transitions. [2018-12-02 20:39:58,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-02 20:39:58,158 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:39:58,158 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] [2018-12-02 20:39:58,158 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:39:58,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:39:58,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1869156796, now seen corresponding path program 1 times [2018-12-02 20:39:58,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:39:58,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:58,160 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 20:39:58,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:58,160 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:39:58,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:39:58,230 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 20:39:58,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:39:58,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 20:39:58,230 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:39:58,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 20:39:58,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 20:39:58,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 20:39:58,231 INFO L87 Difference]: Start difference. First operand 2513 states and 5872 transitions. Second operand 6 states. [2018-12-02 20:39:58,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:39:58,358 INFO L93 Difference]: Finished difference Result 2692 states and 6176 transitions. [2018-12-02 20:39:58,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 20:39:58,358 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2018-12-02 20:39:58,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:39:58,360 INFO L225 Difference]: With dead ends: 2692 [2018-12-02 20:39:58,360 INFO L226 Difference]: Without dead ends: 2634 [2018-12-02 20:39:58,360 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 20:39:58,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2634 states. [2018-12-02 20:39:58,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2634 to 2280. [2018-12-02 20:39:58,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2280 states. [2018-12-02 20:39:58,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2280 states to 2280 states and 5231 transitions. [2018-12-02 20:39:58,374 INFO L78 Accepts]: Start accepts. Automaton has 2280 states and 5231 transitions. Word has length 87 [2018-12-02 20:39:58,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:39:58,375 INFO L480 AbstractCegarLoop]: Abstraction has 2280 states and 5231 transitions. [2018-12-02 20:39:58,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 20:39:58,375 INFO L276 IsEmpty]: Start isEmpty. Operand 2280 states and 5231 transitions. [2018-12-02 20:39:58,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-02 20:39:58,376 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:39:58,376 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] [2018-12-02 20:39:58,377 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:39:58,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:39:58,377 INFO L82 PathProgramCache]: Analyzing trace with hash -208052547, now seen corresponding path program 3 times [2018-12-02 20:39:58,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:39:58,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:58,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:39:58,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:58,378 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:39:58,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:39:58,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:39:58,423 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 20:39:58,521 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 20:39:58,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 08:39:58 BasicIcfg [2018-12-02 20:39:58,522 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 20:39:58,523 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 20:39:58,523 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 20:39:58,523 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 20:39:58,523 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:39:47" (3/4) ... [2018-12-02 20:39:58,526 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 20:39:58,631 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_8bec92a1-8781-46ab-9cae-0596eab80e6c/bin-2019/utaipan/witness.graphml [2018-12-02 20:39:58,631 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 20:39:58,632 INFO L168 Benchmark]: Toolchain (without parser) took 11960.04 ms. Allocated memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: 1.3 GB). Free memory was 956.0 MB in the beginning and 2.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 228.8 MB. Max. memory is 11.5 GB. [2018-12-02 20:39:58,633 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 20:39:58,633 INFO L168 Benchmark]: CACSL2BoogieTranslator took 356.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -182.2 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. [2018-12-02 20:39:58,633 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-02 20:39:58,633 INFO L168 Benchmark]: Boogie Preprocessor took 19.74 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 20:39:58,633 INFO L168 Benchmark]: RCFGBuilder took 312.73 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: 48.3 MB). Peak memory consumption was 48.3 MB. Max. memory is 11.5 GB. [2018-12-02 20:39:58,634 INFO L168 Benchmark]: TraceAbstraction took 11128.32 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: -995.7 MB). Peak memory consumption was 167.7 MB. Max. memory is 11.5 GB. [2018-12-02 20:39:58,634 INFO L168 Benchmark]: Witness Printer took 108.05 ms. Allocated memory is still 2.4 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. [2018-12-02 20:39:58,635 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 356.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -182.2 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.74 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 312.73 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: 48.3 MB). Peak memory consumption was 48.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11128.32 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: -995.7 MB). Peak memory consumption was 167.7 MB. Max. memory is 11.5 GB. * Witness Printer took 108.05 ms. Allocated memory is still 2.4 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L678] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L680] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L682] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0] [L683] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0] [L684] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L686] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L688] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L689] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L690] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L691] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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] [L692] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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] [L693] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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] [L694] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L695] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L696] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L697] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L698] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L699] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L700] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L701] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L702] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L704] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L705] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L706] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] -1 pthread_t t845; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L787] FCALL, FORK -1 pthread_create(&t845, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] -1 pthread_t t846; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L789] FCALL, FORK -1 pthread_create(&t846, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L744] 0 y$w_buff1 = y$w_buff0 [L745] 0 y$w_buff0 = 1 [L746] 0 y$w_buff1_used = y$w_buff0_used [L747] 0 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L749] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L750] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L751] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L752] 0 y$r_buff0_thd2 = (_Bool)1 [L755] 0 z = 1 [L758] 0 __unbuffered_p1_EAX = z [L761] 0 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L764] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L710] 1 a = 1 [L713] 1 x = 1 [L716] 1 __unbuffered_p0_EAX = x [L719] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L720] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L721] 1 y$flush_delayed = weak$$choice2 [L722] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L723] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L723] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L724] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L724] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L725] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L725] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L726] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L726] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L727] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L727] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L728] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L728] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L729] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L730] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L731] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L764] 0 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L731] 1 y = y$flush_delayed ? y$mem_tmp : y [L732] 1 y$flush_delayed = (_Bool)0 [L737] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L766] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L767] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L767] 0 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L768] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L768] 0 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L771] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L795] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L795] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L795] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L795] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L796] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L796] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L797] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L798] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L799] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L802] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 202 locations, 3 error locations. UNSAFE Result, 11.0s OverallTime, 22 OverallIterations, 1 TraceHistogramMax, 5.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5596 SDtfs, 6293 SDslu, 11822 SDs, 0 SdLazy, 4758 SolverSat, 271 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 188 GetRequests, 49 SyntacticMatches, 14 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27858occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.9s AutomataMinimizationTime, 21 MinimizatonAttempts, 52732 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1539 NumberOfCodeBlocks, 1539 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1431 ConstructedInterpolants, 0 QuantifiedInterpolants, 256560 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...