./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix052_tso.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_bcca008d-9dae-462b-aa6c-b81e7cf12567/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bcca008d-9dae-462b-aa6c-b81e7cf12567/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bcca008d-9dae-462b-aa6c-b81e7cf12567/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bcca008d-9dae-462b-aa6c-b81e7cf12567/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix052_tso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_bcca008d-9dae-462b-aa6c-b81e7cf12567/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bcca008d-9dae-462b-aa6c-b81e7cf12567/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 f5d2b9fff434c5c9e398eac1a44a685c754dda56 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-03 01:20:02,133 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 01:20:02,134 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 01:20:02,141 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 01:20:02,141 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 01:20:02,141 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 01:20:02,142 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 01:20:02,143 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 01:20:02,144 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 01:20:02,145 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 01:20:02,145 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 01:20:02,145 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 01:20:02,146 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 01:20:02,147 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 01:20:02,147 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 01:20:02,148 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 01:20:02,148 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 01:20:02,149 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 01:20:02,150 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 01:20:02,151 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 01:20:02,152 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 01:20:02,152 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 01:20:02,154 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 01:20:02,154 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 01:20:02,154 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 01:20:02,154 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 01:20:02,155 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 01:20:02,155 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 01:20:02,156 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 01:20:02,157 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 01:20:02,157 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 01:20:02,157 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 01:20:02,157 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 01:20:02,157 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 01:20:02,158 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 01:20:02,158 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 01:20:02,159 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bcca008d-9dae-462b-aa6c-b81e7cf12567/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-03 01:20:02,166 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 01:20:02,166 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 01:20:02,167 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 01:20:02,167 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 01:20:02,167 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 01:20:02,167 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 01:20:02,167 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 01:20:02,167 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 01:20:02,167 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 01:20:02,167 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 01:20:02,168 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 01:20:02,168 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 01:20:02,168 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 01:20:02,168 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 01:20:02,168 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 01:20:02,169 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 01:20:02,169 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 01:20:02,169 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 01:20:02,169 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 01:20:02,169 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 01:20:02,169 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 01:20:02,169 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 01:20:02,169 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 01:20:02,169 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 01:20:02,170 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 01:20:02,170 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 01:20:02,170 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 01:20:02,170 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 01:20:02,170 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 01:20:02,170 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 01:20:02,170 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 01:20:02,171 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 01:20:02,171 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 01:20:02,171 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 01:20:02,171 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 01:20:02,171 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 01:20:02,171 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_bcca008d-9dae-462b-aa6c-b81e7cf12567/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 -> f5d2b9fff434c5c9e398eac1a44a685c754dda56 [2018-12-03 01:20:02,188 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 01:20:02,195 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 01:20:02,197 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 01:20:02,198 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 01:20:02,198 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 01:20:02,199 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bcca008d-9dae-462b-aa6c-b81e7cf12567/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix052_tso.opt_false-unreach-call.i [2018-12-03 01:20:02,234 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bcca008d-9dae-462b-aa6c-b81e7cf12567/bin-2019/utaipan/data/a68a51e2f/84c62467033b4b2a984993be433573c8/FLAG0aca2d961 [2018-12-03 01:20:02,722 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 01:20:02,723 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bcca008d-9dae-462b-aa6c-b81e7cf12567/sv-benchmarks/c/pthread-wmm/mix052_tso.opt_false-unreach-call.i [2018-12-03 01:20:02,731 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bcca008d-9dae-462b-aa6c-b81e7cf12567/bin-2019/utaipan/data/a68a51e2f/84c62467033b4b2a984993be433573c8/FLAG0aca2d961 [2018-12-03 01:20:03,219 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bcca008d-9dae-462b-aa6c-b81e7cf12567/bin-2019/utaipan/data/a68a51e2f/84c62467033b4b2a984993be433573c8 [2018-12-03 01:20:03,221 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 01:20:03,222 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 01:20:03,223 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 01:20:03,223 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 01:20:03,225 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 01:20:03,226 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 01:20:03" (1/1) ... [2018-12-03 01:20:03,228 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7014c445 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:20:03, skipping insertion in model container [2018-12-03 01:20:03,228 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 01:20:03" (1/1) ... [2018-12-03 01:20:03,234 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 01:20:03,259 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 01:20:03,447 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 01:20:03,455 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 01:20:03,537 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 01:20:03,568 INFO L195 MainTranslator]: Completed translation [2018-12-03 01:20:03,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:20:03 WrapperNode [2018-12-03 01:20:03,568 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 01:20:03,569 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 01:20:03,569 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 01:20:03,569 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 01:20:03,574 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:20:03" (1/1) ... [2018-12-03 01:20:03,584 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:20:03" (1/1) ... [2018-12-03 01:20:03,599 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 01:20:03,600 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 01:20:03,600 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 01:20:03,600 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 01:20:03,605 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:20:03" (1/1) ... [2018-12-03 01:20:03,606 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:20:03" (1/1) ... [2018-12-03 01:20:03,608 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:20:03" (1/1) ... [2018-12-03 01:20:03,608 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:20:03" (1/1) ... [2018-12-03 01:20:03,613 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:20:03" (1/1) ... [2018-12-03 01:20:03,615 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:20:03" (1/1) ... [2018-12-03 01:20:03,617 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:20:03" (1/1) ... [2018-12-03 01:20:03,619 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 01:20:03,619 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 01:20:03,619 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 01:20:03,619 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 01:20:03,620 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:20:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bcca008d-9dae-462b-aa6c-b81e7cf12567/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-03 01:20:03,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 01:20:03,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-03 01:20:03,652 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-03 01:20:03,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-03 01:20:03,652 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-03 01:20:03,652 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-03 01:20:03,652 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-03 01:20:03,652 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-03 01:20:03,652 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-03 01:20:03,653 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-03 01:20:03,653 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-03 01:20:03,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 01:20:03,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 01:20:03,654 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-03 01:20:03,942 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 01:20:03,943 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-03 01:20:03,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:20:03 BoogieIcfgContainer [2018-12-03 01:20:03,943 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 01:20:03,943 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 01:20:03,943 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 01:20:03,945 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 01:20:03,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 01:20:03" (1/3) ... [2018-12-03 01:20:03,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5059535b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 01:20:03, skipping insertion in model container [2018-12-03 01:20:03,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:20:03" (2/3) ... [2018-12-03 01:20:03,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5059535b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 01:20:03, skipping insertion in model container [2018-12-03 01:20:03,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:20:03" (3/3) ... [2018-12-03 01:20:03,947 INFO L112 eAbstractionObserver]: Analyzing ICFG mix052_tso.opt_false-unreach-call.i [2018-12-03 01:20:03,971 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,971 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,971 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,971 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,971 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,972 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,972 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,972 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,972 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,972 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,972 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,972 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,972 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,973 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,973 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,973 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,973 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,973 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,973 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,973 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,973 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,973 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,973 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,973 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,973 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,974 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,974 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,974 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,974 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,974 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,974 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,974 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,974 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,974 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,974 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,974 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,975 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,975 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,975 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,975 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,975 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,975 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,975 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,975 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,975 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,975 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,976 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,976 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,976 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,976 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,976 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,976 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,976 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,976 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,976 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,976 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,977 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,977 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,977 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,977 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,977 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,977 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,977 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,977 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,977 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,977 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,977 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,978 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,978 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,978 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,978 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,978 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,978 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,978 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,978 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,978 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,978 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,979 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,979 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,979 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,979 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,979 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,979 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,979 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,979 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,979 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,979 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,979 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,980 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,980 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,980 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,980 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,980 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,980 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,980 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,980 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,980 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,980 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,980 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,981 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,981 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,981 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,981 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,981 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,981 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,981 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,981 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,981 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,981 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,981 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,981 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,981 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,982 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,982 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,982 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,982 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,982 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,982 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,982 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,982 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,982 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,983 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,983 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,983 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,983 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,983 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,983 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,983 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,983 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,983 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,983 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,983 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,983 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,984 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,984 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,984 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,984 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,984 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,984 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,984 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,984 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,984 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,984 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,985 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,985 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,985 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,985 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,985 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,985 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,985 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:20:03,991 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-03 01:20:03,991 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 01:20:03,999 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-03 01:20:04,013 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-03 01:20:04,034 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 01:20:04,035 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 01:20:04,035 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 01:20:04,035 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 01:20:04,035 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 01:20:04,035 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 01:20:04,035 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 01:20:04,035 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 01:20:04,044 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 144places, 175 transitions [2018-12-03 01:20:24,072 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 149043 states. [2018-12-03 01:20:24,073 INFO L276 IsEmpty]: Start isEmpty. Operand 149043 states. [2018-12-03 01:20:24,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 01:20:24,080 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:20:24,080 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:20:24,082 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:20:24,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:20:24,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1052590070, now seen corresponding path program 1 times [2018-12-03 01:20:24,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:20:24,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:20:24,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:20:24,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:20:24,121 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:20:24,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:20:24,259 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-03 01:20:24,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:20:24,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:20:24,261 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:20:24,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:20:24,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:20:24,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:20:24,276 INFO L87 Difference]: Start difference. First operand 149043 states. Second operand 4 states. [2018-12-03 01:20:25,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:20:25,631 INFO L93 Difference]: Finished difference Result 257063 states and 1188602 transitions. [2018-12-03 01:20:25,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:20:25,633 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-12-03 01:20:25,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:20:26,285 INFO L225 Difference]: With dead ends: 257063 [2018-12-03 01:20:26,285 INFO L226 Difference]: Without dead ends: 174813 [2018-12-03 01:20:26,286 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-03 01:20:29,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174813 states. [2018-12-03 01:20:30,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174813 to 110553. [2018-12-03 01:20:30,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110553 states. [2018-12-03 01:20:31,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110553 states to 110553 states and 511484 transitions. [2018-12-03 01:20:31,374 INFO L78 Accepts]: Start accepts. Automaton has 110553 states and 511484 transitions. Word has length 44 [2018-12-03 01:20:31,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:20:31,375 INFO L480 AbstractCegarLoop]: Abstraction has 110553 states and 511484 transitions. [2018-12-03 01:20:31,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:20:31,375 INFO L276 IsEmpty]: Start isEmpty. Operand 110553 states and 511484 transitions. [2018-12-03 01:20:31,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 01:20:31,385 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:20:31,386 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-03 01:20:31,386 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:20:31,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:20:31,386 INFO L82 PathProgramCache]: Analyzing trace with hash 835996618, now seen corresponding path program 1 times [2018-12-03 01:20:31,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:20:31,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:20:31,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:20:31,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:20:31,389 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:20:31,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:20:31,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:20:31,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:20:31,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 01:20:31,436 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:20:31,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 01:20:31,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 01:20:31,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:20:31,438 INFO L87 Difference]: Start difference. First operand 110553 states and 511484 transitions. Second operand 5 states. [2018-12-03 01:20:32,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:20:32,697 INFO L93 Difference]: Finished difference Result 240603 states and 1068739 transitions. [2018-12-03 01:20:32,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 01:20:32,698 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-12-03 01:20:32,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:20:33,386 INFO L225 Difference]: With dead ends: 240603 [2018-12-03 01:20:33,387 INFO L226 Difference]: Without dead ends: 237053 [2018-12-03 01:20:33,387 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-03 01:20:34,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237053 states. [2018-12-03 01:20:36,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237053 to 160433. [2018-12-03 01:20:36,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160433 states. [2018-12-03 01:20:41,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160433 states to 160433 states and 716928 transitions. [2018-12-03 01:20:41,156 INFO L78 Accepts]: Start accepts. Automaton has 160433 states and 716928 transitions. Word has length 52 [2018-12-03 01:20:41,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:20:41,157 INFO L480 AbstractCegarLoop]: Abstraction has 160433 states and 716928 transitions. [2018-12-03 01:20:41,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 01:20:41,157 INFO L276 IsEmpty]: Start isEmpty. Operand 160433 states and 716928 transitions. [2018-12-03 01:20:41,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 01:20:41,165 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:20:41,165 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:20:41,166 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:20:41,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:20:41,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1522037347, now seen corresponding path program 1 times [2018-12-03 01:20:41,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:20:41,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:20:41,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:20:41,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:20:41,168 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:20:41,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:20:41,214 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-03 01:20:41,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:20:41,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 01:20:41,214 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:20:41,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 01:20:41,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 01:20:41,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:20:41,215 INFO L87 Difference]: Start difference. First operand 160433 states and 716928 transitions. Second operand 5 states. [2018-12-03 01:20:42,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:20:42,893 INFO L93 Difference]: Finished difference Result 317173 states and 1405285 transitions. [2018-12-03 01:20:42,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 01:20:42,894 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-12-03 01:20:42,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:20:44,176 INFO L225 Difference]: With dead ends: 317173 [2018-12-03 01:20:44,176 INFO L226 Difference]: Without dead ends: 314273 [2018-12-03 01:20:44,176 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-03 01:20:45,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314273 states. [2018-12-03 01:20:48,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314273 to 178273. [2018-12-03 01:20:48,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178273 states. [2018-12-03 01:20:48,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178273 states to 178273 states and 791490 transitions. [2018-12-03 01:20:48,915 INFO L78 Accepts]: Start accepts. Automaton has 178273 states and 791490 transitions. Word has length 53 [2018-12-03 01:20:48,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:20:48,915 INFO L480 AbstractCegarLoop]: Abstraction has 178273 states and 791490 transitions. [2018-12-03 01:20:48,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 01:20:48,915 INFO L276 IsEmpty]: Start isEmpty. Operand 178273 states and 791490 transitions. [2018-12-03 01:20:48,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 01:20:48,929 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:20:48,929 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:20:48,929 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:20:48,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:20:48,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1506436157, now seen corresponding path program 1 times [2018-12-03 01:20:48,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:20:48,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:20:48,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:20:48,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:20:48,932 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:20:48,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:20:48,974 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-03 01:20:48,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:20:48,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 01:20:48,975 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:20:48,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 01:20:48,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 01:20:48,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 01:20:48,975 INFO L87 Difference]: Start difference. First operand 178273 states and 791490 transitions. Second operand 3 states. [2018-12-03 01:20:50,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:20:50,053 INFO L93 Difference]: Finished difference Result 231653 states and 1011274 transitions. [2018-12-03 01:20:50,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 01:20:50,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2018-12-03 01:20:50,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:20:53,066 INFO L225 Difference]: With dead ends: 231653 [2018-12-03 01:20:53,066 INFO L226 Difference]: Without dead ends: 231653 [2018-12-03 01:20:53,066 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-03 01:20:54,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231653 states. [2018-12-03 01:20:56,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231653 to 202938. [2018-12-03 01:20:56,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202938 states. [2018-12-03 01:20:57,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202938 states to 202938 states and 893562 transitions. [2018-12-03 01:20:57,335 INFO L78 Accepts]: Start accepts. Automaton has 202938 states and 893562 transitions. Word has length 55 [2018-12-03 01:20:57,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:20:57,336 INFO L480 AbstractCegarLoop]: Abstraction has 202938 states and 893562 transitions. [2018-12-03 01:20:57,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 01:20:57,336 INFO L276 IsEmpty]: Start isEmpty. Operand 202938 states and 893562 transitions. [2018-12-03 01:20:57,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 01:20:57,367 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:20:57,367 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:20:57,367 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:20:57,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:20:57,368 INFO L82 PathProgramCache]: Analyzing trace with hash 420735980, now seen corresponding path program 1 times [2018-12-03 01:20:57,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:20:57,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:20:57,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:20:57,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:20:57,369 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:20:57,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:20:57,433 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-03 01:20:57,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:20:57,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 01:20:57,434 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:20:57,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 01:20:57,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 01:20:57,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 01:20:57,434 INFO L87 Difference]: Start difference. First operand 202938 states and 893562 transitions. Second operand 6 states. [2018-12-03 01:20:59,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:20:59,795 INFO L93 Difference]: Finished difference Result 356173 states and 1552270 transitions. [2018-12-03 01:20:59,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 01:20:59,796 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2018-12-03 01:20:59,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:21:00,707 INFO L225 Difference]: With dead ends: 356173 [2018-12-03 01:21:00,707 INFO L226 Difference]: Without dead ends: 352823 [2018-12-03 01:21:00,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-03 01:21:02,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352823 states. [2018-12-03 01:21:08,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352823 to 205743. [2018-12-03 01:21:08,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205743 states. [2018-12-03 01:21:08,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205743 states to 205743 states and 906781 transitions. [2018-12-03 01:21:08,796 INFO L78 Accepts]: Start accepts. Automaton has 205743 states and 906781 transitions. Word has length 59 [2018-12-03 01:21:08,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:21:08,797 INFO L480 AbstractCegarLoop]: Abstraction has 205743 states and 906781 transitions. [2018-12-03 01:21:08,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 01:21:08,797 INFO L276 IsEmpty]: Start isEmpty. Operand 205743 states and 906781 transitions. [2018-12-03 01:21:08,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 01:21:08,830 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:21:08,830 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:21:08,830 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:21:08,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:21:08,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1962133569, now seen corresponding path program 1 times [2018-12-03 01:21:08,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:21:08,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:21:08,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:21:08,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:21:08,832 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:21:08,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:21:08,904 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-03 01:21:08,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:21:08,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 01:21:08,905 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:21:08,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 01:21:08,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 01:21:08,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-03 01:21:08,905 INFO L87 Difference]: Start difference. First operand 205743 states and 906781 transitions. Second operand 6 states. [2018-12-03 01:21:10,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:21:10,781 INFO L93 Difference]: Finished difference Result 284248 states and 1239485 transitions. [2018-12-03 01:21:10,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 01:21:10,782 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2018-12-03 01:21:10,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:21:11,547 INFO L225 Difference]: With dead ends: 284248 [2018-12-03 01:21:11,547 INFO L226 Difference]: Without dead ends: 278553 [2018-12-03 01:21:11,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-03 01:21:13,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278553 states. [2018-12-03 01:21:19,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278553 to 261028. [2018-12-03 01:21:19,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261028 states. [2018-12-03 01:21:19,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261028 states to 261028 states and 1142704 transitions. [2018-12-03 01:21:19,964 INFO L78 Accepts]: Start accepts. Automaton has 261028 states and 1142704 transitions. Word has length 59 [2018-12-03 01:21:19,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:21:19,964 INFO L480 AbstractCegarLoop]: Abstraction has 261028 states and 1142704 transitions. [2018-12-03 01:21:19,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 01:21:19,964 INFO L276 IsEmpty]: Start isEmpty. Operand 261028 states and 1142704 transitions. [2018-12-03 01:21:20,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 01:21:20,004 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:21:20,004 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:21:20,004 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:21:20,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:21:20,004 INFO L82 PathProgramCache]: Analyzing trace with hash 535882368, now seen corresponding path program 1 times [2018-12-03 01:21:20,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:21:20,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:21:20,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:21:20,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:21:20,006 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:21:20,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:21:20,079 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-03 01:21:20,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:21:20,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 01:21:20,079 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:21:20,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 01:21:20,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 01:21:20,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-03 01:21:20,080 INFO L87 Difference]: Start difference. First operand 261028 states and 1142704 transitions. Second operand 7 states. [2018-12-03 01:21:22,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:21:22,519 INFO L93 Difference]: Finished difference Result 379443 states and 1607921 transitions. [2018-12-03 01:21:22,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 01:21:22,519 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2018-12-03 01:21:22,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:21:24,083 INFO L225 Difference]: With dead ends: 379443 [2018-12-03 01:21:24,084 INFO L226 Difference]: Without dead ends: 379443 [2018-12-03 01:21:24,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-03 01:21:25,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379443 states. [2018-12-03 01:21:32,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379443 to 308618. [2018-12-03 01:21:32,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308618 states. [2018-12-03 01:21:33,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308618 states to 308618 states and 1326661 transitions. [2018-12-03 01:21:33,745 INFO L78 Accepts]: Start accepts. Automaton has 308618 states and 1326661 transitions. Word has length 59 [2018-12-03 01:21:33,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:21:33,746 INFO L480 AbstractCegarLoop]: Abstraction has 308618 states and 1326661 transitions. [2018-12-03 01:21:33,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 01:21:33,746 INFO L276 IsEmpty]: Start isEmpty. Operand 308618 states and 1326661 transitions. [2018-12-03 01:21:33,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 01:21:33,787 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:21:33,787 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:21:33,788 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:21:33,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:21:33,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1423386049, now seen corresponding path program 1 times [2018-12-03 01:21:33,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:21:33,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:21:33,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:21:33,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:21:33,789 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:21:33,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:21:33,830 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-03 01:21:33,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:21:33,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:21:33,831 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:21:33,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:21:33,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:21:33,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:21:33,831 INFO L87 Difference]: Start difference. First operand 308618 states and 1326661 transitions. Second operand 4 states. [2018-12-03 01:21:35,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:21:35,519 INFO L93 Difference]: Finished difference Result 267151 states and 1127019 transitions. [2018-12-03 01:21:35,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 01:21:35,520 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-12-03 01:21:35,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:21:36,178 INFO L225 Difference]: With dead ends: 267151 [2018-12-03 01:21:36,178 INFO L226 Difference]: Without dead ends: 259066 [2018-12-03 01:21:36,178 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-03 01:21:37,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259066 states. [2018-12-03 01:21:40,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259066 to 259066. [2018-12-03 01:21:40,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259066 states. [2018-12-03 01:21:41,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259066 states to 259066 states and 1099297 transitions. [2018-12-03 01:21:41,619 INFO L78 Accepts]: Start accepts. Automaton has 259066 states and 1099297 transitions. Word has length 59 [2018-12-03 01:21:41,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:21:41,619 INFO L480 AbstractCegarLoop]: Abstraction has 259066 states and 1099297 transitions. [2018-12-03 01:21:41,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:21:41,619 INFO L276 IsEmpty]: Start isEmpty. Operand 259066 states and 1099297 transitions. [2018-12-03 01:21:41,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 01:21:41,655 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:21:41,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] [2018-12-03 01:21:41,656 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:21:41,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:21:41,656 INFO L82 PathProgramCache]: Analyzing trace with hash 954174819, now seen corresponding path program 1 times [2018-12-03 01:21:41,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:21:41,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:21:41,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:21:41,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:21:41,657 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:21:41,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:21:41,703 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-03 01:21:41,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:21:41,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 01:21:41,704 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:21:41,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 01:21:41,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 01:21:41,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:21:41,704 INFO L87 Difference]: Start difference. First operand 259066 states and 1099297 transitions. Second operand 5 states. [2018-12-03 01:21:41,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:21:41,925 INFO L93 Difference]: Finished difference Result 57898 states and 224521 transitions. [2018-12-03 01:21:41,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 01:21:41,926 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2018-12-03 01:21:41,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:21:42,026 INFO L225 Difference]: With dead ends: 57898 [2018-12-03 01:21:42,026 INFO L226 Difference]: Without dead ends: 50982 [2018-12-03 01:21:42,027 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-03 01:21:42,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50982 states. [2018-12-03 01:21:42,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50982 to 50742. [2018-12-03 01:21:42,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50742 states. [2018-12-03 01:21:42,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50742 states to 50742 states and 196308 transitions. [2018-12-03 01:21:42,746 INFO L78 Accepts]: Start accepts. Automaton has 50742 states and 196308 transitions. Word has length 60 [2018-12-03 01:21:42,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:21:42,746 INFO L480 AbstractCegarLoop]: Abstraction has 50742 states and 196308 transitions. [2018-12-03 01:21:42,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 01:21:42,746 INFO L276 IsEmpty]: Start isEmpty. Operand 50742 states and 196308 transitions. [2018-12-03 01:21:42,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-03 01:21:42,762 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:21:42,762 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-03 01:21:42,762 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:21:42,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:21:42,762 INFO L82 PathProgramCache]: Analyzing trace with hash 767048363, now seen corresponding path program 1 times [2018-12-03 01:21:42,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:21:42,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:21:42,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:21:42,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:21:42,764 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:21:42,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:21:42,805 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-03 01:21:42,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:21:42,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:21:42,805 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:21:42,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:21:42,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:21:42,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:21:42,806 INFO L87 Difference]: Start difference. First operand 50742 states and 196308 transitions. Second operand 4 states. [2018-12-03 01:21:43,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:21:43,088 INFO L93 Difference]: Finished difference Result 59861 states and 230927 transitions. [2018-12-03 01:21:43,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 01:21:43,089 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2018-12-03 01:21:43,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:21:43,204 INFO L225 Difference]: With dead ends: 59861 [2018-12-03 01:21:43,204 INFO L226 Difference]: Without dead ends: 59861 [2018-12-03 01:21:43,204 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-03 01:21:43,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59861 states. [2018-12-03 01:21:44,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59861 to 53957. [2018-12-03 01:21:44,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53957 states. [2018-12-03 01:21:45,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53957 states to 53957 states and 208375 transitions. [2018-12-03 01:21:45,088 INFO L78 Accepts]: Start accepts. Automaton has 53957 states and 208375 transitions. Word has length 70 [2018-12-03 01:21:45,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:21:45,089 INFO L480 AbstractCegarLoop]: Abstraction has 53957 states and 208375 transitions. [2018-12-03 01:21:45,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:21:45,089 INFO L276 IsEmpty]: Start isEmpty. Operand 53957 states and 208375 transitions. [2018-12-03 01:21:45,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-03 01:21:45,106 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:21:45,106 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-03 01:21:45,106 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:21:45,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:21:45,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1785108598, now seen corresponding path program 1 times [2018-12-03 01:21:45,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:21:45,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:21:45,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:21:45,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:21:45,108 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:21:45,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:21:45,147 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-03 01:21:45,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:21:45,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 01:21:45,147 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:21:45,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 01:21:45,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 01:21:45,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 01:21:45,148 INFO L87 Difference]: Start difference. First operand 53957 states and 208375 transitions. Second operand 6 states. [2018-12-03 01:21:45,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:21:45,218 INFO L93 Difference]: Finished difference Result 14405 states and 48007 transitions. [2018-12-03 01:21:45,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 01:21:45,218 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2018-12-03 01:21:45,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:21:45,233 INFO L225 Difference]: With dead ends: 14405 [2018-12-03 01:21:45,233 INFO L226 Difference]: Without dead ends: 12149 [2018-12-03 01:21:45,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-03 01:21:45,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12149 states. [2018-12-03 01:21:45,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12149 to 11559. [2018-12-03 01:21:45,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11559 states. [2018-12-03 01:21:45,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11559 states to 11559 states and 37959 transitions. [2018-12-03 01:21:45,355 INFO L78 Accepts]: Start accepts. Automaton has 11559 states and 37959 transitions. Word has length 70 [2018-12-03 01:21:45,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:21:45,356 INFO L480 AbstractCegarLoop]: Abstraction has 11559 states and 37959 transitions. [2018-12-03 01:21:45,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 01:21:45,356 INFO L276 IsEmpty]: Start isEmpty. Operand 11559 states and 37959 transitions. [2018-12-03 01:21:45,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 01:21:45,366 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:21:45,367 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:21:45,367 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:21:45,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:21:45,367 INFO L82 PathProgramCache]: Analyzing trace with hash 369253930, now seen corresponding path program 1 times [2018-12-03 01:21:45,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:21:45,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:21:45,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:21:45,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:21:45,368 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:21:45,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:21:45,414 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-03 01:21:45,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:21:45,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:21:45,414 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:21:45,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:21:45,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:21:45,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:21:45,415 INFO L87 Difference]: Start difference. First operand 11559 states and 37959 transitions. Second operand 4 states. [2018-12-03 01:21:45,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:21:45,555 INFO L93 Difference]: Finished difference Result 16004 states and 51605 transitions. [2018-12-03 01:21:45,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:21:45,555 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2018-12-03 01:21:45,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:21:45,573 INFO L225 Difference]: With dead ends: 16004 [2018-12-03 01:21:45,573 INFO L226 Difference]: Without dead ends: 16004 [2018-12-03 01:21:45,573 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-03 01:21:45,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16004 states. [2018-12-03 01:21:45,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16004 to 14021. [2018-12-03 01:21:45,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14021 states. [2018-12-03 01:21:45,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14021 states to 14021 states and 45458 transitions. [2018-12-03 01:21:45,722 INFO L78 Accepts]: Start accepts. Automaton has 14021 states and 45458 transitions. Word has length 89 [2018-12-03 01:21:45,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:21:45,722 INFO L480 AbstractCegarLoop]: Abstraction has 14021 states and 45458 transitions. [2018-12-03 01:21:45,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:21:45,722 INFO L276 IsEmpty]: Start isEmpty. Operand 14021 states and 45458 transitions. [2018-12-03 01:21:45,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 01:21:45,734 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:21:45,734 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:21:45,734 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:21:45,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:21:45,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1707955413, now seen corresponding path program 1 times [2018-12-03 01:21:45,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:21:45,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:21:45,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:21:45,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:21:45,735 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:21:45,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:21:45,802 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-03 01:21:45,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:21:45,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 01:21:45,803 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:21:45,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 01:21:45,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 01:21:45,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-03 01:21:45,803 INFO L87 Difference]: Start difference. First operand 14021 states and 45458 transitions. Second operand 6 states. [2018-12-03 01:21:46,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:21:46,041 INFO L93 Difference]: Finished difference Result 20726 states and 66747 transitions. [2018-12-03 01:21:46,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 01:21:46,042 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2018-12-03 01:21:46,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:21:46,064 INFO L225 Difference]: With dead ends: 20726 [2018-12-03 01:21:46,065 INFO L226 Difference]: Without dead ends: 20598 [2018-12-03 01:21:46,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-03 01:21:46,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20598 states. [2018-12-03 01:21:46,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20598 to 17591. [2018-12-03 01:21:46,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17591 states. [2018-12-03 01:21:46,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17591 states to 17591 states and 56905 transitions. [2018-12-03 01:21:46,262 INFO L78 Accepts]: Start accepts. Automaton has 17591 states and 56905 transitions. Word has length 89 [2018-12-03 01:21:46,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:21:46,263 INFO L480 AbstractCegarLoop]: Abstraction has 17591 states and 56905 transitions. [2018-12-03 01:21:46,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 01:21:46,263 INFO L276 IsEmpty]: Start isEmpty. Operand 17591 states and 56905 transitions. [2018-12-03 01:21:46,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 01:21:46,278 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:21:46,278 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:21:46,279 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:21:46,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:21:46,279 INFO L82 PathProgramCache]: Analyzing trace with hash 790060524, now seen corresponding path program 1 times [2018-12-03 01:21:46,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:21:46,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:21:46,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:21:46,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:21:46,280 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:21:46,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:21:46,331 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-03 01:21:46,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:21:46,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 01:21:46,331 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:21:46,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 01:21:46,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 01:21:46,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-03 01:21:46,331 INFO L87 Difference]: Start difference. First operand 17591 states and 56905 transitions. Second operand 7 states. [2018-12-03 01:21:46,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:21:46,732 INFO L93 Difference]: Finished difference Result 33210 states and 107799 transitions. [2018-12-03 01:21:46,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 01:21:46,732 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2018-12-03 01:21:46,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:21:46,772 INFO L225 Difference]: With dead ends: 33210 [2018-12-03 01:21:46,773 INFO L226 Difference]: Without dead ends: 33210 [2018-12-03 01:21:46,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-12-03 01:21:46,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33210 states. [2018-12-03 01:21:47,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33210 to 21509. [2018-12-03 01:21:47,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21509 states. [2018-12-03 01:21:47,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21509 states to 21509 states and 70038 transitions. [2018-12-03 01:21:47,067 INFO L78 Accepts]: Start accepts. Automaton has 21509 states and 70038 transitions. Word has length 89 [2018-12-03 01:21:47,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:21:47,068 INFO L480 AbstractCegarLoop]: Abstraction has 21509 states and 70038 transitions. [2018-12-03 01:21:47,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 01:21:47,068 INFO L276 IsEmpty]: Start isEmpty. Operand 21509 states and 70038 transitions. [2018-12-03 01:21:47,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 01:21:47,088 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:21:47,088 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:21:47,088 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:21:47,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:21:47,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1677564205, now seen corresponding path program 1 times [2018-12-03 01:21:47,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:21:47,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:21:47,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:21:47,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:21:47,090 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:21:47,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:21:47,168 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-03 01:21:47,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:21:47,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 01:21:47,168 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:21:47,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 01:21:47,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 01:21:47,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 01:21:47,169 INFO L87 Difference]: Start difference. First operand 21509 states and 70038 transitions. Second operand 6 states. [2018-12-03 01:21:47,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:21:47,424 INFO L93 Difference]: Finished difference Result 23057 states and 74259 transitions. [2018-12-03 01:21:47,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 01:21:47,424 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2018-12-03 01:21:47,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:21:47,451 INFO L225 Difference]: With dead ends: 23057 [2018-12-03 01:21:47,451 INFO L226 Difference]: Without dead ends: 23057 [2018-12-03 01:21:47,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-03 01:21:47,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23057 states. [2018-12-03 01:21:47,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23057 to 18925. [2018-12-03 01:21:47,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18925 states. [2018-12-03 01:21:47,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18925 states to 18925 states and 60694 transitions. [2018-12-03 01:21:47,676 INFO L78 Accepts]: Start accepts. Automaton has 18925 states and 60694 transitions. Word has length 89 [2018-12-03 01:21:47,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:21:47,676 INFO L480 AbstractCegarLoop]: Abstraction has 18925 states and 60694 transitions. [2018-12-03 01:21:47,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 01:21:47,676 INFO L276 IsEmpty]: Start isEmpty. Operand 18925 states and 60694 transitions. [2018-12-03 01:21:47,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 01:21:47,693 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:21:47,693 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:21:47,693 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:21:47,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:21:47,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1136150973, now seen corresponding path program 1 times [2018-12-03 01:21:47,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:21:47,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:21:47,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:21:47,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:21:47,695 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:21:47,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:21:47,744 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-03 01:21:47,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:21:47,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 01:21:47,745 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:21:47,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 01:21:47,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 01:21:47,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 01:21:47,745 INFO L87 Difference]: Start difference. First operand 18925 states and 60694 transitions. Second operand 6 states. [2018-12-03 01:21:48,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:21:48,331 INFO L93 Difference]: Finished difference Result 22410 states and 70967 transitions. [2018-12-03 01:21:48,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 01:21:48,331 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2018-12-03 01:21:48,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:21:48,362 INFO L225 Difference]: With dead ends: 22410 [2018-12-03 01:21:48,362 INFO L226 Difference]: Without dead ends: 21890 [2018-12-03 01:21:48,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-03 01:21:48,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21890 states. [2018-12-03 01:21:48,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21890 to 20605. [2018-12-03 01:21:48,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20605 states. [2018-12-03 01:21:48,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20605 states to 20605 states and 65838 transitions. [2018-12-03 01:21:48,581 INFO L78 Accepts]: Start accepts. Automaton has 20605 states and 65838 transitions. Word has length 89 [2018-12-03 01:21:48,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:21:48,581 INFO L480 AbstractCegarLoop]: Abstraction has 20605 states and 65838 transitions. [2018-12-03 01:21:48,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 01:21:48,581 INFO L276 IsEmpty]: Start isEmpty. Operand 20605 states and 65838 transitions. [2018-12-03 01:21:48,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 01:21:48,598 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:21:48,598 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:21:48,598 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:21:48,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:21:48,599 INFO L82 PathProgramCache]: Analyzing trace with hash 727163032, now seen corresponding path program 2 times [2018-12-03 01:21:48,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:21:48,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:21:48,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:21:48,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:21:48,600 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:21:48,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:21:48,660 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-03 01:21:48,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:21:48,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 01:21:48,660 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:21:48,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 01:21:48,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 01:21:48,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-03 01:21:48,660 INFO L87 Difference]: Start difference. First operand 20605 states and 65838 transitions. Second operand 7 states. [2018-12-03 01:21:49,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:21:49,159 INFO L93 Difference]: Finished difference Result 23378 states and 74622 transitions. [2018-12-03 01:21:49,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 01:21:49,160 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2018-12-03 01:21:49,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:21:49,188 INFO L225 Difference]: With dead ends: 23378 [2018-12-03 01:21:49,188 INFO L226 Difference]: Without dead ends: 23378 [2018-12-03 01:21:49,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-03 01:21:49,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23378 states. [2018-12-03 01:21:49,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23378 to 20780. [2018-12-03 01:21:49,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20780 states. [2018-12-03 01:21:49,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20780 states to 20780 states and 66558 transitions. [2018-12-03 01:21:49,482 INFO L78 Accepts]: Start accepts. Automaton has 20780 states and 66558 transitions. Word has length 89 [2018-12-03 01:21:49,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:21:49,482 INFO L480 AbstractCegarLoop]: Abstraction has 20780 states and 66558 transitions. [2018-12-03 01:21:49,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 01:21:49,482 INFO L276 IsEmpty]: Start isEmpty. Operand 20780 states and 66558 transitions. [2018-12-03 01:21:49,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 01:21:49,500 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:21:49,501 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:21:49,501 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:21:49,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:21:49,501 INFO L82 PathProgramCache]: Analyzing trace with hash -873952868, now seen corresponding path program 1 times [2018-12-03 01:21:49,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:21:49,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:21:49,502 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 01:21:49,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:21:49,503 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:21:49,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:21:49,567 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-03 01:21:49,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:21:49,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 01:21:49,567 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:21:49,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 01:21:49,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 01:21:49,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 01:21:49,568 INFO L87 Difference]: Start difference. First operand 20780 states and 66558 transitions. Second operand 6 states. [2018-12-03 01:21:49,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:21:49,745 INFO L93 Difference]: Finished difference Result 22800 states and 71524 transitions. [2018-12-03 01:21:49,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 01:21:49,746 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2018-12-03 01:21:49,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:21:49,771 INFO L225 Difference]: With dead ends: 22800 [2018-12-03 01:21:49,771 INFO L226 Difference]: Without dead ends: 22800 [2018-12-03 01:21:49,772 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-03 01:21:49,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22800 states. [2018-12-03 01:21:49,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22800 to 21185. [2018-12-03 01:21:49,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21185 states. [2018-12-03 01:21:49,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21185 states to 21185 states and 66772 transitions. [2018-12-03 01:21:49,995 INFO L78 Accepts]: Start accepts. Automaton has 21185 states and 66772 transitions. Word has length 89 [2018-12-03 01:21:49,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:21:49,995 INFO L480 AbstractCegarLoop]: Abstraction has 21185 states and 66772 transitions. [2018-12-03 01:21:49,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 01:21:49,995 INFO L276 IsEmpty]: Start isEmpty. Operand 21185 states and 66772 transitions. [2018-12-03 01:21:50,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 01:21:50,013 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:21:50,013 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:21:50,014 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:21:50,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:21:50,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1128689413, now seen corresponding path program 1 times [2018-12-03 01:21:50,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:21:50,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:21:50,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:21:50,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:21:50,015 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:21:50,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:21:50,071 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-03 01:21:50,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:21:50,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 01:21:50,072 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:21:50,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 01:21:50,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 01:21:50,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 01:21:50,072 INFO L87 Difference]: Start difference. First operand 21185 states and 66772 transitions. Second operand 6 states. [2018-12-03 01:21:50,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:21:50,173 INFO L93 Difference]: Finished difference Result 19713 states and 60964 transitions. [2018-12-03 01:21:50,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 01:21:50,173 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2018-12-03 01:21:50,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:21:50,194 INFO L225 Difference]: With dead ends: 19713 [2018-12-03 01:21:50,194 INFO L226 Difference]: Without dead ends: 19713 [2018-12-03 01:21:50,194 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-03 01:21:50,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19713 states. [2018-12-03 01:21:50,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19713 to 12349. [2018-12-03 01:21:50,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12349 states. [2018-12-03 01:21:50,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12349 states to 12349 states and 38204 transitions. [2018-12-03 01:21:50,354 INFO L78 Accepts]: Start accepts. Automaton has 12349 states and 38204 transitions. Word has length 89 [2018-12-03 01:21:50,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:21:50,354 INFO L480 AbstractCegarLoop]: Abstraction has 12349 states and 38204 transitions. [2018-12-03 01:21:50,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 01:21:50,354 INFO L276 IsEmpty]: Start isEmpty. Operand 12349 states and 38204 transitions. [2018-12-03 01:21:50,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 01:21:50,364 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:21:50,364 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:21:50,364 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:21:50,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:21:50,365 INFO L82 PathProgramCache]: Analyzing trace with hash 800833982, now seen corresponding path program 1 times [2018-12-03 01:21:50,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:21:50,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:21:50,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:21:50,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:21:50,366 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:21:50,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:21:50,447 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-03 01:21:50,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:21:50,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 01:21:50,447 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:21:50,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 01:21:50,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 01:21:50,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 01:21:50,448 INFO L87 Difference]: Start difference. First operand 12349 states and 38204 transitions. Second operand 6 states. [2018-12-03 01:21:50,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:21:50,638 INFO L93 Difference]: Finished difference Result 14279 states and 43813 transitions. [2018-12-03 01:21:50,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 01:21:50,639 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-12-03 01:21:50,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:21:50,653 INFO L225 Difference]: With dead ends: 14279 [2018-12-03 01:21:50,653 INFO L226 Difference]: Without dead ends: 13989 [2018-12-03 01:21:50,653 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-03 01:21:50,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13989 states. [2018-12-03 01:21:50,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13989 to 10869. [2018-12-03 01:21:50,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10869 states. [2018-12-03 01:21:50,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10869 states to 10869 states and 33340 transitions. [2018-12-03 01:21:50,774 INFO L78 Accepts]: Start accepts. Automaton has 10869 states and 33340 transitions. Word has length 91 [2018-12-03 01:21:50,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:21:50,775 INFO L480 AbstractCegarLoop]: Abstraction has 10869 states and 33340 transitions. [2018-12-03 01:21:50,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 01:21:50,775 INFO L276 IsEmpty]: Start isEmpty. Operand 10869 states and 33340 transitions. [2018-12-03 01:21:50,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 01:21:50,784 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:21:50,784 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:21:50,784 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:21:50,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:21:50,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1276375361, now seen corresponding path program 1 times [2018-12-03 01:21:50,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:21:50,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:21:50,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:21:50,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:21:50,785 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:21:50,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:21:50,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:21:50,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:21:50,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 01:21:50,856 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:21:50,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 01:21:50,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 01:21:50,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-03 01:21:50,857 INFO L87 Difference]: Start difference. First operand 10869 states and 33340 transitions. Second operand 7 states. [2018-12-03 01:21:51,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:21:51,000 INFO L93 Difference]: Finished difference Result 12896 states and 39484 transitions. [2018-12-03 01:21:51,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 01:21:51,001 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-12-03 01:21:51,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:21:51,015 INFO L225 Difference]: With dead ends: 12896 [2018-12-03 01:21:51,015 INFO L226 Difference]: Without dead ends: 12896 [2018-12-03 01:21:51,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-12-03 01:21:51,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12896 states. [2018-12-03 01:21:51,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12896 to 12832. [2018-12-03 01:21:51,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12832 states. [2018-12-03 01:21:51,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12832 states to 12832 states and 39276 transitions. [2018-12-03 01:21:51,152 INFO L78 Accepts]: Start accepts. Automaton has 12832 states and 39276 transitions. Word has length 91 [2018-12-03 01:21:51,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:21:51,153 INFO L480 AbstractCegarLoop]: Abstraction has 12832 states and 39276 transitions. [2018-12-03 01:21:51,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 01:21:51,153 INFO L276 IsEmpty]: Start isEmpty. Operand 12832 states and 39276 transitions. [2018-12-03 01:21:51,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 01:21:51,165 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:21:51,165 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:21:51,165 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:21:51,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:21:51,165 INFO L82 PathProgramCache]: Analyzing trace with hash -388871680, now seen corresponding path program 1 times [2018-12-03 01:21:51,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:21:51,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:21:51,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:21:51,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:21:51,167 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:21:51,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:21:51,272 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-03 01:21:51,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:21:51,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-03 01:21:51,272 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:21:51,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 01:21:51,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 01:21:51,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-03 01:21:51,273 INFO L87 Difference]: Start difference. First operand 12832 states and 39276 transitions. Second operand 10 states. [2018-12-03 01:21:51,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:21:51,872 INFO L93 Difference]: Finished difference Result 23024 states and 70388 transitions. [2018-12-03 01:21:51,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 01:21:51,872 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 91 [2018-12-03 01:21:51,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:21:51,882 INFO L225 Difference]: With dead ends: 23024 [2018-12-03 01:21:51,882 INFO L226 Difference]: Without dead ends: 11060 [2018-12-03 01:21:51,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2018-12-03 01:21:51,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11060 states. [2018-12-03 01:21:51,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11060 to 11060. [2018-12-03 01:21:51,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11060 states. [2018-12-03 01:21:51,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11060 states to 11060 states and 33600 transitions. [2018-12-03 01:21:51,979 INFO L78 Accepts]: Start accepts. Automaton has 11060 states and 33600 transitions. Word has length 91 [2018-12-03 01:21:51,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:21:51,979 INFO L480 AbstractCegarLoop]: Abstraction has 11060 states and 33600 transitions. [2018-12-03 01:21:51,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 01:21:51,979 INFO L276 IsEmpty]: Start isEmpty. Operand 11060 states and 33600 transitions. [2018-12-03 01:21:51,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 01:21:51,988 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:21:51,988 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:21:51,988 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:21:51,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:21:51,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1052755860, now seen corresponding path program 2 times [2018-12-03 01:21:51,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:21:51,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:21:51,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:21:51,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:21:51,989 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:21:51,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:21:52,032 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-03 01:21:52,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:21:52,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 01:21:52,033 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:21:52,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 01:21:52,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 01:21:52,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 01:21:52,033 INFO L87 Difference]: Start difference. First operand 11060 states and 33600 transitions. Second operand 7 states. [2018-12-03 01:21:52,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:21:52,297 INFO L93 Difference]: Finished difference Result 19166 states and 58450 transitions. [2018-12-03 01:21:52,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 01:21:52,297 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-12-03 01:21:52,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:21:52,304 INFO L225 Difference]: With dead ends: 19166 [2018-12-03 01:21:52,304 INFO L226 Difference]: Without dead ends: 7778 [2018-12-03 01:21:52,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-03 01:21:52,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7778 states. [2018-12-03 01:21:52,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7778 to 7778. [2018-12-03 01:21:52,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7778 states. [2018-12-03 01:21:52,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7778 states to 7778 states and 23721 transitions. [2018-12-03 01:21:52,373 INFO L78 Accepts]: Start accepts. Automaton has 7778 states and 23721 transitions. Word has length 91 [2018-12-03 01:21:52,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:21:52,373 INFO L480 AbstractCegarLoop]: Abstraction has 7778 states and 23721 transitions. [2018-12-03 01:21:52,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 01:21:52,373 INFO L276 IsEmpty]: Start isEmpty. Operand 7778 states and 23721 transitions. [2018-12-03 01:21:52,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 01:21:52,379 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:21:52,379 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:21:52,379 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:21:52,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:21:52,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1451279012, now seen corresponding path program 3 times [2018-12-03 01:21:52,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:21:52,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:21:52,380 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 01:21:52,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:21:52,380 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:21:52,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:21:52,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:21:52,427 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-03 01:21:52,520 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-03 01:21:52,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 01:21:52 BasicIcfg [2018-12-03 01:21:52,521 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 01:21:52,521 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 01:21:52,522 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 01:21:52,522 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 01:21:52,522 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:20:03" (3/4) ... [2018-12-03 01:21:52,524 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-03 01:21:52,611 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_bcca008d-9dae-462b-aa6c-b81e7cf12567/bin-2019/utaipan/witness.graphml [2018-12-03 01:21:52,611 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 01:21:52,612 INFO L168 Benchmark]: Toolchain (without parser) took 109390.30 ms. Allocated memory was 1.0 GB in the beginning and 7.9 GB in the end (delta: 6.8 GB). Free memory was 956.0 MB in the beginning and 6.4 GB in the end (delta: -5.4 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2018-12-03 01:21:52,613 INFO L168 Benchmark]: CDTParser took 0.12 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-03 01:21:52,613 INFO L168 Benchmark]: CACSL2BoogieTranslator took 345.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -155.0 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. [2018-12-03 01:21:52,613 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-03 01:21:52,613 INFO L168 Benchmark]: Boogie Preprocessor took 19.49 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-03 01:21:52,614 INFO L168 Benchmark]: RCFGBuilder took 323.71 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: 45.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 11.5 GB. [2018-12-03 01:21:52,614 INFO L168 Benchmark]: TraceAbstraction took 108577.82 ms. Allocated memory was 1.2 GB in the beginning and 7.9 GB in the end (delta: 6.7 GB). Free memory was 1.1 GB in the beginning and 6.5 GB in the end (delta: -5.4 GB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2018-12-03 01:21:52,614 INFO L168 Benchmark]: Witness Printer took 89.56 ms. Allocated memory is still 7.9 GB. Free memory was 6.5 GB in the beginning and 6.4 GB in the end (delta: 61.4 MB). Peak memory consumption was 61.4 MB. Max. memory is 11.5 GB. [2018-12-03 01:21:52,615 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 345.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -155.0 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.49 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 323.71 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: 45.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 108577.82 ms. Allocated memory was 1.2 GB in the beginning and 7.9 GB in the end (delta: 6.7 GB). Free memory was 1.1 GB in the beginning and 6.5 GB in the end (delta: -5.4 GB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. * Witness Printer took 89.56 ms. Allocated memory is still 7.9 GB. Free memory was 6.5 GB in the beginning and 6.4 GB in the end (delta: 61.4 MB). Peak memory consumption was 61.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L676] -1 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L677] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L678] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L680] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L682] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L683] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L684] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L685] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L686] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L687] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L688] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L689] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L690] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L691] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L692] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L693] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L694] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L695] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L696] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L697] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L698] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L700] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L701] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L702] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] -1 pthread_t t1408; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L787] FCALL, FORK -1 pthread_create(&t1408, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] -1 pthread_t t1409; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L789] FCALL, FORK -1 pthread_create(&t1409, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] -1 pthread_t t1410; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L791] FCALL, FORK -1 pthread_create(&t1410, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L749] 0 y$w_buff1 = y$w_buff0 [L750] 0 y$w_buff0 = 1 [L751] 0 y$w_buff1_used = y$w_buff0_used [L752] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L754] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L755] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L756] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L757] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L758] 0 y$r_buff0_thd3 = (_Bool)1 [L761] 0 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L706] 1 z = 1 [L709] 1 x = 1 [L714] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L721] 2 x = 2 [L724] 2 weak$$choice0 = __VERIFIER_nondet_pointer() [L725] 2 weak$$choice2 = __VERIFIER_nondet_pointer() [L726] 2 y$flush_delayed = weak$$choice2 [L727] 2 y$mem_tmp = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L728] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L728] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L729] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L764] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L730] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L730] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L731] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L731] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L732] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L733] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L734] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L734] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L735] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L736] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L736] 2 y = y$flush_delayed ? y$mem_tmp : y [L737] 2 y$flush_delayed = (_Bool)0 [L742] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L764] 0 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L765] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=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_thd3 ? (_Bool)0 : y$w_buff0_used [L766] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=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_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L767] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L767] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L768] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L768] 0 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L771] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L793] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] -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) [L798] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L799] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] -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 [L800] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L801] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] -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 [L804] -1 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 217 locations, 3 error locations. UNSAFE Result, 108.4s OverallTime, 24 OverallIterations, 1 TraceHistogramMax, 27.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6235 SDtfs, 8654 SDslu, 14509 SDs, 0 SdLazy, 5643 SolverSat, 359 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 206 GetRequests, 55 SyntacticMatches, 9 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=308618occurred in iteration=7, 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: 58.3s AutomataMinimizationTime, 23 MinimizatonAttempts, 584628 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1807 NumberOfCodeBlocks, 1807 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1693 ConstructedInterpolants, 0 QuantifiedInterpolants, 363445 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...