./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix044_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_04fc13d7-ef17-4fe7-8ca3-02aa2b6e090c/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_04fc13d7-ef17-4fe7-8ca3-02aa2b6e090c/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_04fc13d7-ef17-4fe7-8ca3-02aa2b6e090c/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_04fc13d7-ef17-4fe7-8ca3-02aa2b6e090c/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix044_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_04fc13d7-ef17-4fe7-8ca3-02aa2b6e090c/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_04fc13d7-ef17-4fe7-8ca3-02aa2b6e090c/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 53afb852101d2886c072f185cfa3b840dcd00c69 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-7b2dab5 [2020-12-09 07:13:12,538 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 07:13:12,539 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 07:13:12,561 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 07:13:12,561 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 07:13:12,567 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 07:13:12,569 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 07:13:12,571 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 07:13:12,573 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 07:13:12,574 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 07:13:12,575 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 07:13:12,577 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 07:13:12,577 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 07:13:12,578 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 07:13:12,579 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 07:13:12,581 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 07:13:12,581 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 07:13:12,582 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 07:13:12,584 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 07:13:12,586 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 07:13:12,588 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 07:13:12,590 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 07:13:12,591 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 07:13:12,592 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 07:13:12,595 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 07:13:12,595 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 07:13:12,596 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 07:13:12,597 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 07:13:12,597 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 07:13:12,598 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 07:13:12,598 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 07:13:12,599 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 07:13:12,600 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 07:13:12,601 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 07:13:12,602 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 07:13:12,602 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 07:13:12,603 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 07:13:12,603 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 07:13:12,603 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 07:13:12,604 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 07:13:12,605 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 07:13:12,605 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_04fc13d7-ef17-4fe7-8ca3-02aa2b6e090c/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-09 07:13:12,628 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 07:13:12,628 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 07:13:12,629 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 07:13:12,629 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 07:13:12,629 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 07:13:12,630 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 07:13:12,630 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 07:13:12,630 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 07:13:12,630 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 07:13:12,630 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 07:13:12,630 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 07:13:12,631 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 07:13:12,631 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 07:13:12,631 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 07:13:12,631 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 07:13:12,632 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 07:13:12,632 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 07:13:12,632 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 07:13:12,632 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 07:13:12,632 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 07:13:12,633 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 07:13:12,633 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 07:13:12,633 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 07:13:12,633 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 07:13:12,633 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 07:13:12,633 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 07:13:12,634 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 07:13:12,634 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 07:13:12,634 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 07:13:12,634 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 07:13:12,634 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 07:13:12,635 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 07:13:12,635 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 07:13:12,635 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 07:13:12,635 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 07:13:12,635 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 07:13:12,636 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 07:13:12,636 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 07:13:12,636 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 07:13:12,636 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_04fc13d7-ef17-4fe7-8ca3-02aa2b6e090c/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_04fc13d7-ef17-4fe7-8ca3-02aa2b6e090c/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 -> 53afb852101d2886c072f185cfa3b840dcd00c69 [2020-12-09 07:13:12,828 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 07:13:12,847 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 07:13:12,849 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 07:13:12,850 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 07:13:12,850 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 07:13:12,851 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_04fc13d7-ef17-4fe7-8ca3-02aa2b6e090c/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix044_power.opt.i [2020-12-09 07:13:12,891 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_04fc13d7-ef17-4fe7-8ca3-02aa2b6e090c/bin/utaipan/data/470cf4ea4/d7dd523f3f6342099cd56e016315e00b/FLAG48f6f3103 [2020-12-09 07:13:13,316 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 07:13:13,316 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_04fc13d7-ef17-4fe7-8ca3-02aa2b6e090c/sv-benchmarks/c/pthread-wmm/mix044_power.opt.i [2020-12-09 07:13:13,331 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_04fc13d7-ef17-4fe7-8ca3-02aa2b6e090c/bin/utaipan/data/470cf4ea4/d7dd523f3f6342099cd56e016315e00b/FLAG48f6f3103 [2020-12-09 07:13:13,340 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_04fc13d7-ef17-4fe7-8ca3-02aa2b6e090c/bin/utaipan/data/470cf4ea4/d7dd523f3f6342099cd56e016315e00b [2020-12-09 07:13:13,342 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 07:13:13,343 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 07:13:13,344 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 07:13:13,345 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 07:13:13,347 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 07:13:13,347 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:13:13" (1/1) ... [2020-12-09 07:13:13,348 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@277b978c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:13:13, skipping insertion in model container [2020-12-09 07:13:13,349 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:13:13" (1/1) ... [2020-12-09 07:13:13,353 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 07:13:13,385 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 07:13:13,502 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_04fc13d7-ef17-4fe7-8ca3-02aa2b6e090c/sv-benchmarks/c/pthread-wmm/mix044_power.opt.i[950,963] [2020-12-09 07:13:13,613 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 07:13:13,620 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 07:13:13,628 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_04fc13d7-ef17-4fe7-8ca3-02aa2b6e090c/sv-benchmarks/c/pthread-wmm/mix044_power.opt.i[950,963] [2020-12-09 07:13:13,663 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 07:13:13,713 INFO L208 MainTranslator]: Completed translation [2020-12-09 07:13:13,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:13:13 WrapperNode [2020-12-09 07:13:13,714 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 07:13:13,714 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 07:13:13,714 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 07:13:13,715 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 07:13:13,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:13:13" (1/1) ... [2020-12-09 07:13:13,732 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:13:13" (1/1) ... [2020-12-09 07:13:13,754 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 07:13:13,755 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 07:13:13,755 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 07:13:13,755 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 07:13:13,761 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:13:13" (1/1) ... [2020-12-09 07:13:13,761 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:13:13" (1/1) ... [2020-12-09 07:13:13,765 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:13:13" (1/1) ... [2020-12-09 07:13:13,765 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:13:13" (1/1) ... [2020-12-09 07:13:13,773 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:13:13" (1/1) ... [2020-12-09 07:13:13,775 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:13:13" (1/1) ... [2020-12-09 07:13:13,778 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:13:13" (1/1) ... [2020-12-09 07:13:13,782 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 07:13:13,782 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 07:13:13,782 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 07:13:13,783 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 07:13:13,783 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:13:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_04fc13d7-ef17-4fe7-8ca3-02aa2b6e090c/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-12-09 07:13:13,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-09 07:13:13,861 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-12-09 07:13:13,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 07:13:13,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-09 07:13:13,861 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-12-09 07:13:13,861 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-12-09 07:13:13,862 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-12-09 07:13:13,862 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-12-09 07:13:13,862 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-12-09 07:13:13,862 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-12-09 07:13:13,862 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-12-09 07:13:13,862 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-12-09 07:13:13,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 07:13:13,862 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-12-09 07:13:13,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 07:13:13,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 07:13:13,864 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-12-09 07:13:15,106 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 07:13:15,106 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2020-12-09 07:13:15,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:13:15 BoogieIcfgContainer [2020-12-09 07:13:15,108 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 07:13:15,109 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 07:13:15,109 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 07:13:15,111 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 07:13:15,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 07:13:13" (1/3) ... [2020-12-09 07:13:15,112 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50d8281b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:13:15, skipping insertion in model container [2020-12-09 07:13:15,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:13:13" (2/3) ... [2020-12-09 07:13:15,112 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50d8281b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:13:15, skipping insertion in model container [2020-12-09 07:13:15,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:13:15" (3/3) ... [2020-12-09 07:13:15,113 INFO L111 eAbstractionObserver]: Analyzing ICFG mix044_power.opt.i [2020-12-09 07:13:15,131 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-09 07:13:15,131 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 07:13:15,134 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-09 07:13:15,134 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-09 07:13:15,161 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,161 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,161 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,161 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,161 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,161 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,161 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,161 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,162 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,162 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,162 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,162 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,162 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,162 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,163 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,163 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,163 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,163 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,163 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,163 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,163 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,163 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,163 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,164 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,164 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,164 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,164 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,164 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,164 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,164 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,164 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,165 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,165 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,165 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,165 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,165 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,165 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,165 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,166 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,166 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,166 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,166 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,166 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,166 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,166 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,167 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,167 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,167 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,167 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,167 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,168 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,168 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,168 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,168 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,168 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,168 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,168 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,168 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,168 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,169 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,169 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,169 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,169 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,169 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,169 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,169 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,170 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,170 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,170 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,170 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,170 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,170 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,170 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,171 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,171 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,171 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,171 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,171 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,171 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,171 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,172 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,172 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,172 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,172 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,173 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,173 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,174 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,174 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,175 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,175 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,175 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,176 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,177 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,177 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,177 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,177 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,177 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,177 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,177 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,178 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,178 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,178 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,179 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,179 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,179 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,179 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,179 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,179 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,180 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,180 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,180 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,180 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,180 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,180 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:13:15,181 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-12-09 07:13:15,189 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-12-09 07:13:15,203 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 07:13:15,203 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 07:13:15,203 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 07:13:15,203 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 07:13:15,203 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 07:13:15,203 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 07:13:15,203 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 07:13:15,203 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 07:13:15,213 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-12-09 07:13:15,214 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 117 transitions, 254 flow [2020-12-09 07:13:15,216 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 117 transitions, 254 flow [2020-12-09 07:13:15,218 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 128 places, 117 transitions, 254 flow [2020-12-09 07:13:15,257 INFO L129 PetriNetUnfolder]: 2/113 cut-off events. [2020-12-09 07:13:15,257 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-12-09 07:13:15,261 INFO L84 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 87 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2020-12-09 07:13:15,264 INFO L116 LiptonReduction]: Number of co-enabled transitions 2598 [2020-12-09 07:13:15,467 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 4, 3, 2, 1] term [2020-12-09 07:13:15,468 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:15,470 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term [2020-12-09 07:13:15,470 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:15,471 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 4, 3, 2, 1] term [2020-12-09 07:13:15,471 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:15,474 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 07:13:15,475 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:15,476 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 07:13:15,476 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:15,523 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 07:13:15,523 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:15,524 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 07:13:15,524 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:16,313 WARN L197 SmtUtils]: Spent 769.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2020-12-09 07:13:16,667 WARN L197 SmtUtils]: Spent 352.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2020-12-09 07:13:18,224 WARN L197 SmtUtils]: Spent 1.55 s on a formula simplification. DAG size of input: 314 DAG size of output: 270 [2020-12-09 07:13:18,896 WARN L197 SmtUtils]: Spent 669.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2020-12-09 07:13:19,129 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 07:13:19,129 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:13:19,130 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-09 07:13:19,130 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:13:19,157 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 07:13:19,157 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:19,158 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 07:13:19,158 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:19,206 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 07:13:19,206 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:19,207 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 07:13:19,208 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:19,243 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 07:13:19,243 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:19,244 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 07:13:19,244 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:19,281 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 07:13:19,281 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:19,282 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 07:13:19,282 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:19,308 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 07:13:19,309 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:19,309 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 07:13:19,310 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:19,469 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 07:13:19,469 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:19,470 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 07:13:19,470 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:19,502 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 07:13:19,502 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:13:19,503 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-09 07:13:19,503 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:13:19,726 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 07:13:19,726 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:19,727 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 07:13:19,727 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:19,754 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 07:13:19,754 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:19,755 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 07:13:19,755 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:19,844 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 07:13:19,845 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:19,845 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 07:13:19,845 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:19,869 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 07:13:19,869 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:19,870 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 07:13:19,870 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:19,894 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 07:13:19,895 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:19,895 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 07:13:19,895 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:19,920 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 07:13:19,920 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:19,921 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 07:13:19,921 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:20,006 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 07:13:20,006 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:20,007 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 07:13:20,008 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:20,030 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 07:13:20,030 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:20,031 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 07:13:20,031 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:20,094 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:13:20,094 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:13:20,096 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-12-09 07:13:20,097 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:20,097 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-12-09 07:13:20,098 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:20,100 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-12-09 07:13:20,101 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 07:13:20,103 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-12-09 07:13:20,103 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 07:13:20,104 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-12-09 07:13:20,105 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 07:13:20,107 INFO L398 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-12-09 07:13:20,107 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:20,108 INFO L398 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-12-09 07:13:20,109 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:20,110 INFO L398 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-12-09 07:13:20,110 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:20,166 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 07:13:20,166 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:20,167 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 07:13:20,167 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:20,169 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-12-09 07:13:20,169 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 07:13:20,172 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-12-09 07:13:20,172 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:20,263 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-12-09 07:13:20,263 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:13:20,469 WARN L197 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-12-09 07:13:20,875 WARN L197 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2020-12-09 07:13:20,987 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2020-12-09 07:13:21,034 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 07:13:21,034 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:21,034 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 07:13:21,035 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:21,049 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 07:13:21,049 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:21,049 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 07:13:21,050 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:21,069 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 07:13:21,069 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:21,070 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 07:13:21,070 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:21,093 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 07:13:21,093 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:21,093 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 07:13:21,093 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:21,160 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 07:13:21,160 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:21,160 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 07:13:21,161 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:21,178 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 07:13:21,178 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:13:21,179 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-09 07:13:21,179 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:13:21,252 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 07:13:21,253 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:21,253 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 07:13:21,253 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:21,266 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 07:13:21,266 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:21,267 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 07:13:21,267 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:21,297 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:13:21,297 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:13:21,298 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-12-09 07:13:21,299 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:21,299 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-12-09 07:13:21,299 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:21,301 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-12-09 07:13:21,301 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:21,302 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-12-09 07:13:21,302 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:21,303 INFO L398 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-12-09 07:13:21,303 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:21,304 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-12-09 07:13:21,304 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:21,305 INFO L398 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-12-09 07:13:21,306 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:21,338 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 07:13:21,338 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:21,338 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 07:13:21,338 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:21,340 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-12-09 07:13:21,340 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 07:13:21,341 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-12-09 07:13:21,342 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:21,656 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 07:13:21,656 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:21,657 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 07:13:21,657 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:21,658 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-12-09 07:13:21,658 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 07:13:21,660 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-12-09 07:13:21,660 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:21,679 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:13:21,680 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:13:21,683 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-12-09 07:13:21,683 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:21,683 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-12-09 07:13:21,684 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:21,685 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-12-09 07:13:21,685 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:21,686 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-12-09 07:13:21,686 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:21,687 INFO L398 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-12-09 07:13:21,687 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:21,689 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-12-09 07:13:21,689 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:21,690 INFO L398 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-12-09 07:13:21,690 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:21,816 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 07:13:21,816 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:21,816 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 07:13:21,817 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:21,842 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 07:13:21,842 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:21,842 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 07:13:21,842 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:21,863 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 07:13:21,863 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:21,864 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 07:13:21,864 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:21,881 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 07:13:21,881 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:21,882 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 07:13:21,882 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:21,897 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:13:21,897 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:13:21,898 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:13:21,898 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:13:21,898 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:13:21,899 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:13:21,900 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:13:21,900 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:13:21,912 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:13:21,912 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:13:21,913 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:13:21,913 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:13:21,914 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:13:21,914 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:13:21,915 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:13:21,915 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:13:21,992 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 07:13:21,993 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:21,993 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 07:13:21,993 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:22,014 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 07:13:22,014 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:22,015 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 07:13:22,015 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:22,311 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-12-09 07:13:22,460 WARN L197 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-12-09 07:13:22,496 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 07:13:22,496 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:22,496 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 07:13:22,497 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:22,530 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 07:13:22,530 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:22,531 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 07:13:22,531 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:22,559 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 07:13:22,559 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:22,560 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 07:13:22,560 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:22,575 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 07:13:22,575 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:22,576 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 07:13:22,576 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:22,638 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:13:22,638 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:13:22,639 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:13:22,639 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:13:22,640 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:13:22,640 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:13:22,641 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:13:22,641 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:13:22,653 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:13:22,654 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:13:22,654 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:13:22,654 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:13:22,655 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:13:22,655 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:13:22,656 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:13:22,656 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:13:22,834 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 07:13:22,834 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:13:22,835 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-09 07:13:22,835 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:13:22,851 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 07:13:22,851 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:22,852 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 07:13:22,852 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:23,006 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:13:23,007 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:13:23,007 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:13:23,007 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:13:23,008 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:13:23,008 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:13:23,009 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:13:23,009 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:13:23,020 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:13:23,020 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:13:23,021 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:13:23,021 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:13:23,022 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:13:23,022 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:23,023 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:13:23,023 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:23,040 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:13:23,040 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:13:23,041 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:13:23,041 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:13:23,041 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:13:23,042 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:13:23,043 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:13:23,043 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:13:23,055 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:13:23,056 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:13:23,056 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:13:23,056 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:13:23,057 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:13:23,057 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:13:23,058 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:13:23,058 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:13:23,195 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:13:23,195 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:13:23,195 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:13:23,196 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:13:23,197 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:13:23,197 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:23,198 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:13:23,198 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:23,215 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:13:23,216 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:13:23,216 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:13:23,217 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:13:23,218 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:13:23,219 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:13:23,220 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:13:23,221 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:13:23,358 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:13:23,358 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:13:23,358 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:13:23,359 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:13:23,360 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:13:23,360 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:23,361 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:13:23,361 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:23,379 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:13:23,379 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:13:23,380 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:13:23,380 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:13:23,381 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:13:23,382 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:13:23,383 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:13:23,383 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:13:23,405 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:13:23,405 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:13:23,406 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:13:23,406 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:13:23,407 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:13:23,408 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:13:23,409 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:13:23,409 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:13:23,425 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:13:23,425 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:13:23,426 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:13:23,426 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:13:23,427 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:13:23,427 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:23,428 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 07:13:23,429 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:24,139 WARN L197 SmtUtils]: Spent 334.00 ms on a formula simplification that was a NOOP. DAG size: 191 [2020-12-09 07:13:24,478 WARN L197 SmtUtils]: Spent 338.00 ms on a formula simplification that was a NOOP. DAG size: 191 [2020-12-09 07:13:25,286 WARN L197 SmtUtils]: Spent 805.00 ms on a formula simplification that was a NOOP. DAG size: 270 [2020-12-09 07:13:26,110 WARN L197 SmtUtils]: Spent 822.00 ms on a formula simplification that was a NOOP. DAG size: 270 [2020-12-09 07:13:26,124 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 07:13:26,124 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:26,125 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 07:13:26,125 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:26,140 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 07:13:26,140 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:26,140 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 07:13:26,141 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:27,024 WARN L197 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2020-12-09 07:13:27,196 WARN L197 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2020-12-09 07:13:27,565 WARN L197 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2020-12-09 07:13:27,717 WARN L197 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2020-12-09 07:13:28,363 WARN L197 SmtUtils]: Spent 645.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 206 [2020-12-09 07:13:28,692 WARN L197 SmtUtils]: Spent 327.00 ms on a formula simplification that was a NOOP. DAG size: 206 [2020-12-09 07:13:30,051 WARN L197 SmtUtils]: Spent 1.36 s on a formula simplification that was a NOOP. DAG size: 286 [2020-12-09 07:13:31,635 WARN L197 SmtUtils]: Spent 1.58 s on a formula simplification that was a NOOP. DAG size: 286 [2020-12-09 07:13:31,646 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 07:13:31,646 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:31,646 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 07:13:31,647 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:31,665 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 07:13:31,665 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:31,665 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 07:13:31,665 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:31,698 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 07:13:31,698 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:31,698 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 07:13:31,698 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:31,720 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 07:13:31,720 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:31,721 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 07:13:31,721 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:31,759 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 07:13:31,759 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:31,759 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 07:13:31,760 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:31,777 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 07:13:31,777 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:31,777 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 07:13:31,777 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:31,821 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 07:13:31,822 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:31,822 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 07:13:31,822 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:31,841 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 07:13:31,841 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:31,841 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 07:13:31,841 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:31,872 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 07:13:31,872 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:31,873 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 07:13:31,873 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:31,892 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 07:13:31,892 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:31,893 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 07:13:31,893 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:13:31,921 INFO L131 LiptonReduction]: Checked pairs total: 7778 [2020-12-09 07:13:31,922 INFO L133 LiptonReduction]: Total number of compositions: 98 [2020-12-09 07:13:31,926 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 33 transitions, 86 flow [2020-12-09 07:13:32,050 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3002 states. [2020-12-09 07:13:32,051 INFO L276 IsEmpty]: Start isEmpty. Operand 3002 states. [2020-12-09 07:13:32,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 07:13:32,056 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:13:32,056 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:13:32,057 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:13:32,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:13:32,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1566809842, now seen corresponding path program 1 times [2020-12-09 07:13:32,067 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:13:32,067 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141048581] [2020-12-09 07:13:32,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:13:32,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:13:32,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:13:32,243 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141048581] [2020-12-09 07:13:32,244 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:13:32,244 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-09 07:13:32,244 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106848596] [2020-12-09 07:13:32,247 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 07:13:32,247 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:13:32,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 07:13:32,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 07:13:32,257 INFO L87 Difference]: Start difference. First operand 3002 states. Second operand 3 states. [2020-12-09 07:13:32,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:13:32,352 INFO L93 Difference]: Finished difference Result 2602 states and 10064 transitions. [2020-12-09 07:13:32,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 07:13:32,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-12-09 07:13:32,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:13:32,385 INFO L225 Difference]: With dead ends: 2602 [2020-12-09 07:13:32,385 INFO L226 Difference]: Without dead ends: 2122 [2020-12-09 07:13:32,386 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-12-09 07:13:32,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2020-12-09 07:13:32,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 2122. [2020-12-09 07:13:32,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2122 states. [2020-12-09 07:13:32,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2122 states to 2122 states and 8080 transitions. [2020-12-09 07:13:32,503 INFO L78 Accepts]: Start accepts. Automaton has 2122 states and 8080 transitions. Word has length 9 [2020-12-09 07:13:32,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:13:32,504 INFO L481 AbstractCegarLoop]: Abstraction has 2122 states and 8080 transitions. [2020-12-09 07:13:32,504 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 07:13:32,504 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 8080 transitions. [2020-12-09 07:13:32,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-09 07:13:32,506 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:13:32,506 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:13:32,506 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 07:13:32,506 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:13:32,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:13:32,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1829199143, now seen corresponding path program 1 times [2020-12-09 07:13:32,507 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:13:32,507 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987213744] [2020-12-09 07:13:32,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:13:32,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:13:32,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:13:32,693 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987213744] [2020-12-09 07:13:32,693 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:13:32,693 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 07:13:32,693 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589092870] [2020-12-09 07:13:32,695 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 07:13:32,695 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:13:32,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 07:13:32,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 07:13:32,696 INFO L87 Difference]: Start difference. First operand 2122 states and 8080 transitions. Second operand 4 states. [2020-12-09 07:13:32,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:13:32,769 INFO L93 Difference]: Finished difference Result 1994 states and 7504 transitions. [2020-12-09 07:13:32,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 07:13:32,770 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-12-09 07:13:32,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:13:32,784 INFO L225 Difference]: With dead ends: 1994 [2020-12-09 07:13:32,784 INFO L226 Difference]: Without dead ends: 1994 [2020-12-09 07:13:32,785 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 07:13:32,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1994 states. [2020-12-09 07:13:32,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1994 to 1994. [2020-12-09 07:13:32,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1994 states. [2020-12-09 07:13:32,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1994 states to 1994 states and 7504 transitions. [2020-12-09 07:13:32,841 INFO L78 Accepts]: Start accepts. Automaton has 1994 states and 7504 transitions. Word has length 11 [2020-12-09 07:13:32,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:13:32,842 INFO L481 AbstractCegarLoop]: Abstraction has 1994 states and 7504 transitions. [2020-12-09 07:13:32,842 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 07:13:32,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1994 states and 7504 transitions. [2020-12-09 07:13:32,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-09 07:13:32,845 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:13:32,845 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:13:32,845 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-09 07:13:32,845 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:13:32,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:13:32,846 INFO L82 PathProgramCache]: Analyzing trace with hash -473326592, now seen corresponding path program 1 times [2020-12-09 07:13:32,846 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:13:32,846 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598384862] [2020-12-09 07:13:32,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:13:32,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:13:32,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:13:32,947 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598384862] [2020-12-09 07:13:32,947 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:13:32,947 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-09 07:13:32,947 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731368620] [2020-12-09 07:13:32,948 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 07:13:32,948 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:13:32,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 07:13:32,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 07:13:32,948 INFO L87 Difference]: Start difference. First operand 1994 states and 7504 transitions. Second operand 3 states. [2020-12-09 07:13:32,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:13:32,970 INFO L93 Difference]: Finished difference Result 1898 states and 7104 transitions. [2020-12-09 07:13:32,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 07:13:32,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-12-09 07:13:32,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:13:32,989 INFO L225 Difference]: With dead ends: 1898 [2020-12-09 07:13:32,989 INFO L226 Difference]: Without dead ends: 1898 [2020-12-09 07:13:32,990 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-12-09 07:13:33,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2020-12-09 07:13:33,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1898. [2020-12-09 07:13:33,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1898 states. [2020-12-09 07:13:33,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 7104 transitions. [2020-12-09 07:13:33,052 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 7104 transitions. Word has length 13 [2020-12-09 07:13:33,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:13:33,052 INFO L481 AbstractCegarLoop]: Abstraction has 1898 states and 7104 transitions. [2020-12-09 07:13:33,052 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 07:13:33,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 7104 transitions. [2020-12-09 07:13:33,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-09 07:13:33,054 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:13:33,054 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:13:33,054 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-09 07:13:33,054 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:13:33,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:13:33,055 INFO L82 PathProgramCache]: Analyzing trace with hash 367122832, now seen corresponding path program 1 times [2020-12-09 07:13:33,055 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:13:33,055 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30235089] [2020-12-09 07:13:33,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:13:33,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:13:33,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:13:33,110 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30235089] [2020-12-09 07:13:33,110 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:13:33,110 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-09 07:13:33,110 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897846095] [2020-12-09 07:13:33,110 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 07:13:33,111 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:13:33,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 07:13:33,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 07:13:33,111 INFO L87 Difference]: Start difference. First operand 1898 states and 7104 transitions. Second operand 3 states. [2020-12-09 07:13:33,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:13:33,127 INFO L93 Difference]: Finished difference Result 1866 states and 6962 transitions. [2020-12-09 07:13:33,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 07:13:33,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-12-09 07:13:33,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:13:33,141 INFO L225 Difference]: With dead ends: 1866 [2020-12-09 07:13:33,141 INFO L226 Difference]: Without dead ends: 1866 [2020-12-09 07:13:33,141 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-12-09 07:13:33,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1866 states. [2020-12-09 07:13:33,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1866 to 1866. [2020-12-09 07:13:33,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1866 states. [2020-12-09 07:13:33,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1866 states to 1866 states and 6962 transitions. [2020-12-09 07:13:33,207 INFO L78 Accepts]: Start accepts. Automaton has 1866 states and 6962 transitions. Word has length 15 [2020-12-09 07:13:33,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:13:33,207 INFO L481 AbstractCegarLoop]: Abstraction has 1866 states and 6962 transitions. [2020-12-09 07:13:33,207 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 07:13:33,207 INFO L276 IsEmpty]: Start isEmpty. Operand 1866 states and 6962 transitions. [2020-12-09 07:13:33,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 07:13:33,210 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:13:33,210 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:13:33,210 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-09 07:13:33,210 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:13:33,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:13:33,210 INFO L82 PathProgramCache]: Analyzing trace with hash 511407601, now seen corresponding path program 1 times [2020-12-09 07:13:33,210 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:13:33,210 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424843252] [2020-12-09 07:13:33,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:13:33,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:13:33,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:13:33,285 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424843252] [2020-12-09 07:13:33,285 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:13:33,285 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 07:13:33,285 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348642504] [2020-12-09 07:13:33,285 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 07:13:33,285 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:13:33,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 07:13:33,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 07:13:33,286 INFO L87 Difference]: Start difference. First operand 1866 states and 6962 transitions. Second operand 5 states. [2020-12-09 07:13:33,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:13:33,404 INFO L93 Difference]: Finished difference Result 2198 states and 8276 transitions. [2020-12-09 07:13:33,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 07:13:33,405 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-12-09 07:13:33,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:13:33,420 INFO L225 Difference]: With dead ends: 2198 [2020-12-09 07:13:33,421 INFO L226 Difference]: Without dead ends: 2198 [2020-12-09 07:13:33,421 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-12-09 07:13:33,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2198 states. [2020-12-09 07:13:33,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2198 to 2026. [2020-12-09 07:13:33,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2026 states. [2020-12-09 07:13:33,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2026 states to 2026 states and 7618 transitions. [2020-12-09 07:13:33,483 INFO L78 Accepts]: Start accepts. Automaton has 2026 states and 7618 transitions. Word has length 16 [2020-12-09 07:13:33,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:13:33,483 INFO L481 AbstractCegarLoop]: Abstraction has 2026 states and 7618 transitions. [2020-12-09 07:13:33,483 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 07:13:33,483 INFO L276 IsEmpty]: Start isEmpty. Operand 2026 states and 7618 transitions. [2020-12-09 07:13:33,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 07:13:33,486 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:13:33,486 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:13:33,486 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-09 07:13:33,486 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:13:33,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:13:33,486 INFO L82 PathProgramCache]: Analyzing trace with hash 543935281, now seen corresponding path program 2 times [2020-12-09 07:13:33,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:13:33,487 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984119904] [2020-12-09 07:13:33,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:13:33,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:13:33,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:13:33,566 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984119904] [2020-12-09 07:13:33,566 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:13:33,566 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 07:13:33,567 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377287959] [2020-12-09 07:13:33,567 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 07:13:33,567 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:13:33,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 07:13:33,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-09 07:13:33,567 INFO L87 Difference]: Start difference. First operand 2026 states and 7618 transitions. Second operand 6 states. [2020-12-09 07:13:33,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:13:33,654 INFO L93 Difference]: Finished difference Result 2362 states and 8842 transitions. [2020-12-09 07:13:33,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 07:13:33,655 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-12-09 07:13:33,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:13:33,670 INFO L225 Difference]: With dead ends: 2362 [2020-12-09 07:13:33,671 INFO L226 Difference]: Without dead ends: 2362 [2020-12-09 07:13:33,671 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-09 07:13:33,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2020-12-09 07:13:33,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 2298. [2020-12-09 07:13:33,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2298 states. [2020-12-09 07:13:33,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2298 states to 2298 states and 8618 transitions. [2020-12-09 07:13:33,732 INFO L78 Accepts]: Start accepts. Automaton has 2298 states and 8618 transitions. Word has length 16 [2020-12-09 07:13:33,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:13:33,732 INFO L481 AbstractCegarLoop]: Abstraction has 2298 states and 8618 transitions. [2020-12-09 07:13:33,732 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 07:13:33,732 INFO L276 IsEmpty]: Start isEmpty. Operand 2298 states and 8618 transitions. [2020-12-09 07:13:33,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 07:13:33,735 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:13:33,735 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:13:33,735 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-09 07:13:33,735 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:13:33,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:13:33,736 INFO L82 PathProgramCache]: Analyzing trace with hash -150251111, now seen corresponding path program 3 times [2020-12-09 07:13:33,736 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:13:33,736 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583818983] [2020-12-09 07:13:33,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:13:33,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:13:33,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:13:33,831 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583818983] [2020-12-09 07:13:33,831 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:13:33,831 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 07:13:33,831 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957357627] [2020-12-09 07:13:33,831 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 07:13:33,832 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:13:33,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 07:13:33,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-09 07:13:33,832 INFO L87 Difference]: Start difference. First operand 2298 states and 8618 transitions. Second operand 6 states. [2020-12-09 07:13:33,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:13:33,922 INFO L93 Difference]: Finished difference Result 2394 states and 8928 transitions. [2020-12-09 07:13:33,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 07:13:33,923 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-12-09 07:13:33,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:13:33,933 INFO L225 Difference]: With dead ends: 2394 [2020-12-09 07:13:33,933 INFO L226 Difference]: Without dead ends: 2394 [2020-12-09 07:13:33,934 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-09 07:13:33,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2394 states. [2020-12-09 07:13:33,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2394 to 2222. [2020-12-09 07:13:33,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2222 states. [2020-12-09 07:13:33,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2222 states to 2222 states and 8246 transitions. [2020-12-09 07:13:33,984 INFO L78 Accepts]: Start accepts. Automaton has 2222 states and 8246 transitions. Word has length 16 [2020-12-09 07:13:33,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:13:33,984 INFO L481 AbstractCegarLoop]: Abstraction has 2222 states and 8246 transitions. [2020-12-09 07:13:33,984 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 07:13:33,984 INFO L276 IsEmpty]: Start isEmpty. Operand 2222 states and 8246 transitions. [2020-12-09 07:13:33,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 07:13:33,987 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:13:33,987 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:13:33,987 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-09 07:13:33,988 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:13:33,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:13:33,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1238929341, now seen corresponding path program 1 times [2020-12-09 07:13:33,988 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:13:33,988 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027948816] [2020-12-09 07:13:33,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:13:34,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:13:34,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:13:34,037 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027948816] [2020-12-09 07:13:34,037 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:13:34,037 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 07:13:34,038 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604404229] [2020-12-09 07:13:34,038 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 07:13:34,038 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:13:34,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 07:13:34,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 07:13:34,038 INFO L87 Difference]: Start difference. First operand 2222 states and 8246 transitions. Second operand 4 states. [2020-12-09 07:13:34,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:13:34,080 INFO L93 Difference]: Finished difference Result 2356 states and 7980 transitions. [2020-12-09 07:13:34,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 07:13:34,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-12-09 07:13:34,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:13:34,086 INFO L225 Difference]: With dead ends: 2356 [2020-12-09 07:13:34,086 INFO L226 Difference]: Without dead ends: 1748 [2020-12-09 07:13:34,086 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-12-09 07:13:34,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1748 states. [2020-12-09 07:13:34,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1748 to 1748. [2020-12-09 07:13:34,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1748 states. [2020-12-09 07:13:34,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1748 states and 5876 transitions. [2020-12-09 07:13:34,143 INFO L78 Accepts]: Start accepts. Automaton has 1748 states and 5876 transitions. Word has length 16 [2020-12-09 07:13:34,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:13:34,143 INFO L481 AbstractCegarLoop]: Abstraction has 1748 states and 5876 transitions. [2020-12-09 07:13:34,143 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 07:13:34,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 5876 transitions. [2020-12-09 07:13:34,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-09 07:13:34,147 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:13:34,147 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:13:34,147 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-09 07:13:34,147 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:13:34,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:13:34,148 INFO L82 PathProgramCache]: Analyzing trace with hash -247945249, now seen corresponding path program 1 times [2020-12-09 07:13:34,148 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:13:34,148 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863573426] [2020-12-09 07:13:34,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:13:34,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:13:34,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:13:34,209 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863573426] [2020-12-09 07:13:34,209 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:13:34,209 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 07:13:34,210 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057642015] [2020-12-09 07:13:34,210 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 07:13:34,210 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:13:34,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 07:13:34,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 07:13:34,211 INFO L87 Difference]: Start difference. First operand 1748 states and 5876 transitions. Second operand 5 states. [2020-12-09 07:13:34,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:13:34,275 INFO L93 Difference]: Finished difference Result 1533 states and 4733 transitions. [2020-12-09 07:13:34,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 07:13:34,276 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-12-09 07:13:34,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:13:34,281 INFO L225 Difference]: With dead ends: 1533 [2020-12-09 07:13:34,281 INFO L226 Difference]: Without dead ends: 1141 [2020-12-09 07:13:34,281 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-12-09 07:13:34,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2020-12-09 07:13:34,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 1141. [2020-12-09 07:13:34,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1141 states. [2020-12-09 07:13:34,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1141 states to 1141 states and 3448 transitions. [2020-12-09 07:13:34,312 INFO L78 Accepts]: Start accepts. Automaton has 1141 states and 3448 transitions. Word has length 17 [2020-12-09 07:13:34,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:13:34,312 INFO L481 AbstractCegarLoop]: Abstraction has 1141 states and 3448 transitions. [2020-12-09 07:13:34,312 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 07:13:34,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 3448 transitions. [2020-12-09 07:13:34,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-09 07:13:34,315 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:13:34,315 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:13:34,315 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-09 07:13:34,316 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:13:34,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:13:34,316 INFO L82 PathProgramCache]: Analyzing trace with hash -50960848, now seen corresponding path program 1 times [2020-12-09 07:13:34,316 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:13:34,316 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514961213] [2020-12-09 07:13:34,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:13:34,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:13:34,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:13:34,375 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514961213] [2020-12-09 07:13:34,375 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:13:34,376 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 07:13:34,376 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077379603] [2020-12-09 07:13:34,376 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 07:13:34,376 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:13:34,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 07:13:34,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 07:13:34,377 INFO L87 Difference]: Start difference. First operand 1141 states and 3448 transitions. Second operand 3 states. [2020-12-09 07:13:34,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:13:34,395 INFO L93 Difference]: Finished difference Result 1616 states and 4742 transitions. [2020-12-09 07:13:34,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 07:13:34,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-12-09 07:13:34,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:13:34,399 INFO L225 Difference]: With dead ends: 1616 [2020-12-09 07:13:34,399 INFO L226 Difference]: Without dead ends: 1152 [2020-12-09 07:13:34,400 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-09 07:13:34,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2020-12-09 07:13:34,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 1132. [2020-12-09 07:13:34,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1132 states. [2020-12-09 07:13:34,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 3240 transitions. [2020-12-09 07:13:34,422 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 3240 transitions. Word has length 19 [2020-12-09 07:13:34,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:13:34,422 INFO L481 AbstractCegarLoop]: Abstraction has 1132 states and 3240 transitions. [2020-12-09 07:13:34,422 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 07:13:34,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 3240 transitions. [2020-12-09 07:13:34,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-09 07:13:34,424 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:13:34,424 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:13:34,425 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-09 07:13:34,425 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:13:34,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:13:34,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1382870722, now seen corresponding path program 1 times [2020-12-09 07:13:34,425 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:13:34,425 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554914231] [2020-12-09 07:13:34,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:13:34,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:13:34,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:13:34,481 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554914231] [2020-12-09 07:13:34,481 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:13:34,481 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 07:13:34,481 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502781332] [2020-12-09 07:13:34,481 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 07:13:34,481 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:13:34,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 07:13:34,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-09 07:13:34,482 INFO L87 Difference]: Start difference. First operand 1132 states and 3240 transitions. Second operand 6 states. [2020-12-09 07:13:34,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:13:34,538 INFO L93 Difference]: Finished difference Result 994 states and 2799 transitions. [2020-12-09 07:13:34,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 07:13:34,538 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-12-09 07:13:34,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:13:34,540 INFO L225 Difference]: With dead ends: 994 [2020-12-09 07:13:34,540 INFO L226 Difference]: Without dead ends: 863 [2020-12-09 07:13:34,540 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-12-09 07:13:34,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2020-12-09 07:13:34,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 815. [2020-12-09 07:13:34,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 815 states. [2020-12-09 07:13:34,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 2335 transitions. [2020-12-09 07:13:34,562 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 2335 transitions. Word has length 19 [2020-12-09 07:13:34,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:13:34,563 INFO L481 AbstractCegarLoop]: Abstraction has 815 states and 2335 transitions. [2020-12-09 07:13:34,563 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 07:13:34,563 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 2335 transitions. [2020-12-09 07:13:34,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-09 07:13:34,565 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:13:34,565 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] [2020-12-09 07:13:34,565 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-09 07:13:34,566 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:13:34,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:13:34,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1101171526, now seen corresponding path program 1 times [2020-12-09 07:13:34,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:13:34,566 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069344056] [2020-12-09 07:13:34,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:13:34,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:13:34,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:13:34,627 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069344056] [2020-12-09 07:13:34,627 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:13:34,627 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 07:13:34,627 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347434119] [2020-12-09 07:13:34,628 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 07:13:34,628 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:13:34,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 07:13:34,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 07:13:34,628 INFO L87 Difference]: Start difference. First operand 815 states and 2335 transitions. Second operand 4 states. [2020-12-09 07:13:34,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:13:34,652 INFO L93 Difference]: Finished difference Result 1062 states and 2965 transitions. [2020-12-09 07:13:34,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 07:13:34,653 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-12-09 07:13:34,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:13:34,655 INFO L225 Difference]: With dead ends: 1062 [2020-12-09 07:13:34,655 INFO L226 Difference]: Without dead ends: 641 [2020-12-09 07:13:34,655 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-12-09 07:13:34,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2020-12-09 07:13:34,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 638. [2020-12-09 07:13:34,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2020-12-09 07:13:34,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 1687 transitions. [2020-12-09 07:13:34,669 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 1687 transitions. Word has length 22 [2020-12-09 07:13:34,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:13:34,669 INFO L481 AbstractCegarLoop]: Abstraction has 638 states and 1687 transitions. [2020-12-09 07:13:34,669 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 07:13:34,670 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 1687 transitions. [2020-12-09 07:13:34,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-09 07:13:34,671 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:13:34,671 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] [2020-12-09 07:13:34,671 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-09 07:13:34,672 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:13:34,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:13:34,672 INFO L82 PathProgramCache]: Analyzing trace with hash 192906558, now seen corresponding path program 2 times [2020-12-09 07:13:34,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:13:34,672 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515242506] [2020-12-09 07:13:34,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:13:34,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:13:34,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:13:34,750 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515242506] [2020-12-09 07:13:34,750 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:13:34,750 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-09 07:13:34,750 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653616391] [2020-12-09 07:13:34,750 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 07:13:34,750 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:13:34,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 07:13:34,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-09 07:13:34,751 INFO L87 Difference]: Start difference. First operand 638 states and 1687 transitions. Second operand 7 states. [2020-12-09 07:13:34,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:13:34,819 INFO L93 Difference]: Finished difference Result 611 states and 1633 transitions. [2020-12-09 07:13:34,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 07:13:34,819 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-12-09 07:13:34,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:13:34,820 INFO L225 Difference]: With dead ends: 611 [2020-12-09 07:13:34,821 INFO L226 Difference]: Without dead ends: 228 [2020-12-09 07:13:34,821 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-12-09 07:13:34,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2020-12-09 07:13:34,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 184. [2020-12-09 07:13:34,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-12-09 07:13:34,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 454 transitions. [2020-12-09 07:13:34,826 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 454 transitions. Word has length 22 [2020-12-09 07:13:34,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:13:34,826 INFO L481 AbstractCegarLoop]: Abstraction has 184 states and 454 transitions. [2020-12-09 07:13:34,827 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 07:13:34,827 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 454 transitions. [2020-12-09 07:13:34,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-09 07:13:34,828 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:13:34,828 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, 1, 1] [2020-12-09 07:13:34,828 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-09 07:13:34,828 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:13:34,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:13:34,828 INFO L82 PathProgramCache]: Analyzing trace with hash -277081058, now seen corresponding path program 1 times [2020-12-09 07:13:34,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:13:34,829 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337864088] [2020-12-09 07:13:34,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:13:34,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:13:34,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:13:34,889 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337864088] [2020-12-09 07:13:34,889 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:13:34,889 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 07:13:34,889 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880959983] [2020-12-09 07:13:34,889 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 07:13:34,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:13:34,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 07:13:34,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 07:13:34,890 INFO L87 Difference]: Start difference. First operand 184 states and 454 transitions. Second operand 4 states. [2020-12-09 07:13:34,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:13:34,908 INFO L93 Difference]: Finished difference Result 234 states and 572 transitions. [2020-12-09 07:13:34,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 07:13:34,909 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2020-12-09 07:13:34,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:13:34,909 INFO L225 Difference]: With dead ends: 234 [2020-12-09 07:13:34,909 INFO L226 Difference]: Without dead ends: 92 [2020-12-09 07:13:34,910 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-12-09 07:13:34,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-12-09 07:13:34,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2020-12-09 07:13:34,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-12-09 07:13:34,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 198 transitions. [2020-12-09 07:13:34,912 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 198 transitions. Word has length 26 [2020-12-09 07:13:34,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:13:34,912 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 198 transitions. [2020-12-09 07:13:34,912 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 07:13:34,912 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 198 transitions. [2020-12-09 07:13:34,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-09 07:13:34,912 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:13:34,912 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, 1, 1] [2020-12-09 07:13:34,913 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-09 07:13:34,913 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:13:34,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:13:34,913 INFO L82 PathProgramCache]: Analyzing trace with hash -484054926, now seen corresponding path program 2 times [2020-12-09 07:13:34,913 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:13:34,913 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683350657] [2020-12-09 07:13:34,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:13:34,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:13:35,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:13:35,041 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683350657] [2020-12-09 07:13:35,041 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:13:35,041 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 07:13:35,042 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538688983] [2020-12-09 07:13:35,042 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 07:13:35,042 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:13:35,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 07:13:35,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-09 07:13:35,042 INFO L87 Difference]: Start difference. First operand 92 states and 198 transitions. Second operand 7 states. [2020-12-09 07:13:35,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:13:35,099 INFO L93 Difference]: Finished difference Result 118 states and 252 transitions. [2020-12-09 07:13:35,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 07:13:35,100 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2020-12-09 07:13:35,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:13:35,100 INFO L225 Difference]: With dead ends: 118 [2020-12-09 07:13:35,100 INFO L226 Difference]: Without dead ends: 64 [2020-12-09 07:13:35,101 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-09 07:13:35,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-12-09 07:13:35,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-12-09 07:13:35,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-12-09 07:13:35,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 122 transitions. [2020-12-09 07:13:35,103 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 122 transitions. Word has length 26 [2020-12-09 07:13:35,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:13:35,103 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 122 transitions. [2020-12-09 07:13:35,103 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 07:13:35,103 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 122 transitions. [2020-12-09 07:13:35,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-09 07:13:35,103 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:13:35,104 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, 1, 1] [2020-12-09 07:13:35,104 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-09 07:13:35,104 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:13:35,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:13:35,104 INFO L82 PathProgramCache]: Analyzing trace with hash -772400604, now seen corresponding path program 3 times [2020-12-09 07:13:35,104 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:13:35,105 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860217946] [2020-12-09 07:13:35,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:13:35,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 07:13:35,141 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 07:13:35,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 07:13:35,174 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 07:13:35,200 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-12-09 07:13:35,200 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-09 07:13:35,200 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-09 07:13:35,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 07:13:35 BasicIcfg [2020-12-09 07:13:35,266 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 07:13:35,266 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 07:13:35,266 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 07:13:35,266 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 07:13:35,267 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:13:15" (3/4) ... [2020-12-09 07:13:35,268 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-09 07:13:35,333 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_04fc13d7-ef17-4fe7-8ca3-02aa2b6e090c/bin/utaipan/witness.graphml [2020-12-09 07:13:35,333 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 07:13:35,333 INFO L168 Benchmark]: Toolchain (without parser) took 21990.00 ms. Allocated memory was 115.3 MB in the beginning and 243.3 MB in the end (delta: 127.9 MB). Free memory was 72.9 MB in the beginning and 143.3 MB in the end (delta: -70.5 MB). Peak memory consumption was 58.4 MB. Max. memory is 16.1 GB. [2020-12-09 07:13:35,334 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 115.3 MB. Free memory is still 90.6 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 07:13:35,334 INFO L168 Benchmark]: CACSL2BoogieTranslator took 369.37 ms. Allocated memory is still 115.3 MB. Free memory was 72.7 MB in the beginning and 65.4 MB in the end (delta: 7.3 MB). Peak memory consumption was 10.0 MB. Max. memory is 16.1 GB. [2020-12-09 07:13:35,334 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.78 ms. Allocated memory is still 115.3 MB. Free memory was 65.4 MB in the beginning and 62.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 07:13:35,334 INFO L168 Benchmark]: Boogie Preprocessor took 27.30 ms. Allocated memory is still 115.3 MB. Free memory was 62.8 MB in the beginning and 60.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 07:13:35,335 INFO L168 Benchmark]: RCFGBuilder took 1325.27 ms. Allocated memory was 115.3 MB in the beginning and 138.4 MB in the end (delta: 23.1 MB). Free memory was 60.2 MB in the beginning and 52.3 MB in the end (delta: 7.9 MB). Peak memory consumption was 32.4 MB. Max. memory is 16.1 GB. [2020-12-09 07:13:35,335 INFO L168 Benchmark]: TraceAbstraction took 20157.23 ms. Allocated memory was 138.4 MB in the beginning and 243.3 MB in the end (delta: 104.9 MB). Free memory was 51.2 MB in the beginning and 161.2 MB in the end (delta: -109.9 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 07:13:35,335 INFO L168 Benchmark]: Witness Printer took 66.72 ms. Allocated memory is still 243.3 MB. Free memory was 161.2 MB in the beginning and 143.3 MB in the end (delta: 17.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2020-12-09 07:13:35,336 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.12 ms. Allocated memory is still 115.3 MB. Free memory is still 90.6 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 369.37 ms. Allocated memory is still 115.3 MB. Free memory was 72.7 MB in the beginning and 65.4 MB in the end (delta: 7.3 MB). Peak memory consumption was 10.0 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 39.78 ms. Allocated memory is still 115.3 MB. Free memory was 65.4 MB in the beginning and 62.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 27.30 ms. Allocated memory is still 115.3 MB. Free memory was 62.8 MB in the beginning and 60.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1325.27 ms. Allocated memory was 115.3 MB in the beginning and 138.4 MB in the end (delta: 23.1 MB). Free memory was 60.2 MB in the beginning and 52.3 MB in the end (delta: 7.9 MB). Peak memory consumption was 32.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 20157.23 ms. Allocated memory was 138.4 MB in the beginning and 243.3 MB in the end (delta: 104.9 MB). Free memory was 51.2 MB in the beginning and 161.2 MB in the end (delta: -109.9 MB). There was no memory consumed. Max. memory is 16.1 GB. * Witness Printer took 66.72 ms. Allocated memory is still 243.3 MB. Free memory was 161.2 MB in the beginning and 143.3 MB in the end (delta: 17.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1770 VarBasedMoverChecksPositive, 90 VarBasedMoverChecksNegative, 30 SemBasedMoverChecksPositive, 60 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.1s, 214 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 16.7s, 128 PlacesBefore, 45 PlacesAfterwards, 117 TransitionsBefore, 33 TransitionsAfterwards, 2598 CoEnabledTransitionPairs, 8 FixpointIterations, 41 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 98 TotalNumberOfCompositions, 7778 MoverChecksTotal - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1165; [L847] FCALL, FORK 0 pthread_create(&t1165, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1166; [L849] FCALL, FORK 0 pthread_create(&t1166, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1167; [L851] FCALL, FORK 0 pthread_create(&t1167, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 0 pthread_t t1168; [L853] FCALL, FORK 0 pthread_create(&t1168, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L802] 4 z$w_buff1 = z$w_buff0 [L803] 4 z$w_buff0 = 2 [L804] 4 z$w_buff1_used = z$w_buff0_used [L805] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L807] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L812] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L815] 4 a = 1 [L818] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L767] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, 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=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, 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=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, 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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L785] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, 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=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L824] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L825] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L826] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L827] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L828] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L788] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L788] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L789] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L789] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L790] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L791] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L791] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L792] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L792] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L795] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 3 return 0; [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L859] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L859] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L861] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L862] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L863] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 z$flush_delayed = weak$$choice2 [L869] 0 z$mem_tmp = z [L870] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L870] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L871] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L871] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L872] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L872] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L873] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L873] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L874] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L875] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L876] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L878] 0 z = z$flush_delayed ? z$mem_tmp : z [L879] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, 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, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 116 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 19.9s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 16.8s, HoareTripleCheckerStatistics: 506 SDtfs, 593 SDslu, 766 SDs, 0 SdLazy, 300 SolverSat, 96 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3002occurred 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.6s AutomataMinimizationTime, 15 MinimizatonAttempts, 523 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 289 NumberOfCodeBlocks, 289 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 248 ConstructedInterpolants, 0 QuantifiedInterpolants, 25145 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...