./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix033_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_dbc5cf09-9c62-4328-9abd-0fb61d20e342/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_dbc5cf09-9c62-4328-9abd-0fb61d20e342/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_dbc5cf09-9c62-4328-9abd-0fb61d20e342/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_dbc5cf09-9c62-4328-9abd-0fb61d20e342/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix033_tso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_dbc5cf09-9c62-4328-9abd-0fb61d20e342/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_dbc5cf09-9c62-4328-9abd-0fb61d20e342/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8b2ff9fa2377151a398c67edda2cafd662b5873d ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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.2.0-a4ecdab [2020-11-22 12:57:17,192 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-22 12:57:17,195 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-22 12:57:17,315 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-22 12:57:17,316 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-22 12:57:17,320 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-22 12:57:17,323 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-22 12:57:17,327 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-22 12:57:17,334 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-22 12:57:17,340 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-22 12:57:17,341 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-22 12:57:17,344 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-22 12:57:17,344 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-22 12:57:17,348 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-22 12:57:17,349 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-22 12:57:17,351 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-22 12:57:17,352 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-22 12:57:17,356 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-22 12:57:17,359 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-22 12:57:17,366 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-22 12:57:17,368 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-22 12:57:17,369 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-22 12:57:17,371 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-22 12:57:17,372 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-22 12:57:17,381 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-22 12:57:17,381 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-22 12:57:17,381 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-22 12:57:17,383 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-22 12:57:17,384 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-22 12:57:17,385 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-22 12:57:17,386 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-22 12:57:17,387 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-22 12:57:17,389 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-22 12:57:17,390 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-22 12:57:17,391 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-22 12:57:17,391 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-22 12:57:17,392 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-22 12:57:17,392 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-22 12:57:17,392 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-22 12:57:17,394 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-22 12:57:17,395 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-22 12:57:17,397 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_dbc5cf09-9c62-4328-9abd-0fb61d20e342/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-11-22 12:57:17,434 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-22 12:57:17,434 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-22 12:57:17,436 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-11-22 12:57:17,436 INFO L138 SettingsManager]: * User list type=DISABLED [2020-11-22 12:57:17,436 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-11-22 12:57:17,437 INFO L138 SettingsManager]: * Explicit value domain=true [2020-11-22 12:57:17,437 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-11-22 12:57:17,437 INFO L138 SettingsManager]: * Octagon Domain=false [2020-11-22 12:57:17,437 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-11-22 12:57:17,437 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-11-22 12:57:17,438 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-11-22 12:57:17,439 INFO L138 SettingsManager]: * Interval Domain=false [2020-11-22 12:57:17,439 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-11-22 12:57:17,439 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-11-22 12:57:17,439 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-11-22 12:57:17,440 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-22 12:57:17,440 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-22 12:57:17,441 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-22 12:57:17,441 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-22 12:57:17,441 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-22 12:57:17,441 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-22 12:57:17,441 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-22 12:57:17,442 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-22 12:57:17,442 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-22 12:57:17,442 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-22 12:57:17,442 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-22 12:57:17,442 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-22 12:57:17,443 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-22 12:57:17,443 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-22 12:57:17,444 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-22 12:57:17,445 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-22 12:57:17,445 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-22 12:57:17,445 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-22 12:57:17,446 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-22 12:57:17,446 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-22 12:57:17,446 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-11-22 12:57:17,446 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-22 12:57:17,446 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-22 12:57:17,447 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-22 12:57:17,447 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-22 12:57:17,447 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_dbc5cf09-9c62-4328-9abd-0fb61d20e342/bin/utaipan/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/run_dir_dbc5cf09-9c62-4328-9abd-0fb61d20e342/bin/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(reach_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 -> 8b2ff9fa2377151a398c67edda2cafd662b5873d [2020-11-22 12:57:17,668 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-22 12:57:17,690 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-22 12:57:17,693 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-22 12:57:17,694 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-22 12:57:17,695 INFO L275 PluginConnector]: CDTParser initialized [2020-11-22 12:57:17,695 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_dbc5cf09-9c62-4328-9abd-0fb61d20e342/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix033_tso.oepc.i [2020-11-22 12:57:17,796 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_dbc5cf09-9c62-4328-9abd-0fb61d20e342/bin/utaipan/data/8dc362721/7370f644c0f246fa8d02183011f9df69/FLAG2e461ae05 [2020-11-22 12:57:18,258 INFO L306 CDTParser]: Found 1 translation units. [2020-11-22 12:57:18,259 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_dbc5cf09-9c62-4328-9abd-0fb61d20e342/sv-benchmarks/c/pthread-wmm/mix033_tso.oepc.i [2020-11-22 12:57:18,291 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_dbc5cf09-9c62-4328-9abd-0fb61d20e342/bin/utaipan/data/8dc362721/7370f644c0f246fa8d02183011f9df69/FLAG2e461ae05 [2020-11-22 12:57:18,592 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_dbc5cf09-9c62-4328-9abd-0fb61d20e342/bin/utaipan/data/8dc362721/7370f644c0f246fa8d02183011f9df69 [2020-11-22 12:57:18,594 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-22 12:57:18,596 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-22 12:57:18,601 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-22 12:57:18,601 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-22 12:57:18,604 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-22 12:57:18,605 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:57:18" (1/1) ... [2020-11-22 12:57:18,607 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73a924eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:57:18, skipping insertion in model container [2020-11-22 12:57:18,608 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:57:18" (1/1) ... [2020-11-22 12:57:18,613 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-22 12:57:18,662 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-22 12:57:19,024 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-22 12:57:19,032 INFO L203 MainTranslator]: Completed pre-run [2020-11-22 12:57:19,095 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-22 12:57:19,174 INFO L208 MainTranslator]: Completed translation [2020-11-22 12:57:19,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:57:19 WrapperNode [2020-11-22 12:57:19,175 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-22 12:57:19,176 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-22 12:57:19,176 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-22 12:57:19,176 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-22 12:57:19,184 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:57:19" (1/1) ... [2020-11-22 12:57:19,201 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:57:19" (1/1) ... [2020-11-22 12:57:19,233 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-22 12:57:19,234 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-22 12:57:19,234 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-22 12:57:19,234 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-22 12:57:19,243 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:57:19" (1/1) ... [2020-11-22 12:57:19,250 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:57:19" (1/1) ... [2020-11-22 12:57:19,255 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:57:19" (1/1) ... [2020-11-22 12:57:19,255 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:57:19" (1/1) ... [2020-11-22 12:57:19,266 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:57:19" (1/1) ... [2020-11-22 12:57:19,284 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:57:19" (1/1) ... [2020-11-22 12:57:19,288 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:57:19" (1/1) ... [2020-11-22 12:57:19,309 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-22 12:57:19,310 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-22 12:57:19,311 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-22 12:57:19,311 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-22 12:57:19,312 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:57:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dbc5cf09-9c62-4328-9abd-0fb61d20e342/bin/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 [2020-11-22 12:57:19,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-22 12:57:19,409 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-22 12:57:19,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-22 12:57:19,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-22 12:57:19,410 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-22 12:57:19,410 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-22 12:57:19,410 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-22 12:57:19,410 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-22 12:57:19,412 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-22 12:57:19,413 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-22 12:57:19,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-22 12:57:19,413 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-22 12:57:19,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-22 12:57:19,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-22 12:57:19,415 WARN L208 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-22 12:57:22,068 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-22 12:57:22,068 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-22 12:57:22,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:57:22 BoogieIcfgContainer [2020-11-22 12:57:22,070 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-22 12:57:22,071 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-22 12:57:22,103 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-22 12:57:22,109 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-22 12:57:22,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:57:18" (1/3) ... [2020-11-22 12:57:22,110 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30ae1afa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:57:22, skipping insertion in model container [2020-11-22 12:57:22,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:57:19" (2/3) ... [2020-11-22 12:57:22,111 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30ae1afa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:57:22, skipping insertion in model container [2020-11-22 12:57:22,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:57:22" (3/3) ... [2020-11-22 12:57:22,112 INFO L111 eAbstractionObserver]: Analyzing ICFG mix033_tso.oepc.i [2020-11-22 12:57:22,126 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-22 12:57:22,126 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-22 12:57:22,131 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-22 12:57:22,132 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-22 12:57:22,173 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,173 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,173 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,174 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,174 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,174 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,174 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,175 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,175 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,175 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,175 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,176 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,176 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,176 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,177 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,178 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,178 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,178 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,178 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,179 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,179 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,179 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,181 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,184 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,184 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,185 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,185 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,185 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,185 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,186 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,186 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,186 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,186 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,186 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,187 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,187 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,187 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,188 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,190 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,190 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,191 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,191 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,192 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,192 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,193 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,193 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,193 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,193 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,193 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,194 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,194 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,194 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,196 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,196 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,197 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,197 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,197 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,197 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,197 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,197 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,198 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,198 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,200 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,200 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,201 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,201 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,201 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,201 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,201 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,201 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,202 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,202 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-22 12:57:22,204 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-22 12:57:22,216 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-11-22 12:57:22,236 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-22 12:57:22,240 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-22 12:57:22,241 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-22 12:57:22,241 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-22 12:57:22,241 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-22 12:57:22,242 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-22 12:57:22,242 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-22 12:57:22,242 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-22 12:57:22,257 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-22 12:57:22,265 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 110 transitions, 235 flow [2020-11-22 12:57:22,268 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 110 transitions, 235 flow [2020-11-22 12:57:22,270 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 117 places, 110 transitions, 235 flow [2020-11-22 12:57:22,333 INFO L129 PetriNetUnfolder]: 3/107 cut-off events. [2020-11-22 12:57:22,333 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-22 12:57:22,339 INFO L80 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 107 events. 3/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 92 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2020-11-22 12:57:22,345 INFO L116 LiptonReduction]: Number of co-enabled transitions 2250 [2020-11-22 12:57:22,920 WARN L193 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-11-22 12:57:23,055 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-11-22 12:57:23,136 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-22 12:57:23,136 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:57:23,138 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:57:23,154 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:57:23,158 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:57:23,159 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:57:23,163 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-22 12:57:23,163 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:57:23,187 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-22 12:57:23,187 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:57:23,188 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:57:23,189 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:57:23,192 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:57:23,193 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:57:23,196 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-22 12:57:23,196 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:57:23,242 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-22 12:57:23,242 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:23,244 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-22 12:57:23,244 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:23,288 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 3, 2, 1] term [2020-11-22 12:57:23,288 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:57:23,289 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 1] term [2020-11-22 12:57:23,289 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:57:23,388 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-22 12:57:23,388 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:57:23,394 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-11-22 12:57:23,395 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:23,396 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-11-22 12:57:23,396 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:23,400 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-22 12:57:23,402 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 12:57:23,409 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-22 12:57:23,410 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 12:57:23,412 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-22 12:57:23,412 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 12:57:23,416 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-11-22 12:57:23,416 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:23,421 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-11-22 12:57:23,421 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:23,424 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-11-22 12:57:23,424 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:23,496 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-22 12:57:23,496 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:23,497 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-22 12:57:23,497 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:23,501 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-22 12:57:23,501 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-22 12:57:23,504 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-11-22 12:57:23,504 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:23,643 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-22 12:57:23,644 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:23,645 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-22 12:57:23,645 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:23,648 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-22 12:57:23,648 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-22 12:57:23,651 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-11-22 12:57:23,668 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:23,737 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:57:23,737 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:57:23,740 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-11-22 12:57:23,741 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:23,742 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-11-22 12:57:23,743 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:23,746 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-22 12:57:23,747 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 12:57:23,749 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-22 12:57:23,749 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 12:57:23,751 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-22 12:57:23,751 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 12:57:23,754 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-11-22 12:57:23,755 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:23,756 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-11-22 12:57:23,756 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:23,758 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-11-22 12:57:23,758 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:23,860 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-22 12:57:23,860 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:23,862 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-22 12:57:23,862 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:23,865 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-22 12:57:23,865 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-22 12:57:23,869 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-11-22 12:57:23,869 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:23,929 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-22 12:57:23,930 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:57:23,939 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-11-22 12:57:23,939 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:23,940 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-11-22 12:57:23,940 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:23,943 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-22 12:57:23,944 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 12:57:23,946 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-22 12:57:23,946 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 12:57:23,948 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-22 12:57:23,950 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 12:57:23,952 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-11-22 12:57:23,953 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:23,955 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-11-22 12:57:23,956 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:23,957 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-11-22 12:57:23,958 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:24,114 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-11-22 12:57:24,115 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:24,116 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-22 12:57:24,116 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:24,151 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-22 12:57:24,152 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:24,153 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-11-22 12:57:24,153 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:24,153 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-11-22 12:57:24,154 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:24,161 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-22 12:57:24,162 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:24,163 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-22 12:57:24,163 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:24,298 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2020-11-22 12:57:24,452 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2020-11-22 12:57:24,487 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 3, 2, 1] term [2020-11-22 12:57:24,487 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:57:24,488 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 1] term [2020-11-22 12:57:24,488 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:57:24,536 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-22 12:57:24,536 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:24,537 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-22 12:57:24,537 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:25,641 WARN L193 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 231 DAG size of output: 191 [2020-11-22 12:57:25,675 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 2, 1] term [2020-11-22 12:57:25,676 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:25,676 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-22 12:57:25,676 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:26,866 WARN L193 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 149 DAG size of output: 128 [2020-11-22 12:57:26,912 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-22 12:57:26,912 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:26,913 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-22 12:57:26,913 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:26,946 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-22 12:57:26,947 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:26,948 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-22 12:57:26,948 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:26,989 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-22 12:57:26,990 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:57:27,007 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-11-22 12:57:27,007 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:27,009 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-11-22 12:57:27,009 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:27,011 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-22 12:57:27,012 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 12:57:27,014 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-22 12:57:27,014 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 12:57:27,016 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-22 12:57:27,016 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-22 12:57:27,020 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-11-22 12:57:27,020 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:27,022 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-11-22 12:57:27,023 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:27,024 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-11-22 12:57:27,024 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:27,122 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-22 12:57:27,123 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:27,123 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-22 12:57:27,124 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:27,127 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-22 12:57:27,127 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-22 12:57:27,130 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-11-22 12:57:27,130 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:27,309 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-22 12:57:27,310 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:57:27,310 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:57:27,310 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:57:27,312 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:57:27,313 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:57:27,314 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-22 12:57:27,315 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:57:27,338 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-22 12:57:27,339 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:57:27,339 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:57:27,340 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:57:27,341 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:57:27,342 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:57:27,344 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-22 12:57:27,344 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:57:27,568 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-22 12:57:27,568 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:27,569 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-22 12:57:27,569 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:27,607 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-22 12:57:27,607 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:27,608 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-22 12:57:27,608 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:27,642 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-22 12:57:27,642 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:27,643 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-22 12:57:27,643 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:27,669 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-22 12:57:27,669 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:27,670 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-22 12:57:27,670 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:27,795 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-22 12:57:27,795 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:57:27,946 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-22 12:57:28,055 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-22 12:57:28,055 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:57:28,189 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-22 12:57:28,189 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:57:28,261 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-22 12:57:28,262 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:57:28,531 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-22 12:57:28,532 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:57:28,533 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-22 12:57:28,533 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:57:28,551 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-22 12:57:28,551 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:57:28,552 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term [2020-11-22 12:57:28,553 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:57:28,553 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:57:28,553 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:57:28,554 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:57:28,554 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:57:28,556 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-22 12:57:28,556 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:28,557 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-22 12:57:28,557 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:28,559 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-22 12:57:28,559 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:28,561 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-22 12:57:28,561 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:28,562 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-22 12:57:28,563 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:28,903 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-22 12:57:28,903 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:57:28,904 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term [2020-11-22 12:57:28,905 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:57:28,905 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:57:28,905 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:57:28,906 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:57:28,906 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:57:28,908 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-22 12:57:28,908 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:28,909 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-22 12:57:28,910 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:28,911 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-22 12:57:28,911 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:28,913 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-22 12:57:28,913 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:28,915 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-22 12:57:28,915 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:28,937 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-22 12:57:28,937 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:57:28,939 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-22 12:57:28,939 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:57:29,164 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-22 12:57:29,165 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:57:29,165 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:57:29,166 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:57:29,167 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:57:29,167 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:57:29,169 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-22 12:57:29,169 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:57:29,184 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-22 12:57:29,184 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:57:29,185 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:57:29,185 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:57:29,186 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:57:29,187 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:29,188 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-22 12:57:29,188 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:29,259 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-22 12:57:29,259 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:57:29,260 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:57:29,260 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:57:29,262 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:57:29,262 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:29,263 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-22 12:57:29,263 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:29,281 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:57:29,281 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:57:29,282 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:57:29,282 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:57:29,283 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:57:29,284 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:57:29,285 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-22 12:57:29,285 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:57:29,311 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-22 12:57:29,312 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:57:29,312 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term [2020-11-22 12:57:29,313 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:57:29,313 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:57:29,313 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:57:29,314 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:57:29,314 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:57:29,316 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-22 12:57:29,316 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:29,318 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-22 12:57:29,318 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:29,320 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-22 12:57:29,320 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:29,322 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-22 12:57:29,322 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:29,324 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-22 12:57:29,324 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:29,345 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-22 12:57:29,345 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:57:29,347 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-22 12:57:29,347 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:57:29,442 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-22 12:57:29,442 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:57:29,443 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-22 12:57:29,443 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:57:29,461 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-22 12:57:29,461 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:57:29,462 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term [2020-11-22 12:57:29,462 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:57:29,463 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:57:29,463 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:57:29,464 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:57:29,464 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:57:29,465 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-22 12:57:29,465 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:29,466 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-22 12:57:29,467 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:29,468 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-22 12:57:29,469 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:29,470 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-22 12:57:29,471 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:29,472 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-22 12:57:29,472 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:29,510 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-22 12:57:29,510 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:57:29,511 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term [2020-11-22 12:57:29,511 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:57:29,512 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:57:29,512 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:57:29,513 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:57:29,513 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:57:29,514 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-22 12:57:29,514 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:29,515 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-22 12:57:29,516 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:29,518 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-22 12:57:29,518 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:29,519 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-22 12:57:29,519 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:29,521 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-22 12:57:29,521 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:29,536 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-22 12:57:29,536 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:57:29,538 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-22 12:57:29,538 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:57:29,608 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-22 12:57:29,608 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:57:29,610 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-22 12:57:29,610 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:57:29,630 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-22 12:57:29,630 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:57:29,631 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term [2020-11-22 12:57:29,631 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:57:29,631 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:57:29,632 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:57:29,632 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:57:29,633 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:57:29,634 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-22 12:57:29,635 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:29,636 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-22 12:57:29,636 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:29,638 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-22 12:57:29,638 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:29,639 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-22 12:57:29,639 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:29,640 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-22 12:57:29,640 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:30,639 WARN L193 SmtUtils]: Spent 747.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 129 [2020-11-22 12:57:30,976 WARN L193 SmtUtils]: Spent 334.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2020-11-22 12:57:31,176 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-22 12:57:31,177 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:57:31,178 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:57:31,178 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:57:31,180 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:57:31,180 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:57:31,181 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-22 12:57:31,182 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:57:31,200 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:57:31,201 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:57:31,201 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:57:31,202 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:57:31,203 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:57:31,204 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:31,205 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-22 12:57:31,205 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:31,233 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-22 12:57:31,233 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:57:31,288 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-22 12:57:31,288 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:57:31,323 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-22 12:57:31,323 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:57:31,467 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-22 12:57:31,468 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:57:31,573 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:57:31,574 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:57:31,574 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:57:31,574 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:57:31,576 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:57:31,576 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:31,577 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-22 12:57:31,577 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-22 12:57:31,610 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:57:31,610 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:57:31,611 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:57:31,611 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:57:31,612 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-22 12:57:31,613 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:57:31,614 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-22 12:57:31,614 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-22 12:57:31,642 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-22 12:57:31,642 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-22 12:57:32,120 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-11-22 12:57:32,601 WARN L193 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2020-11-22 12:57:32,785 WARN L193 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-11-22 12:57:32,790 INFO L131 LiptonReduction]: Checked pairs total: 6578 [2020-11-22 12:57:32,790 INFO L133 LiptonReduction]: Total number of compositions: 94 [2020-11-22 12:57:32,807 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 39 places, 30 transitions, 75 flow [2020-11-22 12:57:32,896 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1342 states. [2020-11-22 12:57:32,899 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states. [2020-11-22 12:57:32,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-11-22 12:57:32,904 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:57:32,904 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-11-22 12:57:32,906 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:57:32,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:57:32,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1074569408, now seen corresponding path program 1 times [2020-11-22 12:57:32,925 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:57:32,927 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645335604] [2020-11-22 12:57:32,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:57:33,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:57:33,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 12:57:33,226 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645335604] [2020-11-22 12:57:33,227 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:57:33,227 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-22 12:57:33,227 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113104384] [2020-11-22 12:57:33,231 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-22 12:57:33,231 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:57:33,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-22 12:57:33,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-22 12:57:33,247 INFO L87 Difference]: Start difference. First operand 1342 states. Second operand 3 states. [2020-11-22 12:57:33,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:57:33,358 INFO L93 Difference]: Finished difference Result 1152 states and 3742 transitions. [2020-11-22 12:57:33,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-22 12:57:33,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-11-22 12:57:33,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:57:33,423 INFO L225 Difference]: With dead ends: 1152 [2020-11-22 12:57:33,423 INFO L226 Difference]: Without dead ends: 972 [2020-11-22 12:57:33,425 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-22 12:57:33,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2020-11-22 12:57:33,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 972. [2020-11-22 12:57:33,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 972 states. [2020-11-22 12:57:33,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 3118 transitions. [2020-11-22 12:57:33,549 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 3118 transitions. Word has length 5 [2020-11-22 12:57:33,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:57:33,549 INFO L481 AbstractCegarLoop]: Abstraction has 972 states and 3118 transitions. [2020-11-22 12:57:33,549 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-22 12:57:33,549 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 3118 transitions. [2020-11-22 12:57:33,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-22 12:57:33,552 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:57:33,552 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:57:33,553 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-22 12:57:33,553 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:57:33,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:57:33,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1304726928, now seen corresponding path program 1 times [2020-11-22 12:57:33,556 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:57:33,557 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883878396] [2020-11-22 12:57:33,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:57:33,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:57:33,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 12:57:33,791 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883878396] [2020-11-22 12:57:33,791 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:57:33,791 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-22 12:57:33,791 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816699788] [2020-11-22 12:57:33,792 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-22 12:57:33,792 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:57:33,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-22 12:57:33,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-22 12:57:33,793 INFO L87 Difference]: Start difference. First operand 972 states and 3118 transitions. Second operand 4 states. [2020-11-22 12:57:33,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:57:33,936 INFO L93 Difference]: Finished difference Result 1132 states and 3496 transitions. [2020-11-22 12:57:33,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-22 12:57:33,937 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-11-22 12:57:33,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:57:33,946 INFO L225 Difference]: With dead ends: 1132 [2020-11-22 12:57:33,946 INFO L226 Difference]: Without dead ends: 952 [2020-11-22 12:57:33,947 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-22 12:57:33,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2020-11-22 12:57:33,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 952. [2020-11-22 12:57:33,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 952 states. [2020-11-22 12:57:33,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 3042 transitions. [2020-11-22 12:57:33,981 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 3042 transitions. Word has length 10 [2020-11-22 12:57:33,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:57:33,982 INFO L481 AbstractCegarLoop]: Abstraction has 952 states and 3042 transitions. [2020-11-22 12:57:33,982 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-22 12:57:33,982 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 3042 transitions. [2020-11-22 12:57:33,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-22 12:57:33,990 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:57:33,990 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:57:33,991 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-22 12:57:33,991 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:57:33,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:57:33,991 INFO L82 PathProgramCache]: Analyzing trace with hash 965029648, now seen corresponding path program 1 times [2020-11-22 12:57:33,992 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:57:33,992 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904165590] [2020-11-22 12:57:33,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:57:34,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:57:34,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 12:57:34,156 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904165590] [2020-11-22 12:57:34,156 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:57:34,156 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-22 12:57:34,156 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436869097] [2020-11-22 12:57:34,156 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-22 12:57:34,157 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:57:34,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-22 12:57:34,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-22 12:57:34,157 INFO L87 Difference]: Start difference. First operand 952 states and 3042 transitions. Second operand 4 states. [2020-11-22 12:57:34,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:57:34,205 INFO L93 Difference]: Finished difference Result 1002 states and 3097 transitions. [2020-11-22 12:57:34,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-22 12:57:34,206 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-11-22 12:57:34,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:57:34,215 INFO L225 Difference]: With dead ends: 1002 [2020-11-22 12:57:34,215 INFO L226 Difference]: Without dead ends: 852 [2020-11-22 12:57:34,216 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-22 12:57:34,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2020-11-22 12:57:34,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 852. [2020-11-22 12:57:34,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852 states. [2020-11-22 12:57:34,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 2682 transitions. [2020-11-22 12:57:34,247 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 2682 transitions. Word has length 11 [2020-11-22 12:57:34,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:57:34,248 INFO L481 AbstractCegarLoop]: Abstraction has 852 states and 2682 transitions. [2020-11-22 12:57:34,248 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-22 12:57:34,248 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 2682 transitions. [2020-11-22 12:57:34,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-22 12:57:34,250 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:57:34,250 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:57:34,250 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-22 12:57:34,250 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:57:34,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:57:34,251 INFO L82 PathProgramCache]: Analyzing trace with hash 286465797, now seen corresponding path program 1 times [2020-11-22 12:57:34,251 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:57:34,251 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797909009] [2020-11-22 12:57:34,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:57:34,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:57:34,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 12:57:34,466 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797909009] [2020-11-22 12:57:34,466 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:57:34,466 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-22 12:57:34,466 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416801312] [2020-11-22 12:57:34,467 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-22 12:57:34,467 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:57:34,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-22 12:57:34,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-22 12:57:34,468 INFO L87 Difference]: Start difference. First operand 852 states and 2682 transitions. Second operand 5 states. [2020-11-22 12:57:34,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:57:34,614 INFO L93 Difference]: Finished difference Result 932 states and 2846 transitions. [2020-11-22 12:57:34,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-22 12:57:34,615 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-11-22 12:57:34,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:57:34,623 INFO L225 Difference]: With dead ends: 932 [2020-11-22 12:57:34,624 INFO L226 Difference]: Without dead ends: 812 [2020-11-22 12:57:34,624 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-11-22 12:57:34,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2020-11-22 12:57:34,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 812. [2020-11-22 12:57:34,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 812 states. [2020-11-22 12:57:34,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 2540 transitions. [2020-11-22 12:57:34,651 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 2540 transitions. Word has length 12 [2020-11-22 12:57:34,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:57:34,652 INFO L481 AbstractCegarLoop]: Abstraction has 812 states and 2540 transitions. [2020-11-22 12:57:34,652 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-22 12:57:34,652 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 2540 transitions. [2020-11-22 12:57:34,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-22 12:57:34,654 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:57:34,654 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:57:34,654 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-22 12:57:34,654 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:57:34,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:57:34,655 INFO L82 PathProgramCache]: Analyzing trace with hash -320851035, now seen corresponding path program 1 times [2020-11-22 12:57:34,655 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:57:34,655 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53385288] [2020-11-22 12:57:34,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:57:34,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:57:34,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 12:57:34,897 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53385288] [2020-11-22 12:57:34,897 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:57:34,897 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-22 12:57:34,897 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725666206] [2020-11-22 12:57:34,898 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-22 12:57:34,898 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:57:34,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-22 12:57:34,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-22 12:57:34,898 INFO L87 Difference]: Start difference. First operand 812 states and 2540 transitions. Second operand 6 states. [2020-11-22 12:57:35,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:57:35,088 INFO L93 Difference]: Finished difference Result 972 states and 2955 transitions. [2020-11-22 12:57:35,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-22 12:57:35,089 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-11-22 12:57:35,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:57:35,097 INFO L225 Difference]: With dead ends: 972 [2020-11-22 12:57:35,097 INFO L226 Difference]: Without dead ends: 858 [2020-11-22 12:57:35,097 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-22 12:57:35,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2020-11-22 12:57:35,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 858. [2020-11-22 12:57:35,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 858 states. [2020-11-22 12:57:35,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 2667 transitions. [2020-11-22 12:57:35,153 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 2667 transitions. Word has length 13 [2020-11-22 12:57:35,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:57:35,154 INFO L481 AbstractCegarLoop]: Abstraction has 858 states and 2667 transitions. [2020-11-22 12:57:35,154 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-22 12:57:35,154 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 2667 transitions. [2020-11-22 12:57:35,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-22 12:57:35,156 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:57:35,156 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:57:35,156 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-22 12:57:35,156 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:57:35,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:57:35,157 INFO L82 PathProgramCache]: Analyzing trace with hash 661911982, now seen corresponding path program 1 times [2020-11-22 12:57:35,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:57:35,157 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892527582] [2020-11-22 12:57:35,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:57:35,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:57:35,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 12:57:35,378 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892527582] [2020-11-22 12:57:35,379 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:57:35,379 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-22 12:57:35,379 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423891654] [2020-11-22 12:57:35,379 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-22 12:57:35,379 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:57:35,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-22 12:57:35,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-22 12:57:35,380 INFO L87 Difference]: Start difference. First operand 858 states and 2667 transitions. Second operand 6 states. [2020-11-22 12:57:35,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:57:35,596 INFO L93 Difference]: Finished difference Result 1058 states and 3211 transitions. [2020-11-22 12:57:35,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-22 12:57:35,597 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-11-22 12:57:35,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:57:35,605 INFO L225 Difference]: With dead ends: 1058 [2020-11-22 12:57:35,605 INFO L226 Difference]: Without dead ends: 950 [2020-11-22 12:57:35,606 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-11-22 12:57:35,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2020-11-22 12:57:35,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 950. [2020-11-22 12:57:35,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2020-11-22 12:57:35,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 2921 transitions. [2020-11-22 12:57:35,664 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 2921 transitions. Word has length 14 [2020-11-22 12:57:35,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:57:35,665 INFO L481 AbstractCegarLoop]: Abstraction has 950 states and 2921 transitions. [2020-11-22 12:57:35,665 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-22 12:57:35,665 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 2921 transitions. [2020-11-22 12:57:35,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-22 12:57:35,667 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:57:35,667 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:57:35,668 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-22 12:57:35,668 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:57:35,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:57:35,668 INFO L82 PathProgramCache]: Analyzing trace with hash 897113798, now seen corresponding path program 1 times [2020-11-22 12:57:35,669 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:57:35,669 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009175783] [2020-11-22 12:57:35,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:57:35,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:57:35,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 12:57:35,877 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009175783] [2020-11-22 12:57:35,877 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:57:35,877 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-22 12:57:35,877 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905396336] [2020-11-22 12:57:35,877 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-22 12:57:35,877 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:57:35,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-22 12:57:35,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-22 12:57:35,878 INFO L87 Difference]: Start difference. First operand 950 states and 2921 transitions. Second operand 6 states. [2020-11-22 12:57:35,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:57:35,979 INFO L93 Difference]: Finished difference Result 992 states and 2992 transitions. [2020-11-22 12:57:35,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-22 12:57:35,980 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-11-22 12:57:35,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:57:35,988 INFO L225 Difference]: With dead ends: 992 [2020-11-22 12:57:35,989 INFO L226 Difference]: Without dead ends: 922 [2020-11-22 12:57:35,989 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-22 12:57:35,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2020-11-22 12:57:36,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 922. [2020-11-22 12:57:36,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 922 states. [2020-11-22 12:57:36,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 2827 transitions. [2020-11-22 12:57:36,026 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 2827 transitions. Word has length 15 [2020-11-22 12:57:36,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:57:36,027 INFO L481 AbstractCegarLoop]: Abstraction has 922 states and 2827 transitions. [2020-11-22 12:57:36,027 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-22 12:57:36,027 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 2827 transitions. [2020-11-22 12:57:36,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-22 12:57:36,029 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:57:36,029 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:57:36,029 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-22 12:57:36,030 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:57:36,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:57:36,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1088793519, now seen corresponding path program 1 times [2020-11-22 12:57:36,030 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:57:36,031 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317101407] [2020-11-22 12:57:36,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:57:36,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:57:36,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 12:57:36,163 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317101407] [2020-11-22 12:57:36,163 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:57:36,164 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-22 12:57:36,164 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519123731] [2020-11-22 12:57:36,164 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-22 12:57:36,164 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:57:36,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-22 12:57:36,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-22 12:57:36,165 INFO L87 Difference]: Start difference. First operand 922 states and 2827 transitions. Second operand 4 states. [2020-11-22 12:57:36,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:57:36,223 INFO L93 Difference]: Finished difference Result 860 states and 2340 transitions. [2020-11-22 12:57:36,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-22 12:57:36,224 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-11-22 12:57:36,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:57:36,229 INFO L225 Difference]: With dead ends: 860 [2020-11-22 12:57:36,229 INFO L226 Difference]: Without dead ends: 626 [2020-11-22 12:57:36,229 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-22 12:57:36,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2020-11-22 12:57:36,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2020-11-22 12:57:36,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2020-11-22 12:57:36,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 1643 transitions. [2020-11-22 12:57:36,250 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 1643 transitions. Word has length 16 [2020-11-22 12:57:36,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:57:36,250 INFO L481 AbstractCegarLoop]: Abstraction has 626 states and 1643 transitions. [2020-11-22 12:57:36,250 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-22 12:57:36,250 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 1643 transitions. [2020-11-22 12:57:36,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-22 12:57:36,252 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:57:36,252 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:57:36,252 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-22 12:57:36,252 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:57:36,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:57:36,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1451216076, now seen corresponding path program 1 times [2020-11-22 12:57:36,253 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:57:36,255 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431514444] [2020-11-22 12:57:36,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:57:36,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:57:36,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 12:57:36,347 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431514444] [2020-11-22 12:57:36,347 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:57:36,347 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-22 12:57:36,348 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987564485] [2020-11-22 12:57:36,348 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-22 12:57:36,348 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:57:36,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-22 12:57:36,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-22 12:57:36,349 INFO L87 Difference]: Start difference. First operand 626 states and 1643 transitions. Second operand 5 states. [2020-11-22 12:57:36,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:57:36,404 INFO L93 Difference]: Finished difference Result 486 states and 1186 transitions. [2020-11-22 12:57:36,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-22 12:57:36,405 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-11-22 12:57:36,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:57:36,407 INFO L225 Difference]: With dead ends: 486 [2020-11-22 12:57:36,408 INFO L226 Difference]: Without dead ends: 376 [2020-11-22 12:57:36,408 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-22 12:57:36,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2020-11-22 12:57:36,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 322. [2020-11-22 12:57:36,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2020-11-22 12:57:36,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 758 transitions. [2020-11-22 12:57:36,419 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 758 transitions. Word has length 17 [2020-11-22 12:57:36,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:57:36,419 INFO L481 AbstractCegarLoop]: Abstraction has 322 states and 758 transitions. [2020-11-22 12:57:36,419 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-22 12:57:36,419 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 758 transitions. [2020-11-22 12:57:36,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-22 12:57:36,421 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:57:36,421 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-22 12:57:36,421 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-22 12:57:36,421 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:57:36,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:57:36,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1830853706, now seen corresponding path program 1 times [2020-11-22 12:57:36,422 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:57:36,422 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465167350] [2020-11-22 12:57:36,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:57:36,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:57:36,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 12:57:36,575 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465167350] [2020-11-22 12:57:36,575 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:57:36,575 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-22 12:57:36,575 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052177663] [2020-11-22 12:57:36,576 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-22 12:57:36,576 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:57:36,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-22 12:57:36,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-22 12:57:36,576 INFO L87 Difference]: Start difference. First operand 322 states and 758 transitions. Second operand 6 states. [2020-11-22 12:57:36,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:57:36,646 INFO L93 Difference]: Finished difference Result 286 states and 684 transitions. [2020-11-22 12:57:36,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-22 12:57:36,647 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-11-22 12:57:36,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:57:36,649 INFO L225 Difference]: With dead ends: 286 [2020-11-22 12:57:36,650 INFO L226 Difference]: Without dead ends: 268 [2020-11-22 12:57:36,650 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-11-22 12:57:36,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2020-11-22 12:57:36,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 256. [2020-11-22 12:57:36,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2020-11-22 12:57:36,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 626 transitions. [2020-11-22 12:57:36,661 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 626 transitions. Word has length 20 [2020-11-22 12:57:36,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:57:36,664 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 626 transitions. [2020-11-22 12:57:36,664 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-22 12:57:36,664 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 626 transitions. [2020-11-22 12:57:36,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-22 12:57:36,665 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:57:36,665 INFO L422 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] [2020-11-22 12:57:36,665 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-22 12:57:36,666 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:57:36,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:57:36,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1803225434, now seen corresponding path program 1 times [2020-11-22 12:57:36,667 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:57:36,667 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228076828] [2020-11-22 12:57:36,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:57:36,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:57:36,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 12:57:36,941 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228076828] [2020-11-22 12:57:36,941 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:57:36,942 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-22 12:57:36,942 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114995682] [2020-11-22 12:57:36,942 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-22 12:57:36,942 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:57:36,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-22 12:57:36,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-22 12:57:36,943 INFO L87 Difference]: Start difference. First operand 256 states and 626 transitions. Second operand 8 states. [2020-11-22 12:57:37,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:57:37,196 INFO L93 Difference]: Finished difference Result 447 states and 1067 transitions. [2020-11-22 12:57:37,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-22 12:57:37,197 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-11-22 12:57:37,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:57:37,200 INFO L225 Difference]: With dead ends: 447 [2020-11-22 12:57:37,200 INFO L226 Difference]: Without dead ends: 380 [2020-11-22 12:57:37,200 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-11-22 12:57:37,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2020-11-22 12:57:37,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 316. [2020-11-22 12:57:37,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2020-11-22 12:57:37,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 771 transitions. [2020-11-22 12:57:37,210 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 771 transitions. Word has length 24 [2020-11-22 12:57:37,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:57:37,211 INFO L481 AbstractCegarLoop]: Abstraction has 316 states and 771 transitions. [2020-11-22 12:57:37,211 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-22 12:57:37,211 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 771 transitions. [2020-11-22 12:57:37,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-22 12:57:37,213 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:57:37,213 INFO L422 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] [2020-11-22 12:57:37,213 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-22 12:57:37,213 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:57:37,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:57:37,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1526641022, now seen corresponding path program 2 times [2020-11-22 12:57:37,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:57:37,214 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768809759] [2020-11-22 12:57:37,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:57:37,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:57:37,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 12:57:37,488 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768809759] [2020-11-22 12:57:37,489 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:57:37,489 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-22 12:57:37,489 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792659395] [2020-11-22 12:57:37,489 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-22 12:57:37,489 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:57:37,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-22 12:57:37,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-11-22 12:57:37,490 INFO L87 Difference]: Start difference. First operand 316 states and 771 transitions. Second operand 9 states. [2020-11-22 12:57:37,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:57:37,753 INFO L93 Difference]: Finished difference Result 433 states and 1033 transitions. [2020-11-22 12:57:37,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-22 12:57:37,754 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2020-11-22 12:57:37,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:57:37,756 INFO L225 Difference]: With dead ends: 433 [2020-11-22 12:57:37,756 INFO L226 Difference]: Without dead ends: 322 [2020-11-22 12:57:37,757 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2020-11-22 12:57:37,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2020-11-22 12:57:37,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 286. [2020-11-22 12:57:37,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2020-11-22 12:57:37,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 690 transitions. [2020-11-22 12:57:37,766 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 690 transitions. Word has length 24 [2020-11-22 12:57:37,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:57:37,766 INFO L481 AbstractCegarLoop]: Abstraction has 286 states and 690 transitions. [2020-11-22 12:57:37,766 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-22 12:57:37,766 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 690 transitions. [2020-11-22 12:57:37,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-22 12:57:37,767 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:57:37,768 INFO L422 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] [2020-11-22 12:57:37,768 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-22 12:57:37,768 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:57:37,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:57:37,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1503613152, now seen corresponding path program 3 times [2020-11-22 12:57:37,769 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:57:37,769 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387979972] [2020-11-22 12:57:37,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:57:37,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:57:37,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 12:57:37,992 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387979972] [2020-11-22 12:57:37,992 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:57:37,993 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-22 12:57:37,993 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410892246] [2020-11-22 12:57:37,993 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-22 12:57:37,993 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:57:37,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-22 12:57:37,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-11-22 12:57:37,994 INFO L87 Difference]: Start difference. First operand 286 states and 690 transitions. Second operand 8 states. [2020-11-22 12:57:38,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:57:38,114 INFO L93 Difference]: Finished difference Result 426 states and 1019 transitions. [2020-11-22 12:57:38,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-22 12:57:38,115 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-11-22 12:57:38,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:57:38,117 INFO L225 Difference]: With dead ends: 426 [2020-11-22 12:57:38,117 INFO L226 Difference]: Without dead ends: 251 [2020-11-22 12:57:38,117 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-11-22 12:57:38,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2020-11-22 12:57:38,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2020-11-22 12:57:38,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2020-11-22 12:57:38,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 606 transitions. [2020-11-22 12:57:38,125 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 606 transitions. Word has length 24 [2020-11-22 12:57:38,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:57:38,125 INFO L481 AbstractCegarLoop]: Abstraction has 251 states and 606 transitions. [2020-11-22 12:57:38,125 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-22 12:57:38,126 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 606 transitions. [2020-11-22 12:57:38,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-22 12:57:38,128 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:57:38,128 INFO L422 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] [2020-11-22 12:57:38,128 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-22 12:57:38,128 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:57:38,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:57:38,129 INFO L82 PathProgramCache]: Analyzing trace with hash -808697376, now seen corresponding path program 4 times [2020-11-22 12:57:38,129 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:57:38,157 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026458614] [2020-11-22 12:57:38,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:57:38,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:57:38,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 12:57:38,697 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026458614] [2020-11-22 12:57:38,698 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:57:38,698 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-22 12:57:38,698 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913439212] [2020-11-22 12:57:38,698 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-22 12:57:38,698 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:57:38,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-22 12:57:38,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-11-22 12:57:38,699 INFO L87 Difference]: Start difference. First operand 251 states and 606 transitions. Second operand 11 states. [2020-11-22 12:57:39,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:57:39,041 INFO L93 Difference]: Finished difference Result 350 states and 807 transitions. [2020-11-22 12:57:39,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-22 12:57:39,041 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2020-11-22 12:57:39,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:57:39,043 INFO L225 Difference]: With dead ends: 350 [2020-11-22 12:57:39,043 INFO L226 Difference]: Without dead ends: 315 [2020-11-22 12:57:39,043 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2020-11-22 12:57:39,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2020-11-22 12:57:39,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 281. [2020-11-22 12:57:39,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2020-11-22 12:57:39,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 671 transitions. [2020-11-22 12:57:39,052 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 671 transitions. Word has length 24 [2020-11-22 12:57:39,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:57:39,052 INFO L481 AbstractCegarLoop]: Abstraction has 281 states and 671 transitions. [2020-11-22 12:57:39,052 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-22 12:57:39,053 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 671 transitions. [2020-11-22 12:57:39,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-22 12:57:39,053 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:57:39,054 INFO L422 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] [2020-11-22 12:57:39,054 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-22 12:57:39,054 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:57:39,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:57:39,054 INFO L82 PathProgramCache]: Analyzing trace with hash -532112964, now seen corresponding path program 5 times [2020-11-22 12:57:39,055 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:57:39,055 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906478638] [2020-11-22 12:57:39,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:57:39,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:57:39,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 12:57:39,259 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906478638] [2020-11-22 12:57:39,259 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:57:39,259 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-22 12:57:39,260 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168385594] [2020-11-22 12:57:39,260 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-22 12:57:39,260 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:57:39,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-22 12:57:39,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-11-22 12:57:39,261 INFO L87 Difference]: Start difference. First operand 281 states and 671 transitions. Second operand 8 states. [2020-11-22 12:57:39,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:57:39,362 INFO L93 Difference]: Finished difference Result 314 states and 733 transitions. [2020-11-22 12:57:39,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-22 12:57:39,363 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-11-22 12:57:39,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:57:39,364 INFO L225 Difference]: With dead ends: 314 [2020-11-22 12:57:39,365 INFO L226 Difference]: Without dead ends: 211 [2020-11-22 12:57:39,365 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-11-22 12:57:39,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2020-11-22 12:57:39,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2020-11-22 12:57:39,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-11-22 12:57:39,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 508 transitions. [2020-11-22 12:57:39,371 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 508 transitions. Word has length 24 [2020-11-22 12:57:39,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:57:39,371 INFO L481 AbstractCegarLoop]: Abstraction has 211 states and 508 transitions. [2020-11-22 12:57:39,371 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-22 12:57:39,372 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 508 transitions. [2020-11-22 12:57:39,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-22 12:57:39,372 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:57:39,372 INFO L422 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] [2020-11-22 12:57:39,373 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-22 12:57:39,373 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:57:39,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:57:39,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1781037158, now seen corresponding path program 6 times [2020-11-22 12:57:39,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:57:39,374 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200067813] [2020-11-22 12:57:39,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:57:39,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:57:39,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 12:57:39,714 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200067813] [2020-11-22 12:57:39,714 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:57:39,714 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-22 12:57:39,714 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969895693] [2020-11-22 12:57:39,714 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-22 12:57:39,715 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:57:39,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-22 12:57:39,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-11-22 12:57:39,715 INFO L87 Difference]: Start difference. First operand 211 states and 508 transitions. Second operand 10 states. [2020-11-22 12:57:39,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:57:39,979 INFO L93 Difference]: Finished difference Result 342 states and 784 transitions. [2020-11-22 12:57:39,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-22 12:57:39,980 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-11-22 12:57:39,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:57:39,981 INFO L225 Difference]: With dead ends: 342 [2020-11-22 12:57:39,981 INFO L226 Difference]: Without dead ends: 179 [2020-11-22 12:57:39,982 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2020-11-22 12:57:39,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2020-11-22 12:57:39,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 151. [2020-11-22 12:57:39,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-11-22 12:57:39,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 328 transitions. [2020-11-22 12:57:39,986 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 328 transitions. Word has length 24 [2020-11-22 12:57:39,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:57:39,986 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 328 transitions. [2020-11-22 12:57:39,986 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-22 12:57:39,986 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 328 transitions. [2020-11-22 12:57:39,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-22 12:57:39,987 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:57:39,987 INFO L422 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] [2020-11-22 12:57:39,987 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-22 12:57:39,987 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:57:39,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:57:39,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1973747538, now seen corresponding path program 7 times [2020-11-22 12:57:39,987 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:57:39,988 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372094650] [2020-11-22 12:57:39,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:57:40,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:57:40,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 12:57:40,194 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372094650] [2020-11-22 12:57:40,195 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:57:40,195 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-22 12:57:40,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034589683] [2020-11-22 12:57:40,195 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-22 12:57:40,195 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:57:40,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-22 12:57:40,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-11-22 12:57:40,196 INFO L87 Difference]: Start difference. First operand 151 states and 328 transitions. Second operand 9 states. [2020-11-22 12:57:40,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:57:40,362 INFO L93 Difference]: Finished difference Result 230 states and 467 transitions. [2020-11-22 12:57:40,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-22 12:57:40,363 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2020-11-22 12:57:40,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:57:40,364 INFO L225 Difference]: With dead ends: 230 [2020-11-22 12:57:40,364 INFO L226 Difference]: Without dead ends: 163 [2020-11-22 12:57:40,364 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-11-22 12:57:40,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2020-11-22 12:57:40,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 111. [2020-11-22 12:57:40,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2020-11-22 12:57:40,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 228 transitions. [2020-11-22 12:57:40,368 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 228 transitions. Word has length 24 [2020-11-22 12:57:40,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:57:40,368 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 228 transitions. [2020-11-22 12:57:40,368 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-22 12:57:40,368 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 228 transitions. [2020-11-22 12:57:40,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-22 12:57:40,368 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:57:40,368 INFO L422 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] [2020-11-22 12:57:40,369 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-22 12:57:40,369 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:57:40,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:57:40,369 INFO L82 PathProgramCache]: Analyzing trace with hash 519142152, now seen corresponding path program 8 times [2020-11-22 12:57:40,369 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:57:40,369 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64941030] [2020-11-22 12:57:40,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:57:40,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-22 12:57:40,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-22 12:57:40,852 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64941030] [2020-11-22 12:57:40,852 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-22 12:57:40,852 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-22 12:57:40,853 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951149344] [2020-11-22 12:57:40,853 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-22 12:57:40,853 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-22 12:57:40,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-22 12:57:40,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-11-22 12:57:40,854 INFO L87 Difference]: Start difference. First operand 111 states and 228 transitions. Second operand 9 states. [2020-11-22 12:57:41,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-22 12:57:41,031 INFO L93 Difference]: Finished difference Result 132 states and 264 transitions. [2020-11-22 12:57:41,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-22 12:57:41,031 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2020-11-22 12:57:41,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-22 12:57:41,032 INFO L225 Difference]: With dead ends: 132 [2020-11-22 12:57:41,032 INFO L226 Difference]: Without dead ends: 89 [2020-11-22 12:57:41,033 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-11-22 12:57:41,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-11-22 12:57:41,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2020-11-22 12:57:41,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-11-22 12:57:41,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 176 transitions. [2020-11-22 12:57:41,035 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 176 transitions. Word has length 24 [2020-11-22 12:57:41,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-22 12:57:41,036 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 176 transitions. [2020-11-22 12:57:41,036 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-22 12:57:41,036 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 176 transitions. [2020-11-22 12:57:41,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-22 12:57:41,036 INFO L414 BasicCegarLoop]: Found error trace [2020-11-22 12:57:41,036 INFO L422 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] [2020-11-22 12:57:41,036 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-22 12:57:41,036 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-22 12:57:41,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-22 12:57:41,037 INFO L82 PathProgramCache]: Analyzing trace with hash 2055738468, now seen corresponding path program 9 times [2020-11-22 12:57:41,037 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-22 12:57:41,037 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051124295] [2020-11-22 12:57:41,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-22 12:57:41,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-22 12:57:41,082 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-22 12:57:41,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-22 12:57:41,129 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-22 12:57:41,178 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-11-22 12:57:41,179 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-22 12:57:41,179 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-22 12:57:41,202 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,203 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [770] [2020-11-22 12:57:41,232 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,232 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,233 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,233 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,233 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,233 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,233 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,233 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,234 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,234 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,234 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,234 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,234 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,234 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,235 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,235 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,235 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,236 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,236 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,236 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,236 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,236 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,237 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,237 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,237 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,238 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,238 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,238 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,238 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,238 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,238 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,238 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,239 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,239 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,244 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,244 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,244 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,244 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,244 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,245 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,245 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,245 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,245 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,245 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,245 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,245 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,245 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,245 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,245 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,246 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,246 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,246 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,246 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,246 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,246 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,246 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,246 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,246 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,246 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,246 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,246 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,246 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,247 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,247 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,247 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,247 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,247 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,247 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,247 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,247 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,247 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,247 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 12:57:41 BasicIcfg [2020-11-22 12:57:41,348 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-22 12:57:41,349 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-22 12:57:41,349 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-22 12:57:41,349 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-22 12:57:41,350 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:57:22" (3/4) ... [2020-11-22 12:57:41,352 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-22 12:57:41,365 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,365 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [770] [2020-11-22 12:57:41,366 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,366 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,366 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,366 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,366 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,366 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,366 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,367 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,367 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,367 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,367 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,367 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,367 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,367 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,367 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,368 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,368 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,369 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,370 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,370 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,370 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,370 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,370 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,370 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,370 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,371 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,371 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,371 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,371 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,371 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,371 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,371 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,371 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,372 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,372 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,372 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,372 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,372 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,372 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,373 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,373 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,373 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,373 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,373 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,373 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,373 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,374 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,374 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,374 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,374 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,374 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,374 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,374 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,374 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,375 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,375 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,375 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,375 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,375 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,375 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,375 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,375 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,376 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,376 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,376 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,376 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,376 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,376 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,376 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,376 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,377 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-22 12:57:41,377 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-22 12:57:41,504 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_dbc5cf09-9c62-4328-9abd-0fb61d20e342/bin/utaipan/witness.graphml [2020-11-22 12:57:41,504 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-22 12:57:41,506 INFO L168 Benchmark]: Toolchain (without parser) took 22909.66 ms. Allocated memory was 117.4 MB in the beginning and 356.5 MB in the end (delta: 239.1 MB). Free memory was 84.6 MB in the beginning and 292.7 MB in the end (delta: -208.2 MB). Peak memory consumption was 30.1 MB. Max. memory is 16.1 GB. [2020-11-22 12:57:41,506 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 79.7 MB. Free memory was 40.1 MB in the beginning and 40.0 MB in the end (delta: 62.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-22 12:57:41,506 INFO L168 Benchmark]: CACSL2BoogieTranslator took 574.47 ms. Allocated memory is still 117.4 MB. Free memory was 84.3 MB in the beginning and 69.5 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2020-11-22 12:57:41,507 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.27 ms. Allocated memory is still 117.4 MB. Free memory was 69.5 MB in the beginning and 66.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-22 12:57:41,507 INFO L168 Benchmark]: Boogie Preprocessor took 75.83 ms. Allocated memory is still 117.4 MB. Free memory was 66.6 MB in the beginning and 63.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-22 12:57:41,507 INFO L168 Benchmark]: RCFGBuilder took 2759.71 ms. Allocated memory was 117.4 MB in the beginning and 144.7 MB in the end (delta: 27.3 MB). Free memory was 63.9 MB in the beginning and 40.1 MB in the end (delta: 23.8 MB). Peak memory consumption was 52.3 MB. Max. memory is 16.1 GB. [2020-11-22 12:57:41,508 INFO L168 Benchmark]: TraceAbstraction took 19276.83 ms. Allocated memory was 144.7 MB in the beginning and 356.5 MB in the end (delta: 211.8 MB). Free memory was 40.1 MB in the beginning and 311.6 MB in the end (delta: -271.5 MB). Peak memory consumption was 139.5 MB. Max. memory is 16.1 GB. [2020-11-22 12:57:41,508 INFO L168 Benchmark]: Witness Printer took 155.49 ms. Allocated memory is still 356.5 MB. Free memory was 311.6 MB in the beginning and 292.7 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2020-11-22 12:57:41,510 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 79.7 MB. Free memory was 40.1 MB in the beginning and 40.0 MB in the end (delta: 62.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 574.47 ms. Allocated memory is still 117.4 MB. Free memory was 84.3 MB in the beginning and 69.5 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 57.27 ms. Allocated memory is still 117.4 MB. Free memory was 69.5 MB in the beginning and 66.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 75.83 ms. Allocated memory is still 117.4 MB. Free memory was 66.6 MB in the beginning and 63.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2759.71 ms. Allocated memory was 117.4 MB in the beginning and 144.7 MB in the end (delta: 27.3 MB). Free memory was 63.9 MB in the beginning and 40.1 MB in the end (delta: 23.8 MB). Peak memory consumption was 52.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 19276.83 ms. Allocated memory was 144.7 MB in the beginning and 356.5 MB in the end (delta: 211.8 MB). Free memory was 40.1 MB in the beginning and 311.6 MB in the end (delta: -271.5 MB). Peak memory consumption was 139.5 MB. Max. memory is 16.1 GB. * Witness Printer took 155.49 ms. Allocated memory is still 356.5 MB. Free memory was 311.6 MB in the beginning and 292.7 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1577 VarBasedMoverChecksPositive, 94 VarBasedMoverChecksNegative, 24 SemBasedMoverChecksPositive, 70 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.9s, 173 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 10.5s, 117 PlacesBefore, 39 PlacesAfterwards, 110 TransitionsBefore, 30 TransitionsAfterwards, 2250 CoEnabledTransitionPairs, 7 FixpointIterations, 40 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 2 ChoiceCompositions, 94 TotalNumberOfCompositions, 6578 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L721] 0 int b = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L726] 0 _Bool x$flush_delayed; [L727] 0 int x$mem_tmp; [L728] 0 _Bool x$r_buff0_thd0; [L729] 0 _Bool x$r_buff0_thd1; [L730] 0 _Bool x$r_buff0_thd2; [L731] 0 _Bool x$r_buff0_thd3; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$read_delayed; [L737] 0 int *x$read_delayed_var; [L738] 0 int x$w_buff0; [L739] 0 _Bool x$w_buff0_used; [L740] 0 int x$w_buff1; [L741] 0 _Bool x$w_buff1_used; [L743] 0 int y = 0; [L745] 0 int z = 0; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L840] 0 pthread_t t891; [L841] FCALL, FORK 0 pthread_create(&t891, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=0] [L842] 0 pthread_t t892; [L843] FCALL, FORK 0 pthread_create(&t892, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=0] [L771] 2 x$w_buff1 = x$w_buff0 [L772] 2 x$w_buff0 = 2 [L773] 2 x$w_buff1_used = x$w_buff0_used [L774] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L776] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L777] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L778] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L779] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L780] 2 x$r_buff0_thd2 = (_Bool)1 [L783] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=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=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L786] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=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=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L789] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=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=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L844] 0 pthread_t t893; [L845] FCALL, FORK 0 pthread_create(&t893, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L809] 3 a = 1 [L812] 3 __unbuffered_p2_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=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=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L815] 3 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=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=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L751] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L754] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L757] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L757] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L758] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L758] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L759] 1 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 [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L760] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L761] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L761] 1 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 [L818] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L818] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L818] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L818] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L819] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L819] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L820] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L820] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L821] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L821] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L822] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L822] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L825] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L827] 3 return 0; [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 1 return 0; [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] 2 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 [L795] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L796] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L796] 2 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 [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L847] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L851] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L851] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L852] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L852] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L853] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L853] 0 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 [L854] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L854] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L855] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L855] 0 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 [L858] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L859] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L860] 0 x$flush_delayed = weak$$choice2 [L861] 0 x$mem_tmp = x [L862] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L862] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1 [L862] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L862] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L863] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L863] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L863] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L863] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L864] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L864] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L864] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L864] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L865] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L865] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L865] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L865] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L866] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L866] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L867] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L867] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L867] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L867] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L867] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L868] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L868] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L869] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L870] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L870] 0 x = x$flush_delayed ? x$mem_tmp : x [L871] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix033_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 108 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 18.9s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.6s, HoareTripleCheckerStatistics: 635 SDtfs, 816 SDslu, 1907 SDs, 0 SdLazy, 831 SolverSat, 236 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 123 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1342occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 280 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 349 NumberOfCodeBlocks, 349 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 307 ConstructedInterpolants, 0 QuantifiedInterpolants, 80831 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...