./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi008_rmo.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_326e7b72-16c9-4bed-9ead-688206d48365/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_326e7b72-16c9-4bed-9ead-688206d48365/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_326e7b72-16c9-4bed-9ead-688206d48365/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_326e7b72-16c9-4bed-9ead-688206d48365/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi008_rmo.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_326e7b72-16c9-4bed-9ead-688206d48365/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_326e7b72-16c9-4bed-9ead-688206d48365/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 df823c9c960fe14b6c8d6a9a95ba970929f56e0b ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-09 12:01:18,391 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 12:01:18,392 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 12:01:18,398 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 12:01:18,398 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 12:01:18,399 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 12:01:18,399 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 12:01:18,400 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 12:01:18,401 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 12:01:18,402 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 12:01:18,402 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 12:01:18,403 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 12:01:18,403 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 12:01:18,404 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 12:01:18,404 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 12:01:18,405 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 12:01:18,405 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 12:01:18,406 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 12:01:18,407 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 12:01:18,408 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 12:01:18,409 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 12:01:18,409 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 12:01:18,411 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 12:01:18,411 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 12:01:18,411 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 12:01:18,412 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 12:01:18,412 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 12:01:18,413 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 12:01:18,413 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 12:01:18,414 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 12:01:18,414 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 12:01:18,414 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 12:01:18,414 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 12:01:18,414 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 12:01:18,415 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 12:01:18,415 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 12:01:18,416 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_326e7b72-16c9-4bed-9ead-688206d48365/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 12:01:18,423 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 12:01:18,423 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 12:01:18,424 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 12:01:18,424 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 12:01:18,424 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 12:01:18,424 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 12:01:18,424 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 12:01:18,425 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 12:01:18,425 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 12:01:18,425 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 12:01:18,425 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 12:01:18,425 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 12:01:18,425 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 12:01:18,426 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 12:01:18,426 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 12:01:18,426 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 12:01:18,426 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 12:01:18,426 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 12:01:18,426 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 12:01:18,426 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 12:01:18,426 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 12:01:18,427 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 12:01:18,427 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 12:01:18,427 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 12:01:18,427 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 12:01:18,427 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 12:01:18,427 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 12:01:18,427 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 12:01:18,427 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 12:01:18,427 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 12:01:18,428 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 12:01:18,428 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 12:01:18,428 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 12:01:18,428 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 12:01:18,428 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 12:01:18,428 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 12:01:18,428 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_326e7b72-16c9-4bed-9ead-688206d48365/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 -> df823c9c960fe14b6c8d6a9a95ba970929f56e0b [2018-12-09 12:01:18,446 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 12:01:18,455 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 12:01:18,457 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 12:01:18,459 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 12:01:18,459 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 12:01:18,459 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_326e7b72-16c9-4bed-9ead-688206d48365/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/rfi008_rmo.oepc_false-unreach-call.i [2018-12-09 12:01:18,502 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_326e7b72-16c9-4bed-9ead-688206d48365/bin-2019/utaipan/data/ed9ca0bdb/580ddb5e8ad84e64a1ded01295e1ef93/FLAG46b6a1e8e [2018-12-09 12:01:18,859 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 12:01:18,859 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_326e7b72-16c9-4bed-9ead-688206d48365/sv-benchmarks/c/pthread-wmm/rfi008_rmo.oepc_false-unreach-call.i [2018-12-09 12:01:18,867 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_326e7b72-16c9-4bed-9ead-688206d48365/bin-2019/utaipan/data/ed9ca0bdb/580ddb5e8ad84e64a1ded01295e1ef93/FLAG46b6a1e8e [2018-12-09 12:01:18,875 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_326e7b72-16c9-4bed-9ead-688206d48365/bin-2019/utaipan/data/ed9ca0bdb/580ddb5e8ad84e64a1ded01295e1ef93 [2018-12-09 12:01:18,876 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 12:01:18,877 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 12:01:18,878 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 12:01:18,878 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 12:01:18,880 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 12:01:18,880 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:01:18" (1/1) ... [2018-12-09 12:01:18,882 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@201b218f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:01:18, skipping insertion in model container [2018-12-09 12:01:18,882 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:01:18" (1/1) ... [2018-12-09 12:01:18,887 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 12:01:18,910 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 12:01:19,113 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 12:01:19,120 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 12:01:19,207 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 12:01:19,236 INFO L195 MainTranslator]: Completed translation [2018-12-09 12:01:19,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:01:19 WrapperNode [2018-12-09 12:01:19,236 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 12:01:19,237 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 12:01:19,237 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 12:01:19,237 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 12:01:19,242 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:01:19" (1/1) ... [2018-12-09 12:01:19,253 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:01:19" (1/1) ... [2018-12-09 12:01:19,270 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 12:01:19,270 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 12:01:19,270 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 12:01:19,270 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 12:01:19,276 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:01:19" (1/1) ... [2018-12-09 12:01:19,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:01:19" (1/1) ... [2018-12-09 12:01:19,280 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:01:19" (1/1) ... [2018-12-09 12:01:19,280 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:01:19" (1/1) ... [2018-12-09 12:01:19,285 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:01:19" (1/1) ... [2018-12-09 12:01:19,288 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:01:19" (1/1) ... [2018-12-09 12:01:19,290 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:01:19" (1/1) ... [2018-12-09 12:01:19,292 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 12:01:19,293 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 12:01:19,293 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 12:01:19,293 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 12:01:19,293 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:01:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_326e7b72-16c9-4bed-9ead-688206d48365/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-09 12:01:19,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 12:01:19,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 12:01:19,326 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 12:01:19,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 12:01:19,327 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 12:01:19,327 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 12:01:19,327 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 12:01:19,327 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 12:01:19,327 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 12:01:19,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 12:01:19,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 12:01:19,328 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-09 12:01:19,703 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 12:01:19,703 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 12:01:19,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:01:19 BoogieIcfgContainer [2018-12-09 12:01:19,703 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 12:01:19,704 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 12:01:19,704 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 12:01:19,705 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 12:01:19,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 12:01:18" (1/3) ... [2018-12-09 12:01:19,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bc40272 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:01:19, skipping insertion in model container [2018-12-09 12:01:19,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:01:19" (2/3) ... [2018-12-09 12:01:19,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bc40272 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:01:19, skipping insertion in model container [2018-12-09 12:01:19,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:01:19" (3/3) ... [2018-12-09 12:01:19,708 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi008_rmo.oepc_false-unreach-call.i [2018-12-09 12:01:19,732 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,732 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,733 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,733 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,733 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,733 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,733 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,733 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,733 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,733 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,733 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,734 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,734 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,734 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,734 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,734 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,734 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,734 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,734 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,734 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,734 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,735 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,735 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,735 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,735 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,735 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,735 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,735 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,735 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,735 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,736 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,736 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,736 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,736 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,736 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,736 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,736 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,736 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,736 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,737 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,737 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,737 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,737 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,737 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,737 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,737 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,737 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,737 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,738 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,738 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,738 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,738 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,738 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,738 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,738 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,738 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,738 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,738 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,739 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,739 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,739 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,739 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,739 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,739 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,739 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,739 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,739 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,740 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,740 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,740 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,740 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,740 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,740 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,740 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,740 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,740 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,741 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,741 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,741 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,741 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,741 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,741 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,741 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,741 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,741 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,741 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,742 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,742 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,742 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,742 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,742 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,742 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,742 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,742 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,742 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,743 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,743 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,743 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,743 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,743 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,743 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,743 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,743 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,743 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,743 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,743 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,744 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,744 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,744 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,744 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,744 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,744 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,744 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,744 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,744 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,745 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,745 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,745 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,745 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,745 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,745 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,745 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,745 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,745 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,745 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,745 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,746 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,746 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,746 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,746 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,746 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,746 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,746 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,746 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,746 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,746 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,747 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,747 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,747 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,747 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,747 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,747 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,747 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,747 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,747 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,747 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,747 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,747 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,747 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,748 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,748 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,748 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,748 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,748 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,748 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,748 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,748 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,748 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,748 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,748 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,748 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,748 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,749 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,749 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,749 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,749 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,749 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,749 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,749 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,749 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,749 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,749 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,750 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,750 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,750 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,750 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,750 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,750 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,750 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,750 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,750 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,750 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,751 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,751 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,751 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,751 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,751 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,751 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,751 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,751 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,751 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,751 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,751 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,751 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,751 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,752 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,752 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,752 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,752 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,752 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,752 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,752 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,752 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,752 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,752 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,752 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,752 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,753 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,753 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,753 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,753 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,753 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,753 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,753 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,753 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,753 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,753 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,753 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,753 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,753 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,754 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,754 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,754 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,754 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,754 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,754 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,754 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,754 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,754 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,754 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,754 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,754 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,755 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,755 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,755 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,755 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,755 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,755 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,755 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,755 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,755 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,755 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,755 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet62.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,755 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet62.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,755 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,755 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,756 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet62.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,756 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet62.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:01:19,759 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 12:01:19,759 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 12:01:19,765 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 12:01:19,774 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 12:01:19,788 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 12:01:19,789 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 12:01:19,789 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 12:01:19,789 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 12:01:19,789 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 12:01:19,789 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 12:01:19,789 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 12:01:19,789 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 12:01:19,796 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 186places, 245 transitions [2018-12-09 12:01:27,695 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 104360 states. [2018-12-09 12:01:27,697 INFO L276 IsEmpty]: Start isEmpty. Operand 104360 states. [2018-12-09 12:01:27,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 12:01:27,701 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:01:27,702 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] [2018-12-09 12:01:27,703 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:01:27,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:01:27,707 INFO L82 PathProgramCache]: Analyzing trace with hash -513582767, now seen corresponding path program 1 times [2018-12-09 12:01:27,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:01:27,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:27,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:01:27,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:27,743 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:01:27,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:01:27,852 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-09 12:01:27,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:01:27,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:01:27,853 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:01:27,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:01:27,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:01:27,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:01:27,866 INFO L87 Difference]: Start difference. First operand 104360 states. Second operand 4 states. [2018-12-09 12:01:28,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:01:28,989 INFO L93 Difference]: Finished difference Result 192000 states and 772893 transitions. [2018-12-09 12:01:28,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:01:28,990 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-12-09 12:01:28,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:01:29,429 INFO L225 Difference]: With dead ends: 192000 [2018-12-09 12:01:29,429 INFO L226 Difference]: Without dead ends: 135832 [2018-12-09 12:01:29,430 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-09 12:01:30,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135832 states. [2018-12-09 12:01:32,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135832 to 77068. [2018-12-09 12:01:32,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77068 states. [2018-12-09 12:01:32,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77068 states to 77068 states and 313611 transitions. [2018-12-09 12:01:32,236 INFO L78 Accepts]: Start accepts. Automaton has 77068 states and 313611 transitions. Word has length 35 [2018-12-09 12:01:32,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:01:32,237 INFO L480 AbstractCegarLoop]: Abstraction has 77068 states and 313611 transitions. [2018-12-09 12:01:32,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:01:32,237 INFO L276 IsEmpty]: Start isEmpty. Operand 77068 states and 313611 transitions. [2018-12-09 12:01:32,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 12:01:32,244 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:01:32,244 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:01:32,244 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:01:32,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:01:32,245 INFO L82 PathProgramCache]: Analyzing trace with hash 133524022, now seen corresponding path program 1 times [2018-12-09 12:01:32,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:01:32,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:32,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:01:32,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:32,249 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:01:32,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:01:32,308 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-09 12:01:32,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:01:32,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:01:32,308 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:01:32,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:01:32,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:01:32,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:01:32,310 INFO L87 Difference]: Start difference. First operand 77068 states and 313611 transitions. Second operand 4 states. [2018-12-09 12:01:32,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:01:32,610 INFO L93 Difference]: Finished difference Result 16846 states and 57032 transitions. [2018-12-09 12:01:32,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 12:01:32,611 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-12-09 12:01:32,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:01:32,631 INFO L225 Difference]: With dead ends: 16846 [2018-12-09 12:01:32,631 INFO L226 Difference]: Without dead ends: 13306 [2018-12-09 12:01:32,632 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-09 12:01:32,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13306 states. [2018-12-09 12:01:32,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13306 to 13306. [2018-12-09 12:01:32,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13306 states. [2018-12-09 12:01:32,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13306 states to 13306 states and 43727 transitions. [2018-12-09 12:01:32,784 INFO L78 Accepts]: Start accepts. Automaton has 13306 states and 43727 transitions. Word has length 47 [2018-12-09 12:01:32,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:01:32,784 INFO L480 AbstractCegarLoop]: Abstraction has 13306 states and 43727 transitions. [2018-12-09 12:01:32,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:01:32,785 INFO L276 IsEmpty]: Start isEmpty. Operand 13306 states and 43727 transitions. [2018-12-09 12:01:32,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 12:01:32,786 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:01:32,786 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:01:32,786 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:01:32,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:01:32,787 INFO L82 PathProgramCache]: Analyzing trace with hash 84336861, now seen corresponding path program 1 times [2018-12-09 12:01:32,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:01:32,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:32,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:01:32,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:32,790 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:01:32,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:01:32,844 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-09 12:01:32,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:01:32,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:01:32,844 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:01:32,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:01:32,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:01:32,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:01:32,845 INFO L87 Difference]: Start difference. First operand 13306 states and 43727 transitions. Second operand 5 states. [2018-12-09 12:01:33,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:01:33,121 INFO L93 Difference]: Finished difference Result 25424 states and 82823 transitions. [2018-12-09 12:01:33,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 12:01:33,121 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-12-09 12:01:33,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:01:33,160 INFO L225 Difference]: With dead ends: 25424 [2018-12-09 12:01:33,160 INFO L226 Difference]: Without dead ends: 25356 [2018-12-09 12:01:33,160 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-09 12:01:33,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25356 states. [2018-12-09 12:01:33,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25356 to 16160. [2018-12-09 12:01:33,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16160 states. [2018-12-09 12:01:33,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16160 states to 16160 states and 51762 transitions. [2018-12-09 12:01:33,389 INFO L78 Accepts]: Start accepts. Automaton has 16160 states and 51762 transitions. Word has length 48 [2018-12-09 12:01:33,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:01:33,390 INFO L480 AbstractCegarLoop]: Abstraction has 16160 states and 51762 transitions. [2018-12-09 12:01:33,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:01:33,390 INFO L276 IsEmpty]: Start isEmpty. Operand 16160 states and 51762 transitions. [2018-12-09 12:01:33,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 12:01:33,391 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:01:33,391 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:01:33,391 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:01:33,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:01:33,392 INFO L82 PathProgramCache]: Analyzing trace with hash 475594115, now seen corresponding path program 1 times [2018-12-09 12:01:33,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:01:33,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:33,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:01:33,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:33,393 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:01:33,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:01:33,412 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-09 12:01:33,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:01:33,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 12:01:33,413 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:01:33,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 12:01:33,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 12:01:33,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:01:33,413 INFO L87 Difference]: Start difference. First operand 16160 states and 51762 transitions. Second operand 3 states. [2018-12-09 12:01:33,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:01:33,528 INFO L93 Difference]: Finished difference Result 30242 states and 95729 transitions. [2018-12-09 12:01:33,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 12:01:33,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-09 12:01:33,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:01:33,573 INFO L225 Difference]: With dead ends: 30242 [2018-12-09 12:01:33,573 INFO L226 Difference]: Without dead ends: 30242 [2018-12-09 12:01:33,573 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-09 12:01:33,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30242 states. [2018-12-09 12:01:33,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30242 to 24713. [2018-12-09 12:01:33,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24713 states. [2018-12-09 12:01:33,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24713 states to 24713 states and 78043 transitions. [2018-12-09 12:01:33,883 INFO L78 Accepts]: Start accepts. Automaton has 24713 states and 78043 transitions. Word has length 50 [2018-12-09 12:01:33,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:01:33,883 INFO L480 AbstractCegarLoop]: Abstraction has 24713 states and 78043 transitions. [2018-12-09 12:01:33,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 12:01:33,884 INFO L276 IsEmpty]: Start isEmpty. Operand 24713 states and 78043 transitions. [2018-12-09 12:01:33,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-09 12:01:33,886 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:01:33,886 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] [2018-12-09 12:01:33,886 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:01:33,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:01:33,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1121194702, now seen corresponding path program 1 times [2018-12-09 12:01:33,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:01:33,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:33,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:01:33,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:33,888 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:01:33,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:01:33,940 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-09 12:01:33,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:01:33,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:01:33,940 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:01:33,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:01:33,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:01:33,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:01:33,941 INFO L87 Difference]: Start difference. First operand 24713 states and 78043 transitions. Second operand 6 states. [2018-12-09 12:01:34,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:01:34,367 INFO L93 Difference]: Finished difference Result 35355 states and 111009 transitions. [2018-12-09 12:01:34,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 12:01:34,367 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-12-09 12:01:34,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:01:34,412 INFO L225 Difference]: With dead ends: 35355 [2018-12-09 12:01:34,412 INFO L226 Difference]: Without dead ends: 35283 [2018-12-09 12:01:34,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-12-09 12:01:34,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35283 states. [2018-12-09 12:01:34,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35283 to 24760. [2018-12-09 12:01:34,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24760 states. [2018-12-09 12:01:34,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24760 states to 24760 states and 78149 transitions. [2018-12-09 12:01:34,851 INFO L78 Accepts]: Start accepts. Automaton has 24760 states and 78149 transitions. Word has length 54 [2018-12-09 12:01:34,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:01:34,852 INFO L480 AbstractCegarLoop]: Abstraction has 24760 states and 78149 transitions. [2018-12-09 12:01:34,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:01:34,852 INFO L276 IsEmpty]: Start isEmpty. Operand 24760 states and 78149 transitions. [2018-12-09 12:01:34,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-09 12:01:34,856 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:01:34,856 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] [2018-12-09 12:01:34,856 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:01:34,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:01:34,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1656702890, now seen corresponding path program 1 times [2018-12-09 12:01:34,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:01:34,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:34,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:01:34,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:34,859 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:01:34,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:01:34,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-09 12:01:34,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:01:34,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:01:34,905 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:01:34,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:01:34,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:01:34,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:01:34,905 INFO L87 Difference]: Start difference. First operand 24760 states and 78149 transitions. Second operand 4 states. [2018-12-09 12:01:35,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:01:35,033 INFO L93 Difference]: Finished difference Result 27198 states and 85598 transitions. [2018-12-09 12:01:35,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 12:01:35,033 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2018-12-09 12:01:35,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:01:35,068 INFO L225 Difference]: With dead ends: 27198 [2018-12-09 12:01:35,069 INFO L226 Difference]: Without dead ends: 27198 [2018-12-09 12:01:35,069 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-09 12:01:35,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27198 states. [2018-12-09 12:01:35,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27198 to 25605. [2018-12-09 12:01:35,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25605 states. [2018-12-09 12:01:35,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25605 states to 25605 states and 80704 transitions. [2018-12-09 12:01:35,365 INFO L78 Accepts]: Start accepts. Automaton has 25605 states and 80704 transitions. Word has length 62 [2018-12-09 12:01:35,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:01:35,365 INFO L480 AbstractCegarLoop]: Abstraction has 25605 states and 80704 transitions. [2018-12-09 12:01:35,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:01:35,365 INFO L276 IsEmpty]: Start isEmpty. Operand 25605 states and 80704 transitions. [2018-12-09 12:01:35,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-09 12:01:35,369 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:01:35,370 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] [2018-12-09 12:01:35,370 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:01:35,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:01:35,370 INFO L82 PathProgramCache]: Analyzing trace with hash -895454071, now seen corresponding path program 1 times [2018-12-09 12:01:35,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:01:35,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:35,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:01:35,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:35,372 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:01:35,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:01:35,411 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-09 12:01:35,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:01:35,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:01:35,411 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:01:35,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:01:35,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:01:35,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:01:35,412 INFO L87 Difference]: Start difference. First operand 25605 states and 80704 transitions. Second operand 6 states. [2018-12-09 12:01:35,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:01:35,887 INFO L93 Difference]: Finished difference Result 53487 states and 166575 transitions. [2018-12-09 12:01:35,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 12:01:35,887 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2018-12-09 12:01:35,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:01:35,958 INFO L225 Difference]: With dead ends: 53487 [2018-12-09 12:01:35,959 INFO L226 Difference]: Without dead ends: 53416 [2018-12-09 12:01:35,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-09 12:01:36,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53416 states. [2018-12-09 12:01:36,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53416 to 33743. [2018-12-09 12:01:36,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33743 states. [2018-12-09 12:01:36,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33743 states to 33743 states and 103588 transitions. [2018-12-09 12:01:36,450 INFO L78 Accepts]: Start accepts. Automaton has 33743 states and 103588 transitions. Word has length 62 [2018-12-09 12:01:36,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:01:36,450 INFO L480 AbstractCegarLoop]: Abstraction has 33743 states and 103588 transitions. [2018-12-09 12:01:36,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:01:36,450 INFO L276 IsEmpty]: Start isEmpty. Operand 33743 states and 103588 transitions. [2018-12-09 12:01:36,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 12:01:36,456 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:01:36,456 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:01:36,456 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:01:36,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:01:36,456 INFO L82 PathProgramCache]: Analyzing trace with hash -191697734, now seen corresponding path program 1 times [2018-12-09 12:01:36,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:01:36,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:36,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:01:36,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:36,458 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:01:36,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:01:36,485 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-09 12:01:36,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:01:36,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 12:01:36,486 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:01:36,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 12:01:36,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 12:01:36,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:01:36,486 INFO L87 Difference]: Start difference. First operand 33743 states and 103588 transitions. Second operand 3 states. [2018-12-09 12:01:36,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:01:36,642 INFO L93 Difference]: Finished difference Result 42382 states and 129040 transitions. [2018-12-09 12:01:36,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 12:01:36,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-12-09 12:01:36,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:01:36,692 INFO L225 Difference]: With dead ends: 42382 [2018-12-09 12:01:36,693 INFO L226 Difference]: Without dead ends: 42382 [2018-12-09 12:01:36,693 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-09 12:01:36,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42382 states. [2018-12-09 12:01:37,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42382 to 34500. [2018-12-09 12:01:37,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34500 states. [2018-12-09 12:01:37,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34500 states to 34500 states and 104065 transitions. [2018-12-09 12:01:37,214 INFO L78 Accepts]: Start accepts. Automaton has 34500 states and 104065 transitions. Word has length 68 [2018-12-09 12:01:37,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:01:37,214 INFO L480 AbstractCegarLoop]: Abstraction has 34500 states and 104065 transitions. [2018-12-09 12:01:37,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 12:01:37,215 INFO L276 IsEmpty]: Start isEmpty. Operand 34500 states and 104065 transitions. [2018-12-09 12:01:37,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-09 12:01:37,223 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:01:37,223 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] [2018-12-09 12:01:37,223 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:01:37,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:01:37,224 INFO L82 PathProgramCache]: Analyzing trace with hash -690040115, now seen corresponding path program 1 times [2018-12-09 12:01:37,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:01:37,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:37,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:01:37,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:37,225 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:01:37,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:01:37,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:01:37,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:01:37,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:01:37,283 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:01:37,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:01:37,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:01:37,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:01:37,283 INFO L87 Difference]: Start difference. First operand 34500 states and 104065 transitions. Second operand 5 states. [2018-12-09 12:01:37,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:01:37,573 INFO L93 Difference]: Finished difference Result 39525 states and 118876 transitions. [2018-12-09 12:01:37,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 12:01:37,574 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2018-12-09 12:01:37,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:01:37,620 INFO L225 Difference]: With dead ends: 39525 [2018-12-09 12:01:37,620 INFO L226 Difference]: Without dead ends: 39525 [2018-12-09 12:01:37,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-09 12:01:37,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39525 states. [2018-12-09 12:01:37,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39525 to 37850. [2018-12-09 12:01:37,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37850 states. [2018-12-09 12:01:38,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37850 states to 37850 states and 113960 transitions. [2018-12-09 12:01:38,031 INFO L78 Accepts]: Start accepts. Automaton has 37850 states and 113960 transitions. Word has length 74 [2018-12-09 12:01:38,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:01:38,031 INFO L480 AbstractCegarLoop]: Abstraction has 37850 states and 113960 transitions. [2018-12-09 12:01:38,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:01:38,031 INFO L276 IsEmpty]: Start isEmpty. Operand 37850 states and 113960 transitions. [2018-12-09 12:01:38,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-09 12:01:38,041 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:01:38,041 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] [2018-12-09 12:01:38,041 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:01:38,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:01:38,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1052770220, now seen corresponding path program 1 times [2018-12-09 12:01:38,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:01:38,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:38,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:01:38,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:38,043 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:01:38,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:01:38,100 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-09 12:01:38,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:01:38,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 12:01:38,100 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:01:38,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 12:01:38,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 12:01:38,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:01:38,101 INFO L87 Difference]: Start difference. First operand 37850 states and 113960 transitions. Second operand 7 states. [2018-12-09 12:01:38,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:01:38,662 INFO L93 Difference]: Finished difference Result 45108 states and 135862 transitions. [2018-12-09 12:01:38,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 12:01:38,662 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2018-12-09 12:01:38,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:01:38,715 INFO L225 Difference]: With dead ends: 45108 [2018-12-09 12:01:38,715 INFO L226 Difference]: Without dead ends: 45021 [2018-12-09 12:01:38,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-12-09 12:01:38,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45021 states. [2018-12-09 12:01:39,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45021 to 34028. [2018-12-09 12:01:39,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34028 states. [2018-12-09 12:01:39,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34028 states to 34028 states and 103850 transitions. [2018-12-09 12:01:39,142 INFO L78 Accepts]: Start accepts. Automaton has 34028 states and 103850 transitions. Word has length 74 [2018-12-09 12:01:39,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:01:39,143 INFO L480 AbstractCegarLoop]: Abstraction has 34028 states and 103850 transitions. [2018-12-09 12:01:39,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 12:01:39,143 INFO L276 IsEmpty]: Start isEmpty. Operand 34028 states and 103850 transitions. [2018-12-09 12:01:39,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-09 12:01:39,153 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:01:39,154 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] [2018-12-09 12:01:39,154 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:01:39,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:01:39,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1736865076, now seen corresponding path program 1 times [2018-12-09 12:01:39,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:01:39,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:39,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:01:39,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:39,155 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:01:39,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:01:39,183 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-09 12:01:39,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:01:39,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:01:39,183 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:01:39,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:01:39,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:01:39,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:01:39,184 INFO L87 Difference]: Start difference. First operand 34028 states and 103850 transitions. Second operand 4 states. [2018-12-09 12:01:39,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:01:39,669 INFO L93 Difference]: Finished difference Result 47561 states and 141031 transitions. [2018-12-09 12:01:39,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 12:01:39,669 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2018-12-09 12:01:39,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:01:39,722 INFO L225 Difference]: With dead ends: 47561 [2018-12-09 12:01:39,722 INFO L226 Difference]: Without dead ends: 47561 [2018-12-09 12:01:39,722 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-09 12:01:39,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47561 states. [2018-12-09 12:01:40,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47561 to 42225. [2018-12-09 12:01:40,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42225 states. [2018-12-09 12:01:40,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42225 states to 42225 states and 126425 transitions. [2018-12-09 12:01:40,241 INFO L78 Accepts]: Start accepts. Automaton has 42225 states and 126425 transitions. Word has length 76 [2018-12-09 12:01:40,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:01:40,241 INFO L480 AbstractCegarLoop]: Abstraction has 42225 states and 126425 transitions. [2018-12-09 12:01:40,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:01:40,241 INFO L276 IsEmpty]: Start isEmpty. Operand 42225 states and 126425 transitions. [2018-12-09 12:01:40,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-09 12:01:40,255 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:01:40,255 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] [2018-12-09 12:01:40,255 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:01:40,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:01:40,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1204792523, now seen corresponding path program 1 times [2018-12-09 12:01:40,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:01:40,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:40,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:01:40,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:40,257 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:01:40,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:01:40,305 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-09 12:01:40,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:01:40,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 12:01:40,305 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:01:40,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 12:01:40,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 12:01:40,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:01:40,306 INFO L87 Difference]: Start difference. First operand 42225 states and 126425 transitions. Second operand 7 states. [2018-12-09 12:01:41,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:01:41,100 INFO L93 Difference]: Finished difference Result 98343 states and 291285 transitions. [2018-12-09 12:01:41,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 12:01:41,100 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 76 [2018-12-09 12:01:41,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:01:41,224 INFO L225 Difference]: With dead ends: 98343 [2018-12-09 12:01:41,224 INFO L226 Difference]: Without dead ends: 98279 [2018-12-09 12:01:41,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2018-12-09 12:01:41,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98279 states. [2018-12-09 12:01:42,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98279 to 57323. [2018-12-09 12:01:42,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57323 states. [2018-12-09 12:01:42,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57323 states to 57323 states and 168943 transitions. [2018-12-09 12:01:42,102 INFO L78 Accepts]: Start accepts. Automaton has 57323 states and 168943 transitions. Word has length 76 [2018-12-09 12:01:42,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:01:42,103 INFO L480 AbstractCegarLoop]: Abstraction has 57323 states and 168943 transitions. [2018-12-09 12:01:42,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 12:01:42,103 INFO L276 IsEmpty]: Start isEmpty. Operand 57323 states and 168943 transitions. [2018-12-09 12:01:42,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 12:01:42,126 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:01:42,127 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] [2018-12-09 12:01:42,127 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:01:42,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:01:42,127 INFO L82 PathProgramCache]: Analyzing trace with hash -885471404, now seen corresponding path program 1 times [2018-12-09 12:01:42,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:01:42,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:42,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:01:42,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:42,128 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:01:42,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:01:42,177 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-09 12:01:42,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:01:42,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:01:42,177 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:01:42,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:01:42,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:01:42,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:01:42,178 INFO L87 Difference]: Start difference. First operand 57323 states and 168943 transitions. Second operand 4 states. [2018-12-09 12:01:42,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:01:42,459 INFO L93 Difference]: Finished difference Result 63745 states and 186999 transitions. [2018-12-09 12:01:42,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:01:42,459 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2018-12-09 12:01:42,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:01:42,541 INFO L225 Difference]: With dead ends: 63745 [2018-12-09 12:01:42,542 INFO L226 Difference]: Without dead ends: 63745 [2018-12-09 12:01:42,542 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-09 12:01:42,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63745 states. [2018-12-09 12:01:43,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63745 to 62467. [2018-12-09 12:01:43,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62467 states. [2018-12-09 12:01:43,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62467 states to 62467 states and 183268 transitions. [2018-12-09 12:01:43,319 INFO L78 Accepts]: Start accepts. Automaton has 62467 states and 183268 transitions. Word has length 82 [2018-12-09 12:01:43,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:01:43,319 INFO L480 AbstractCegarLoop]: Abstraction has 62467 states and 183268 transitions. [2018-12-09 12:01:43,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:01:43,319 INFO L276 IsEmpty]: Start isEmpty. Operand 62467 states and 183268 transitions. [2018-12-09 12:01:43,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 12:01:43,459 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:01:43,459 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] [2018-12-09 12:01:43,459 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:01:43,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:01:43,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1332286549, now seen corresponding path program 1 times [2018-12-09 12:01:43,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:01:43,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:43,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:01:43,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:43,461 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:01:43,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:01:43,483 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-09 12:01:43,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:01:43,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 12:01:43,483 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:01:43,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 12:01:43,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 12:01:43,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:01:43,484 INFO L87 Difference]: Start difference. First operand 62467 states and 183268 transitions. Second operand 3 states. [2018-12-09 12:01:43,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:01:43,785 INFO L93 Difference]: Finished difference Result 74968 states and 215886 transitions. [2018-12-09 12:01:43,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 12:01:43,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2018-12-09 12:01:43,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:01:43,873 INFO L225 Difference]: With dead ends: 74968 [2018-12-09 12:01:43,873 INFO L226 Difference]: Without dead ends: 74968 [2018-12-09 12:01:43,873 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-09 12:01:43,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74968 states. [2018-12-09 12:01:44,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74968 to 70220. [2018-12-09 12:01:44,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70220 states. [2018-12-09 12:01:44,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70220 states to 70220 states and 203363 transitions. [2018-12-09 12:01:44,663 INFO L78 Accepts]: Start accepts. Automaton has 70220 states and 203363 transitions. Word has length 82 [2018-12-09 12:01:44,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:01:44,663 INFO L480 AbstractCegarLoop]: Abstraction has 70220 states and 203363 transitions. [2018-12-09 12:01:44,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 12:01:44,664 INFO L276 IsEmpty]: Start isEmpty. Operand 70220 states and 203363 transitions. [2018-12-09 12:01:44,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-09 12:01:44,692 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:01:44,692 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] [2018-12-09 12:01:44,693 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:01:44,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:01:44,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1045447395, now seen corresponding path program 1 times [2018-12-09 12:01:44,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:01:44,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:44,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:01:44,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:44,694 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:01:44,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:01:44,719 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-09 12:01:44,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:01:44,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:01:44,719 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:01:44,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:01:44,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:01:44,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:01:44,720 INFO L87 Difference]: Start difference. First operand 70220 states and 203363 transitions. Second operand 4 states. [2018-12-09 12:01:44,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:01:44,953 INFO L93 Difference]: Finished difference Result 76675 states and 219295 transitions. [2018-12-09 12:01:44,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:01:44,954 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2018-12-09 12:01:44,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:01:45,048 INFO L225 Difference]: With dead ends: 76675 [2018-12-09 12:01:45,048 INFO L226 Difference]: Without dead ends: 76675 [2018-12-09 12:01:45,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:01:45,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76675 states. [2018-12-09 12:01:45,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76675 to 71702. [2018-12-09 12:01:45,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71702 states. [2018-12-09 12:01:45,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71702 states to 71702 states and 205099 transitions. [2018-12-09 12:01:45,894 INFO L78 Accepts]: Start accepts. Automaton has 71702 states and 205099 transitions. Word has length 83 [2018-12-09 12:01:45,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:01:45,894 INFO L480 AbstractCegarLoop]: Abstraction has 71702 states and 205099 transitions. [2018-12-09 12:01:45,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:01:45,894 INFO L276 IsEmpty]: Start isEmpty. Operand 71702 states and 205099 transitions. [2018-12-09 12:01:45,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-09 12:01:45,921 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:01:45,921 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] [2018-12-09 12:01:45,921 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:01:45,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:01:45,921 INFO L82 PathProgramCache]: Analyzing trace with hash 261296668, now seen corresponding path program 1 times [2018-12-09 12:01:45,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:01:45,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:45,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:01:45,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:45,923 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:01:45,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:01:45,996 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-09 12:01:45,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:01:45,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 12:01:45,996 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:01:45,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 12:01:45,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 12:01:45,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 12:01:45,997 INFO L87 Difference]: Start difference. First operand 71702 states and 205099 transitions. Second operand 8 states. [2018-12-09 12:01:47,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:01:47,909 INFO L93 Difference]: Finished difference Result 164487 states and 482593 transitions. [2018-12-09 12:01:47,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-09 12:01:47,909 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 83 [2018-12-09 12:01:47,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:01:48,121 INFO L225 Difference]: With dead ends: 164487 [2018-12-09 12:01:48,121 INFO L226 Difference]: Without dead ends: 164487 [2018-12-09 12:01:48,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=183, Invalid=629, Unknown=0, NotChecked=0, Total=812 [2018-12-09 12:01:48,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164487 states. [2018-12-09 12:01:49,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164487 to 99573. [2018-12-09 12:01:49,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99573 states. [2018-12-09 12:01:49,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99573 states to 99573 states and 291954 transitions. [2018-12-09 12:01:49,660 INFO L78 Accepts]: Start accepts. Automaton has 99573 states and 291954 transitions. Word has length 83 [2018-12-09 12:01:49,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:01:49,660 INFO L480 AbstractCegarLoop]: Abstraction has 99573 states and 291954 transitions. [2018-12-09 12:01:49,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 12:01:49,660 INFO L276 IsEmpty]: Start isEmpty. Operand 99573 states and 291954 transitions. [2018-12-09 12:01:49,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-09 12:01:49,695 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:01:49,696 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] [2018-12-09 12:01:49,696 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:01:49,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:01:49,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1148800349, now seen corresponding path program 1 times [2018-12-09 12:01:49,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:01:49,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:49,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:01:49,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:49,697 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:01:49,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:01:49,772 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-09 12:01:49,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:01:49,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 12:01:49,772 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:01:49,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 12:01:49,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 12:01:49,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:01:49,772 INFO L87 Difference]: Start difference. First operand 99573 states and 291954 transitions. Second operand 7 states. [2018-12-09 12:01:50,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:01:50,180 INFO L93 Difference]: Finished difference Result 129729 states and 381989 transitions. [2018-12-09 12:01:50,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 12:01:50,180 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2018-12-09 12:01:50,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:01:50,352 INFO L225 Difference]: With dead ends: 129729 [2018-12-09 12:01:50,352 INFO L226 Difference]: Without dead ends: 129729 [2018-12-09 12:01:50,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-09 12:01:50,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129729 states. [2018-12-09 12:01:51,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129729 to 85081. [2018-12-09 12:01:51,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85081 states. [2018-12-09 12:01:51,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85081 states to 85081 states and 245768 transitions. [2018-12-09 12:01:51,570 INFO L78 Accepts]: Start accepts. Automaton has 85081 states and 245768 transitions. Word has length 83 [2018-12-09 12:01:51,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:01:51,570 INFO L480 AbstractCegarLoop]: Abstraction has 85081 states and 245768 transitions. [2018-12-09 12:01:51,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 12:01:51,570 INFO L276 IsEmpty]: Start isEmpty. Operand 85081 states and 245768 transitions. [2018-12-09 12:01:51,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-09 12:01:51,598 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:01:51,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] [2018-12-09 12:01:51,598 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:01:51,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:01:51,598 INFO L82 PathProgramCache]: Analyzing trace with hash -583175203, now seen corresponding path program 1 times [2018-12-09 12:01:51,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:01:51,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:51,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:01:51,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:51,600 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:01:51,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:01:51,688 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-09 12:01:51,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:01:51,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:01:51,689 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:01:51,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:01:51,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:01:51,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:01:51,689 INFO L87 Difference]: Start difference. First operand 85081 states and 245768 transitions. Second operand 5 states. [2018-12-09 12:01:52,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:01:52,137 INFO L93 Difference]: Finished difference Result 85353 states and 246524 transitions. [2018-12-09 12:01:52,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 12:01:52,138 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2018-12-09 12:01:52,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:01:52,235 INFO L225 Difference]: With dead ends: 85353 [2018-12-09 12:01:52,235 INFO L226 Difference]: Without dead ends: 85353 [2018-12-09 12:01:52,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:01:52,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85353 states. [2018-12-09 12:01:52,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85353 to 85177. [2018-12-09 12:01:52,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85177 states. [2018-12-09 12:01:53,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85177 states to 85177 states and 246040 transitions. [2018-12-09 12:01:53,115 INFO L78 Accepts]: Start accepts. Automaton has 85177 states and 246040 transitions. Word has length 83 [2018-12-09 12:01:53,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:01:53,115 INFO L480 AbstractCegarLoop]: Abstraction has 85177 states and 246040 transitions. [2018-12-09 12:01:53,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:01:53,115 INFO L276 IsEmpty]: Start isEmpty. Operand 85177 states and 246040 transitions. [2018-12-09 12:01:53,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-09 12:01:53,144 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:01:53,144 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] [2018-12-09 12:01:53,144 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:01:53,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:01:53,144 INFO L82 PathProgramCache]: Analyzing trace with hash 304328478, now seen corresponding path program 1 times [2018-12-09 12:01:53,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:01:53,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:53,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:01:53,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:53,145 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:01:53,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:01:53,202 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-09 12:01:53,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:01:53,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:01:53,202 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:01:53,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:01:53,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:01:53,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:01:53,203 INFO L87 Difference]: Start difference. First operand 85177 states and 246040 transitions. Second operand 5 states. [2018-12-09 12:01:53,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:01:53,282 INFO L93 Difference]: Finished difference Result 31369 states and 74664 transitions. [2018-12-09 12:01:53,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 12:01:53,282 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2018-12-09 12:01:53,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:01:53,303 INFO L225 Difference]: With dead ends: 31369 [2018-12-09 12:01:53,303 INFO L226 Difference]: Without dead ends: 27633 [2018-12-09 12:01:53,303 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-09 12:01:53,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27633 states. [2018-12-09 12:01:53,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27633 to 24406. [2018-12-09 12:01:53,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24406 states. [2018-12-09 12:01:53,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24406 states to 24406 states and 57167 transitions. [2018-12-09 12:01:53,523 INFO L78 Accepts]: Start accepts. Automaton has 24406 states and 57167 transitions. Word has length 83 [2018-12-09 12:01:53,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:01:53,523 INFO L480 AbstractCegarLoop]: Abstraction has 24406 states and 57167 transitions. [2018-12-09 12:01:53,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:01:53,523 INFO L276 IsEmpty]: Start isEmpty. Operand 24406 states and 57167 transitions. [2018-12-09 12:01:53,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-09 12:01:53,540 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:01:53,540 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:01:53,541 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:01:53,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:01:53,541 INFO L82 PathProgramCache]: Analyzing trace with hash 36830225, now seen corresponding path program 1 times [2018-12-09 12:01:53,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:01:53,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:53,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:01:53,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:53,542 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:01:53,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:01:53,593 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-09 12:01:53,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:01:53,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 12:01:53,593 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:01:53,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 12:01:53,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 12:01:53,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:01:53,594 INFO L87 Difference]: Start difference. First operand 24406 states and 57167 transitions. Second operand 7 states. [2018-12-09 12:01:54,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:01:54,077 INFO L93 Difference]: Finished difference Result 32759 states and 76830 transitions. [2018-12-09 12:01:54,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 12:01:54,077 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 111 [2018-12-09 12:01:54,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:01:54,100 INFO L225 Difference]: With dead ends: 32759 [2018-12-09 12:01:54,100 INFO L226 Difference]: Without dead ends: 32759 [2018-12-09 12:01:54,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-12-09 12:01:54,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32759 states. [2018-12-09 12:01:54,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32759 to 24724. [2018-12-09 12:01:54,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24724 states. [2018-12-09 12:01:54,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24724 states to 24724 states and 57984 transitions. [2018-12-09 12:01:54,356 INFO L78 Accepts]: Start accepts. Automaton has 24724 states and 57984 transitions. Word has length 111 [2018-12-09 12:01:54,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:01:54,356 INFO L480 AbstractCegarLoop]: Abstraction has 24724 states and 57984 transitions. [2018-12-09 12:01:54,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 12:01:54,356 INFO L276 IsEmpty]: Start isEmpty. Operand 24724 states and 57984 transitions. [2018-12-09 12:01:54,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-09 12:01:54,374 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:01:54,374 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:01:54,374 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:01:54,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:01:54,374 INFO L82 PathProgramCache]: Analyzing trace with hash 924333906, now seen corresponding path program 1 times [2018-12-09 12:01:54,374 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:01:54,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:54,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:01:54,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:54,376 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:01:54,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:01:54,465 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-09 12:01:54,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:01:54,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 12:01:54,466 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:01:54,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 12:01:54,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 12:01:54,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-09 12:01:54,467 INFO L87 Difference]: Start difference. First operand 24724 states and 57984 transitions. Second operand 8 states. [2018-12-09 12:01:55,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:01:55,047 INFO L93 Difference]: Finished difference Result 31302 states and 72748 transitions. [2018-12-09 12:01:55,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 12:01:55,047 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 111 [2018-12-09 12:01:55,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:01:55,069 INFO L225 Difference]: With dead ends: 31302 [2018-12-09 12:01:55,069 INFO L226 Difference]: Without dead ends: 31302 [2018-12-09 12:01:55,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-12-09 12:01:55,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31302 states. [2018-12-09 12:01:55,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31302 to 25850. [2018-12-09 12:01:55,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25850 states. [2018-12-09 12:01:55,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25850 states to 25850 states and 60003 transitions. [2018-12-09 12:01:55,318 INFO L78 Accepts]: Start accepts. Automaton has 25850 states and 60003 transitions. Word has length 111 [2018-12-09 12:01:55,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:01:55,319 INFO L480 AbstractCegarLoop]: Abstraction has 25850 states and 60003 transitions. [2018-12-09 12:01:55,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 12:01:55,319 INFO L276 IsEmpty]: Start isEmpty. Operand 25850 states and 60003 transitions. [2018-12-09 12:01:55,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-09 12:01:55,338 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:01:55,338 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:01:55,338 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:01:55,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:01:55,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1741993816, now seen corresponding path program 2 times [2018-12-09 12:01:55,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:01:55,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:55,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:01:55,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:55,340 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:01:55,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:01:55,391 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-09 12:01:55,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:01:55,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:01:55,391 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:01:55,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:01:55,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:01:55,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:01:55,392 INFO L87 Difference]: Start difference. First operand 25850 states and 60003 transitions. Second operand 5 states. [2018-12-09 12:01:55,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:01:55,584 INFO L93 Difference]: Finished difference Result 26271 states and 60898 transitions. [2018-12-09 12:01:55,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 12:01:55,585 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2018-12-09 12:01:55,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:01:55,605 INFO L225 Difference]: With dead ends: 26271 [2018-12-09 12:01:55,605 INFO L226 Difference]: Without dead ends: 26271 [2018-12-09 12:01:55,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:01:55,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26271 states. [2018-12-09 12:01:55,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26271 to 26060. [2018-12-09 12:01:55,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26060 states. [2018-12-09 12:01:55,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26060 states to 26060 states and 60464 transitions. [2018-12-09 12:01:55,842 INFO L78 Accepts]: Start accepts. Automaton has 26060 states and 60464 transitions. Word has length 111 [2018-12-09 12:01:55,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:01:55,842 INFO L480 AbstractCegarLoop]: Abstraction has 26060 states and 60464 transitions. [2018-12-09 12:01:55,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:01:55,843 INFO L276 IsEmpty]: Start isEmpty. Operand 26060 states and 60464 transitions. [2018-12-09 12:01:55,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 12:01:55,863 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:01:55,863 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:01:55,863 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:01:55,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:01:55,864 INFO L82 PathProgramCache]: Analyzing trace with hash -908801281, now seen corresponding path program 1 times [2018-12-09 12:01:55,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:01:55,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:55,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 12:01:55,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:55,865 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:01:55,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:01:55,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:01:55,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:01:55,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:01:55,933 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:01:55,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:01:55,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:01:55,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:01:55,934 INFO L87 Difference]: Start difference. First operand 26060 states and 60464 transitions. Second operand 6 states. [2018-12-09 12:01:56,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:01:56,073 INFO L93 Difference]: Finished difference Result 25916 states and 59880 transitions. [2018-12-09 12:01:56,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 12:01:56,074 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2018-12-09 12:01:56,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:01:56,101 INFO L225 Difference]: With dead ends: 25916 [2018-12-09 12:01:56,101 INFO L226 Difference]: Without dead ends: 25916 [2018-12-09 12:01:56,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-09 12:01:56,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25916 states. [2018-12-09 12:01:56,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25916 to 22374. [2018-12-09 12:01:56,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22374 states. [2018-12-09 12:01:56,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22374 states to 22374 states and 51818 transitions. [2018-12-09 12:01:56,299 INFO L78 Accepts]: Start accepts. Automaton has 22374 states and 51818 transitions. Word has length 113 [2018-12-09 12:01:56,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:01:56,299 INFO L480 AbstractCegarLoop]: Abstraction has 22374 states and 51818 transitions. [2018-12-09 12:01:56,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:01:56,299 INFO L276 IsEmpty]: Start isEmpty. Operand 22374 states and 51818 transitions. [2018-12-09 12:01:56,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 12:01:56,314 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:01:56,315 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:01:56,315 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:01:56,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:01:56,315 INFO L82 PathProgramCache]: Analyzing trace with hash -208552958, now seen corresponding path program 1 times [2018-12-09 12:01:56,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:01:56,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:56,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:01:56,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:56,316 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:01:56,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:01:56,359 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-09 12:01:56,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:01:56,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:01:56,360 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:01:56,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:01:56,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:01:56,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:01:56,360 INFO L87 Difference]: Start difference. First operand 22374 states and 51818 transitions. Second operand 6 states. [2018-12-09 12:01:56,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:01:56,642 INFO L93 Difference]: Finished difference Result 26039 states and 59713 transitions. [2018-12-09 12:01:56,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 12:01:56,642 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2018-12-09 12:01:56,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:01:56,661 INFO L225 Difference]: With dead ends: 26039 [2018-12-09 12:01:56,661 INFO L226 Difference]: Without dead ends: 26039 [2018-12-09 12:01:56,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-09 12:01:56,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26039 states. [2018-12-09 12:01:56,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26039 to 22456. [2018-12-09 12:01:56,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22456 states. [2018-12-09 12:01:56,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22456 states to 22456 states and 51970 transitions. [2018-12-09 12:01:56,897 INFO L78 Accepts]: Start accepts. Automaton has 22456 states and 51970 transitions. Word has length 113 [2018-12-09 12:01:56,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:01:56,897 INFO L480 AbstractCegarLoop]: Abstraction has 22456 states and 51970 transitions. [2018-12-09 12:01:56,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:01:56,897 INFO L276 IsEmpty]: Start isEmpty. Operand 22456 states and 51970 transitions. [2018-12-09 12:01:56,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-09 12:01:56,913 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:01:56,913 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 12:01:56,913 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:01:56,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:01:56,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1956799327, now seen corresponding path program 1 times [2018-12-09 12:01:56,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:01:56,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:56,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:01:56,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:56,914 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:01:56,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:01:56,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:01:56,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:01:56,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 12:01:56,993 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:01:56,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 12:01:56,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 12:01:56,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:01:56,993 INFO L87 Difference]: Start difference. First operand 22456 states and 51970 transitions. Second operand 7 states. [2018-12-09 12:01:57,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:01:57,278 INFO L93 Difference]: Finished difference Result 30831 states and 70414 transitions. [2018-12-09 12:01:57,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 12:01:57,278 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2018-12-09 12:01:57,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:01:57,299 INFO L225 Difference]: With dead ends: 30831 [2018-12-09 12:01:57,299 INFO L226 Difference]: Without dead ends: 30800 [2018-12-09 12:01:57,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-09 12:01:57,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30800 states. [2018-12-09 12:01:57,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30800 to 24408. [2018-12-09 12:01:57,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24408 states. [2018-12-09 12:01:57,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24408 states to 24408 states and 56120 transitions. [2018-12-09 12:01:57,541 INFO L78 Accepts]: Start accepts. Automaton has 24408 states and 56120 transitions. Word has length 115 [2018-12-09 12:01:57,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:01:57,541 INFO L480 AbstractCegarLoop]: Abstraction has 24408 states and 56120 transitions. [2018-12-09 12:01:57,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 12:01:57,541 INFO L276 IsEmpty]: Start isEmpty. Operand 24408 states and 56120 transitions. [2018-12-09 12:01:57,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-09 12:01:57,557 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:01:57,557 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:01:57,557 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:01:57,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:01:57,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1263697630, now seen corresponding path program 1 times [2018-12-09 12:01:57,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:01:57,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:57,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:01:57,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:57,559 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:01:57,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:01:57,627 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-09 12:01:57,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:01:57,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 12:01:57,628 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:01:57,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 12:01:57,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 12:01:57,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:01:57,629 INFO L87 Difference]: Start difference. First operand 24408 states and 56120 transitions. Second operand 7 states. [2018-12-09 12:01:57,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:01:57,939 INFO L93 Difference]: Finished difference Result 31703 states and 71524 transitions. [2018-12-09 12:01:57,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 12:01:57,939 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2018-12-09 12:01:57,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:01:57,961 INFO L225 Difference]: With dead ends: 31703 [2018-12-09 12:01:57,962 INFO L226 Difference]: Without dead ends: 31703 [2018-12-09 12:01:57,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-12-09 12:01:57,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31703 states. [2018-12-09 12:01:58,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31703 to 27324. [2018-12-09 12:01:58,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27324 states. [2018-12-09 12:01:58,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27324 states to 27324 states and 62116 transitions. [2018-12-09 12:01:58,223 INFO L78 Accepts]: Start accepts. Automaton has 27324 states and 62116 transitions. Word has length 115 [2018-12-09 12:01:58,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:01:58,223 INFO L480 AbstractCegarLoop]: Abstraction has 27324 states and 62116 transitions. [2018-12-09 12:01:58,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 12:01:58,223 INFO L276 IsEmpty]: Start isEmpty. Operand 27324 states and 62116 transitions. [2018-12-09 12:01:58,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-09 12:01:58,243 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:01:58,243 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:01:58,243 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:01:58,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:01:58,243 INFO L82 PathProgramCache]: Analyzing trace with hash 954060323, now seen corresponding path program 1 times [2018-12-09 12:01:58,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:01:58,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:58,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:01:58,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:58,244 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:01:58,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:01:58,323 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-09 12:01:58,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:01:58,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 12:01:58,323 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:01:58,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 12:01:58,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 12:01:58,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:01:58,323 INFO L87 Difference]: Start difference. First operand 27324 states and 62116 transitions. Second operand 7 states. [2018-12-09 12:01:58,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:01:58,501 INFO L93 Difference]: Finished difference Result 28326 states and 64294 transitions. [2018-12-09 12:01:58,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 12:01:58,501 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2018-12-09 12:01:58,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:01:58,522 INFO L225 Difference]: With dead ends: 28326 [2018-12-09 12:01:58,522 INFO L226 Difference]: Without dead ends: 28326 [2018-12-09 12:01:58,522 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-09 12:01:58,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28326 states. [2018-12-09 12:01:58,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28326 to 27745. [2018-12-09 12:01:58,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27745 states. [2018-12-09 12:01:58,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27745 states to 27745 states and 63101 transitions. [2018-12-09 12:01:58,764 INFO L78 Accepts]: Start accepts. Automaton has 27745 states and 63101 transitions. Word has length 115 [2018-12-09 12:01:58,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:01:58,765 INFO L480 AbstractCegarLoop]: Abstraction has 27745 states and 63101 transitions. [2018-12-09 12:01:58,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 12:01:58,765 INFO L276 IsEmpty]: Start isEmpty. Operand 27745 states and 63101 transitions. [2018-12-09 12:01:58,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-09 12:01:58,786 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:01:58,786 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:01:58,786 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:01:58,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:01:58,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1841564004, now seen corresponding path program 1 times [2018-12-09 12:01:58,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:01:58,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:58,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:01:58,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:58,788 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:01:58,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:01:58,809 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-09 12:01:58,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:01:58,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 12:01:58,809 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:01:58,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 12:01:58,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 12:01:58,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:01:58,810 INFO L87 Difference]: Start difference. First operand 27745 states and 63101 transitions. Second operand 3 states. [2018-12-09 12:01:58,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:01:58,877 INFO L93 Difference]: Finished difference Result 35107 states and 79339 transitions. [2018-12-09 12:01:58,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 12:01:58,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2018-12-09 12:01:58,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:01:58,904 INFO L225 Difference]: With dead ends: 35107 [2018-12-09 12:01:58,904 INFO L226 Difference]: Without dead ends: 35107 [2018-12-09 12:01:58,904 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-09 12:01:58,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35107 states. [2018-12-09 12:01:59,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35107 to 34803. [2018-12-09 12:01:59,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34803 states. [2018-12-09 12:01:59,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34803 states to 34803 states and 78676 transitions. [2018-12-09 12:01:59,198 INFO L78 Accepts]: Start accepts. Automaton has 34803 states and 78676 transitions. Word has length 115 [2018-12-09 12:01:59,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:01:59,198 INFO L480 AbstractCegarLoop]: Abstraction has 34803 states and 78676 transitions. [2018-12-09 12:01:59,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 12:01:59,199 INFO L276 IsEmpty]: Start isEmpty. Operand 34803 states and 78676 transitions. [2018-12-09 12:01:59,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-09 12:01:59,223 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:01:59,223 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:01:59,223 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:01:59,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:01:59,223 INFO L82 PathProgramCache]: Analyzing trace with hash -727922395, now seen corresponding path program 1 times [2018-12-09 12:01:59,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:01:59,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:59,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:01:59,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:59,225 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:01:59,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:01:59,298 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-09 12:01:59,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:01:59,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 12:01:59,299 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:01:59,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 12:01:59,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 12:01:59,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-09 12:01:59,299 INFO L87 Difference]: Start difference. First operand 34803 states and 78676 transitions. Second operand 9 states. [2018-12-09 12:01:59,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:01:59,453 INFO L93 Difference]: Finished difference Result 37702 states and 85576 transitions. [2018-12-09 12:01:59,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 12:01:59,453 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 115 [2018-12-09 12:01:59,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:01:59,457 INFO L225 Difference]: With dead ends: 37702 [2018-12-09 12:01:59,457 INFO L226 Difference]: Without dead ends: 5646 [2018-12-09 12:01:59,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-12-09 12:01:59,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5646 states. [2018-12-09 12:01:59,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5646 to 5646. [2018-12-09 12:01:59,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5646 states. [2018-12-09 12:01:59,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5646 states to 5646 states and 13093 transitions. [2018-12-09 12:01:59,492 INFO L78 Accepts]: Start accepts. Automaton has 5646 states and 13093 transitions. Word has length 115 [2018-12-09 12:01:59,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:01:59,493 INFO L480 AbstractCegarLoop]: Abstraction has 5646 states and 13093 transitions. [2018-12-09 12:01:59,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 12:01:59,493 INFO L276 IsEmpty]: Start isEmpty. Operand 5646 states and 13093 transitions. [2018-12-09 12:01:59,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-09 12:01:59,496 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:01:59,496 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:01:59,496 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:01:59,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:01:59,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1238572170, now seen corresponding path program 2 times [2018-12-09 12:01:59,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:01:59,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:59,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:01:59,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:01:59,497 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:01:59,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:01:59,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:01:59,542 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 12:01:59,641 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 12:01:59,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 12:01:59 BasicIcfg [2018-12-09 12:01:59,642 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 12:01:59,643 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 12:01:59,643 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 12:01:59,643 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 12:01:59,643 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:01:19" (3/4) ... [2018-12-09 12:01:59,645 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 12:01:59,741 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_326e7b72-16c9-4bed-9ead-688206d48365/bin-2019/utaipan/witness.graphml [2018-12-09 12:01:59,741 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 12:01:59,742 INFO L168 Benchmark]: Toolchain (without parser) took 40865.26 ms. Allocated memory was 1.0 GB in the beginning and 4.7 GB in the end (delta: 3.7 GB). Free memory was 952.4 MB in the beginning and 2.0 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. [2018-12-09 12:01:59,743 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 12:01:59,744 INFO L168 Benchmark]: CACSL2BoogieTranslator took 358.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.8 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -186.4 MB). Peak memory consumption was 38.3 MB. Max. memory is 11.5 GB. [2018-12-09 12:01:59,744 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.39 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-09 12:01:59,744 INFO L168 Benchmark]: Boogie Preprocessor took 22.03 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-09 12:01:59,744 INFO L168 Benchmark]: RCFGBuilder took 410.57 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: 58.6 MB). Peak memory consumption was 58.6 MB. Max. memory is 11.5 GB. [2018-12-09 12:01:59,744 INFO L168 Benchmark]: TraceAbstraction took 39938.77 ms. Allocated memory was 1.2 GB in the beginning and 4.7 GB in the end (delta: 3.5 GB). Free memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: -898.7 MB). Peak memory consumption was 2.6 GB. Max. memory is 11.5 GB. [2018-12-09 12:01:59,745 INFO L168 Benchmark]: Witness Printer took 98.70 ms. Allocated memory is still 4.7 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 12:01:59,746 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 358.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.8 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -186.4 MB). Peak memory consumption was 38.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.39 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. * Boogie Preprocessor took 22.03 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 410.57 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: 58.6 MB). Peak memory consumption was 58.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 39938.77 ms. Allocated memory was 1.2 GB in the beginning and 4.7 GB in the end (delta: 3.5 GB). Free memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: -898.7 MB). Peak memory consumption was 2.6 GB. Max. memory is 11.5 GB. * Witness Printer took 98.70 ms. Allocated memory is still 4.7 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L678] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L680] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L681] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L682] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L684] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L685] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L686] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L687] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L688] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L689] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L690] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L691] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L692] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L693] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L694] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L695] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L696] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L697] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L698] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L700] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L701] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L702] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L794] -1 pthread_t t1731; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L795] FCALL, FORK -1 pthread_create(&t1731, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L796] -1 pthread_t t1732; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L797] FCALL, FORK -1 pthread_create(&t1732, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L706] 0 x$w_buff1 = x$w_buff0 [L707] 0 x$w_buff0 = 1 [L708] 0 x$w_buff1_used = x$w_buff0_used [L709] 0 x$w_buff0_used = (_Bool)1 [L5] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L711] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L712] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L713] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L714] 0 x$r_buff0_thd1 = (_Bool)1 [L717] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L718] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L719] 0 x$flush_delayed = weak$$choice2 [L720] 0 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L721] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L721] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L721] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L721] 0 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L722] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L722] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L723] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L723] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L724] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L724] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L725] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L725] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L726] EXPR 0 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L726] 0 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L727] EXPR 0 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L727] 0 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L728] 0 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L729] EXPR 0 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L729] 0 x = x$flush_delayed ? x$mem_tmp : x [L730] 0 x$flush_delayed = (_Bool)0 [L733] 0 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L750] 1 y = 1 [L753] 1 __unbuffered_p1_EAX = y [L756] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L757] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L758] 1 x$flush_delayed = weak$$choice2 [L759] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L760] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L760] 1 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L761] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L761] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L736] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L762] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L762] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L763] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L763] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L764] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L764] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L765] EXPR 1 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L765] 1 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L766] EXPR 1 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L766] 1 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L767] 1 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L768] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L768] 1 x = x$flush_delayed ? x$mem_tmp : x [L769] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L772] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L772] EXPR 1 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=1] [L772] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=1] [L772] 1 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L773] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L773] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L774] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L774] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L736] 0 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L737] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L737] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L738] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L738] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L739] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L739] 0 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L740] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L740] 0 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L743] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] 1 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L776] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L776] 1 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L803] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L803] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L803] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L803] -1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L804] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L804] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L805] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L805] -1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L806] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L806] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L807] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L807] -1 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L810] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L5] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L5] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 308 locations, 3 error locations. UNSAFE Result, 39.8s OverallTime, 30 OverallIterations, 1 TraceHistogramMax, 13.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 12776 SDtfs, 13575 SDslu, 29693 SDs, 0 SdLazy, 9764 SolverSat, 632 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 307 GetRequests, 76 SyntacticMatches, 20 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104360occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 15.9s AutomataMinimizationTime, 29 MinimizatonAttempts, 328563 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 2554 NumberOfCodeBlocks, 2554 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 2410 ConstructedInterpolants, 0 QuantifiedInterpolants, 572222 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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...