./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix030_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_597a5b47-d9cb-41b2-a30e-394ac4a85cba/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_597a5b47-d9cb-41b2-a30e-394ac4a85cba/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_597a5b47-d9cb-41b2-a30e-394ac4a85cba/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_597a5b47-d9cb-41b2-a30e-394ac4a85cba/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix030_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_597a5b47-d9cb-41b2-a30e-394ac4a85cba/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_597a5b47-d9cb-41b2-a30e-394ac4a85cba/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 855541b1b2c5e45654311eb60bec5b0bdcbd410c .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 06:48:43,782 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 06:48:43,784 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 06:48:43,814 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 06:48:43,815 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 06:48:43,816 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 06:48:43,818 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 06:48:43,820 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 06:48:43,822 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 06:48:43,823 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 06:48:43,824 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 06:48:43,826 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 06:48:43,826 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 06:48:43,827 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 06:48:43,829 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 06:48:43,830 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 06:48:43,831 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 06:48:43,832 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 06:48:43,834 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 06:48:43,836 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 06:48:43,838 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 06:48:43,840 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 06:48:43,841 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 06:48:43,842 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 06:48:43,845 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 06:48:43,845 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 06:48:43,846 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 06:48:43,847 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 06:48:43,847 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 06:48:43,849 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 06:48:43,849 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 06:48:43,850 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 06:48:43,851 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 06:48:43,851 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 06:48:43,852 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 06:48:43,852 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 06:48:43,853 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 06:48:43,853 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 06:48:43,853 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 06:48:43,854 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 06:48:43,854 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 06:48:43,855 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_597a5b47-d9cb-41b2-a30e-394ac4a85cba/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-09 06:48:43,879 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 06:48:43,879 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 06:48:43,880 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 06:48:43,880 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 06:48:43,880 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 06:48:43,888 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 06:48:43,888 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 06:48:43,888 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 06:48:43,888 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 06:48:43,889 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 06:48:43,889 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 06:48:43,889 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 06:48:43,889 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 06:48:43,889 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 06:48:43,890 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 06:48:43,890 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 06:48:43,890 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 06:48:43,891 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 06:48:43,891 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 06:48:43,891 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 06:48:43,891 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 06:48:43,891 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 06:48:43,891 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 06:48:43,892 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 06:48:43,892 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 06:48:43,892 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 06:48:43,892 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 06:48:43,892 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 06:48:43,893 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 06:48:43,893 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 06:48:43,893 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 06:48:43,893 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 06:48:43,893 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 06:48:43,893 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 06:48:43,894 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 06:48:43,894 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 06:48:43,894 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 06:48:43,894 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 06:48:43,894 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 06:48:43,894 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_597a5b47-d9cb-41b2-a30e-394ac4a85cba/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_597a5b47-d9cb-41b2-a30e-394ac4a85cba/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 -> 855541b1b2c5e45654311eb60bec5b0bdcbd410c [2020-12-09 06:48:44,073 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 06:48:44,092 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 06:48:44,094 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 06:48:44,096 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 06:48:44,096 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 06:48:44,097 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_597a5b47-d9cb-41b2-a30e-394ac4a85cba/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix030_power.opt.i [2020-12-09 06:48:44,138 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_597a5b47-d9cb-41b2-a30e-394ac4a85cba/bin/utaipan/data/96c446a3b/1b9b1dcd2a8d4c99ba798a2374f3853c/FLAG50d4d6b62 [2020-12-09 06:48:44,567 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 06:48:44,567 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_597a5b47-d9cb-41b2-a30e-394ac4a85cba/sv-benchmarks/c/pthread-wmm/mix030_power.opt.i [2020-12-09 06:48:44,585 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_597a5b47-d9cb-41b2-a30e-394ac4a85cba/bin/utaipan/data/96c446a3b/1b9b1dcd2a8d4c99ba798a2374f3853c/FLAG50d4d6b62 [2020-12-09 06:48:44,594 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_597a5b47-d9cb-41b2-a30e-394ac4a85cba/bin/utaipan/data/96c446a3b/1b9b1dcd2a8d4c99ba798a2374f3853c [2020-12-09 06:48:44,596 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 06:48:44,597 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 06:48:44,598 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 06:48:44,598 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 06:48:44,600 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 06:48:44,600 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:48:44" (1/1) ... [2020-12-09 06:48:44,602 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cce5804 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:48:44, skipping insertion in model container [2020-12-09 06:48:44,602 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:48:44" (1/1) ... [2020-12-09 06:48:44,606 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 06:48:44,634 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 06:48:44,738 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_597a5b47-d9cb-41b2-a30e-394ac4a85cba/sv-benchmarks/c/pthread-wmm/mix030_power.opt.i[950,963] [2020-12-09 06:48:44,848 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 06:48:44,855 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 06:48:44,864 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_597a5b47-d9cb-41b2-a30e-394ac4a85cba/sv-benchmarks/c/pthread-wmm/mix030_power.opt.i[950,963] [2020-12-09 06:48:44,903 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 06:48:44,965 INFO L208 MainTranslator]: Completed translation [2020-12-09 06:48:44,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:48:44 WrapperNode [2020-12-09 06:48:44,966 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 06:48:44,966 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 06:48:44,966 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 06:48:44,966 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 06:48:44,973 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:48:44" (1/1) ... [2020-12-09 06:48:44,990 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:48:44" (1/1) ... [2020-12-09 06:48:45,018 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 06:48:45,019 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 06:48:45,019 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 06:48:45,019 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 06:48:45,027 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:48:44" (1/1) ... [2020-12-09 06:48:45,027 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:48:44" (1/1) ... [2020-12-09 06:48:45,031 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:48:44" (1/1) ... [2020-12-09 06:48:45,031 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:48:44" (1/1) ... [2020-12-09 06:48:45,039 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:48:44" (1/1) ... [2020-12-09 06:48:45,042 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:48:44" (1/1) ... [2020-12-09 06:48:45,045 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:48:44" (1/1) ... [2020-12-09 06:48:45,049 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 06:48:45,049 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 06:48:45,050 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 06:48:45,050 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 06:48:45,051 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:48:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_597a5b47-d9cb-41b2-a30e-394ac4a85cba/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 06:48:45,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-09 06:48:45,109 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-12-09 06:48:45,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 06:48:45,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-09 06:48:45,110 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-12-09 06:48:45,110 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-12-09 06:48:45,110 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-12-09 06:48:45,110 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-12-09 06:48:45,110 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-12-09 06:48:45,110 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-12-09 06:48:45,110 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-12-09 06:48:45,110 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-12-09 06:48:45,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 06:48:45,111 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-12-09 06:48:45,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 06:48:45,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 06:48:45,112 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 06:48:46,494 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 06:48:46,494 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2020-12-09 06:48:46,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:48:46 BoogieIcfgContainer [2020-12-09 06:48:46,497 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 06:48:46,498 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 06:48:46,498 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 06:48:46,501 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 06:48:46,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 06:48:44" (1/3) ... [2020-12-09 06:48:46,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12270ee5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 06:48:46, skipping insertion in model container [2020-12-09 06:48:46,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:48:44" (2/3) ... [2020-12-09 06:48:46,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12270ee5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 06:48:46, skipping insertion in model container [2020-12-09 06:48:46,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:48:46" (3/3) ... [2020-12-09 06:48:46,504 INFO L111 eAbstractionObserver]: Analyzing ICFG mix030_power.opt.i [2020-12-09 06:48:46,518 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-09 06:48:46,518 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 06:48:46,521 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-09 06:48:46,522 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-09 06:48:46,557 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,557 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,557 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,557 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,557 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,557 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,557 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,558 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,558 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,558 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,558 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,558 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,558 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,558 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,558 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,558 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,559 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,559 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,559 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,559 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,559 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,559 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,559 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,559 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,559 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,559 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,559 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,560 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,560 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,560 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,560 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,560 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,560 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,560 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,561 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,561 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,561 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,561 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,561 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,561 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,561 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,562 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,562 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,562 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,562 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,562 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,562 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,562 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,562 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,562 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,562 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,563 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,563 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,563 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,563 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,563 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,563 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,563 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,563 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,563 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,563 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,564 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,564 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,564 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,564 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,564 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,564 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,564 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,565 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,565 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,565 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,565 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,565 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,565 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,565 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,565 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,566 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,566 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,566 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,566 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,566 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,566 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,566 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,566 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,566 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,566 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,566 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,567 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,567 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,567 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,567 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,567 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,567 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,567 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,568 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,568 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,568 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,568 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,570 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,570 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,570 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,570 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,570 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,570 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,570 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,570 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,570 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,571 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,571 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,571 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,572 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,572 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,572 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,573 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,573 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,573 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,573 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,573 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,573 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,573 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,574 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,574 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,574 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,574 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,575 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,576 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,576 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,576 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,576 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,576 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,576 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,576 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,576 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,576 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 06:48:46,577 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-12-09 06:48:46,584 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-12-09 06:48:46,598 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 06:48:46,598 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 06:48:46,598 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 06:48:46,598 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 06:48:46,598 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 06:48:46,598 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 06:48:46,598 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 06:48:46,598 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 06:48:46,607 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-12-09 06:48:46,609 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 115 transitions, 250 flow [2020-12-09 06:48:46,611 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 115 transitions, 250 flow [2020-12-09 06:48:46,612 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 126 places, 115 transitions, 250 flow [2020-12-09 06:48:46,660 INFO L129 PetriNetUnfolder]: 2/111 cut-off events. [2020-12-09 06:48:46,660 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-12-09 06:48:46,663 INFO L84 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 84 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2020-12-09 06:48:46,666 INFO L116 LiptonReduction]: Number of co-enabled transitions 2630 [2020-12-09 06:48:46,806 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 06:48:46,807 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:46,808 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 06:48:46,808 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:46,811 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-12-09 06:48:46,812 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 06:48:46,817 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-12-09 06:48:46,817 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:46,885 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:48:46,885 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:48:46,888 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-12-09 06:48:46,888 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:46,890 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-12-09 06:48:46,890 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:46,895 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 06:48:46,895 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 06:48:46,899 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 06:48:46,899 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 06:48:46,902 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 06:48:46,903 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 06:48:46,905 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-12-09 06:48:46,905 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:46,907 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 06:48:46,907 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:46,908 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-12-09 06:48:46,908 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:46,976 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 06:48:46,976 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:46,977 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 06:48:46,977 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:47,030 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 06:48:47,030 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:47,031 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 06:48:47,031 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:47,065 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 06:48:47,066 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:47,066 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 06:48:47,067 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:47,097 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 06:48:47,097 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:47,098 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 06:48:47,098 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:47,162 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 06:48:47,162 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:47,163 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 06:48:47,163 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:47,188 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 2, 1] term [2020-12-09 06:48:47,189 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:48:47,189 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 1] term [2020-12-09 06:48:47,189 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:48:47,223 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:48:47,224 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:48:47,232 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-12-09 06:48:47,232 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:47,233 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-12-09 06:48:47,233 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:47,235 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 06:48:47,235 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 06:48:47,236 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 06:48:47,236 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 06:48:47,237 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 06:48:47,237 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 06:48:47,239 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 06:48:47,239 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:47,246 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 06:48:47,247 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:47,249 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 06:48:47,249 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:47,294 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 06:48:47,294 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:47,295 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 06:48:47,295 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:47,297 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-12-09 06:48:47,297 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 06:48:47,299 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-12-09 06:48:47,299 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:47,519 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 06:48:47,519 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:47,519 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 06:48:47,520 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:47,541 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 06:48:47,542 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:47,542 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 06:48:47,542 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:47,588 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:48:47,589 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:48:47,590 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-12-09 06:48:47,590 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:47,591 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-12-09 06:48:47,591 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:47,592 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 06:48:47,593 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 06:48:47,594 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 06:48:47,594 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 06:48:47,595 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 06:48:47,595 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 06:48:47,596 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 06:48:47,597 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:47,597 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 06:48:47,598 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:47,598 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 06:48:47,599 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:47,637 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 06:48:47,637 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:47,637 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 06:48:47,637 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:47,639 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-12-09 06:48:47,639 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 06:48:47,641 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-12-09 06:48:47,641 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:48,044 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 06:48:48,045 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:48,045 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 06:48:48,045 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:48,063 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 06:48:48,064 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:48,064 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 06:48:48,064 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:48,097 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 06:48:48,097 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:48,097 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 06:48:48,098 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:48,119 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 06:48:48,119 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:48,120 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 06:48:48,120 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:48,251 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 06:48:48,252 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:48:48,252 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-09 06:48:48,252 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:48:48,281 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 06:48:48,281 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:48,282 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 06:48:48,282 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:48,355 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 06:48:48,355 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:48:48,356 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-09 06:48:48,356 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:48:48,372 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 06:48:48,372 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:48,373 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 06:48:48,373 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:48,406 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:48:48,406 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:48:48,407 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-12-09 06:48:48,407 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:48,408 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-12-09 06:48:48,408 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:48,409 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 06:48:48,410 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 06:48:48,411 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 06:48:48,411 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 06:48:48,412 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 06:48:48,412 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 06:48:48,413 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-12-09 06:48:48,413 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:48,415 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 06:48:48,415 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:48,416 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-12-09 06:48:48,416 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:48,450 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 06:48:48,450 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:48,451 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 06:48:48,452 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:48,454 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-12-09 06:48:48,454 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 06:48:48,457 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-12-09 06:48:48,457 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:48,512 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 06:48:48,512 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:48,513 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 06:48:48,513 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:48,555 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 4, 4, 3, 2, 1] term [2020-12-09 06:48:48,556 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:48,556 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 2, 1] term [2020-12-09 06:48:48,556 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:48,557 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 4, 4, 3, 2, 1] term [2020-12-09 06:48:48,557 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:48,561 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 06:48:48,561 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:48,562 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 06:48:48,562 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:48,898 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 06:48:48,898 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:48,899 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 06:48:48,899 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:48,900 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-12-09 06:48:48,900 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 06:48:48,902 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-12-09 06:48:48,902 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:48,934 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:48:48,934 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:48:48,935 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-12-09 06:48:48,935 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:48,936 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-12-09 06:48:48,936 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:48,937 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 06:48:48,938 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 06:48:48,939 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 06:48:48,939 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 06:48:48,940 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 06:48:48,940 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 06:48:48,941 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-12-09 06:48:48,941 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:48,942 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 06:48:48,942 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:48,943 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-12-09 06:48:48,943 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:49,079 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 06:48:49,079 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:49,080 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 06:48:49,080 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:49,099 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 06:48:49,099 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:49,100 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 06:48:49,100 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:49,224 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 06:48:49,224 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:49,225 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 06:48:49,225 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:49,241 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 06:48:49,241 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:49,242 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 06:48:49,242 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:49,265 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 2, 1] term [2020-12-09 06:48:49,265 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:48:49,266 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 1] term [2020-12-09 06:48:49,266 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:48:49,282 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 06:48:49,283 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:49,283 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 06:48:49,283 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:49,548 WARN L197 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-12-09 06:48:49,925 WARN L197 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 86 [2020-12-09 06:48:50,047 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-12-09 06:48:50,111 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 06:48:50,111 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:50,112 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 06:48:50,112 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:50,114 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-12-09 06:48:50,114 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 06:48:50,116 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-12-09 06:48:50,117 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:50,161 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:48:50,162 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:48:50,163 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-12-09 06:48:50,163 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:50,164 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-12-09 06:48:50,164 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:50,166 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 06:48:50,167 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 06:48:50,167 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 06:48:50,168 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 06:48:50,176 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 06:48:50,176 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 06:48:50,178 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-12-09 06:48:50,178 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:50,179 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 06:48:50,179 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:50,180 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-12-09 06:48:50,180 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:50,528 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 06:48:50,528 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:50,528 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 06:48:50,528 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:50,546 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 06:48:50,547 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:50,547 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 06:48:50,547 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:51,330 WARN L197 SmtUtils]: Spent 769.00 ms on a formula simplification. DAG size of input: 232 DAG size of output: 192 [2020-12-09 06:48:51,645 WARN L197 SmtUtils]: Spent 313.00 ms on a formula simplification that was a NOOP. DAG size: 190 [2020-12-09 06:48:53,176 WARN L197 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 316 DAG size of output: 272 [2020-12-09 06:48:53,894 WARN L197 SmtUtils]: Spent 717.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2020-12-09 06:48:53,931 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:48:53,931 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:48:53,932 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:48:53,932 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:48:53,933 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:48:53,933 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 06:48:53,934 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 06:48:53,934 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 06:48:53,944 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:48:53,944 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:48:53,945 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:48:53,945 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:48:53,945 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:48:53,946 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:53,946 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 06:48:53,947 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:54,145 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 06:48:54,146 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:54,146 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 06:48:54,146 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:54,172 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 06:48:54,172 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:54,172 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 06:48:54,172 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:54,190 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 06:48:54,190 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:54,190 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 06:48:54,190 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:54,207 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 06:48:54,208 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:54,208 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 06:48:54,208 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:54,359 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:48:54,359 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:48:54,359 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:48:54,360 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:48:54,360 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:48:54,360 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:54,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 06:48:54,361 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:54,372 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:48:54,372 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:48:54,373 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:48:54,373 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:48:54,373 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:48:54,374 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 06:48:54,374 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 06:48:54,375 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 06:48:54,394 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 06:48:54,394 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:54,394 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 06:48:54,395 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:54,410 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 06:48:54,411 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:54,411 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 06:48:54,411 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:54,426 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 06:48:54,427 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:54,427 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 06:48:54,427 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:54,442 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 06:48:54,443 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:54,443 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 06:48:54,443 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:54,459 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:48:54,459 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:48:54,460 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:48:54,460 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:48:54,461 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:48:54,461 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 06:48:54,462 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 06:48:54,462 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 06:48:54,472 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:48:54,472 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:48:54,472 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:48:54,473 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:48:54,473 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:48:54,473 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:54,474 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 06:48:54,474 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:54,494 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-09 06:48:54,495 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:54,495 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-09 06:48:54,495 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:54,510 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 06:48:54,510 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:54,510 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 06:48:54,510 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:54,540 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:48:54,540 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:48:54,540 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:48:54,541 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:48:54,541 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:48:54,541 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:54,542 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 06:48:54,542 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:54,553 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:48:54,554 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:48:54,554 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:48:54,554 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:48:54,555 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:48:54,555 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 06:48:54,556 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 06:48:54,556 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 06:48:54,573 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 06:48:54,573 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:54,574 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 06:48:54,574 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:54,600 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-09 06:48:54,600 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:54,601 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-09 06:48:54,601 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:54,616 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:48:54,616 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:48:54,616 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:48:54,617 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:48:54,617 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:48:54,617 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:54,618 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 06:48:54,618 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:54,628 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:48:54,628 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:48:54,629 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:48:54,629 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:48:54,630 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:48:54,630 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 06:48:54,631 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 06:48:54,631 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 06:48:54,646 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:48:54,646 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:48:54,646 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:48:54,646 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:48:54,647 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:48:54,647 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 06:48:54,648 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 06:48:54,648 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 06:48:54,658 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:48:54,659 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:48:54,659 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:48:54,659 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:48:54,660 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:48:54,660 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:54,661 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 06:48:54,661 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:48:55,565 WARN L197 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2020-12-09 06:48:55,715 WARN L197 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2020-12-09 06:48:56,018 WARN L197 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2020-12-09 06:48:56,172 WARN L197 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2020-12-09 06:48:56,177 INFO L131 LiptonReduction]: Checked pairs total: 7514 [2020-12-09 06:48:56,177 INFO L133 LiptonReduction]: Total number of compositions: 92 [2020-12-09 06:48:56,181 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 47 places, 35 transitions, 90 flow [2020-12-09 06:48:56,369 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 4610 states. [2020-12-09 06:48:56,370 INFO L276 IsEmpty]: Start isEmpty. Operand 4610 states. [2020-12-09 06:48:56,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-12-09 06:48:56,374 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:48:56,374 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:48:56,375 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:48:56,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:48:56,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1586218110, now seen corresponding path program 1 times [2020-12-09 06:48:56,385 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:48:56,385 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264203621] [2020-12-09 06:48:56,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:48:56,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:48:56,545 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 06:48:56,545 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264203621] [2020-12-09 06:48:56,546 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:48:56,546 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-09 06:48:56,546 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233015358] [2020-12-09 06:48:56,549 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 06:48:56,549 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:48:56,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 06:48:56,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 06:48:56,560 INFO L87 Difference]: Start difference. First operand 4610 states. Second operand 3 states. [2020-12-09 06:48:56,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:48:56,663 INFO L93 Difference]: Finished difference Result 3850 states and 15248 transitions. [2020-12-09 06:48:56,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 06:48:56,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-12-09 06:48:56,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:48:56,699 INFO L225 Difference]: With dead ends: 3850 [2020-12-09 06:48:56,699 INFO L226 Difference]: Without dead ends: 3250 [2020-12-09 06:48:56,700 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 06:48:56,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3250 states. [2020-12-09 06:48:56,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3250 to 3250. [2020-12-09 06:48:56,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3250 states. [2020-12-09 06:48:56,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3250 states to 3250 states and 12738 transitions. [2020-12-09 06:48:56,878 INFO L78 Accepts]: Start accepts. Automaton has 3250 states and 12738 transitions. Word has length 7 [2020-12-09 06:48:56,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:48:56,879 INFO L481 AbstractCegarLoop]: Abstraction has 3250 states and 12738 transitions. [2020-12-09 06:48:56,879 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 06:48:56,879 INFO L276 IsEmpty]: Start isEmpty. Operand 3250 states and 12738 transitions. [2020-12-09 06:48:56,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-09 06:48:56,883 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:48:56,883 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:48:56,883 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 06:48:56,883 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:48:56,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:48:56,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1100600579, now seen corresponding path program 1 times [2020-12-09 06:48:56,884 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:48:56,884 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536071255] [2020-12-09 06:48:56,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:48:56,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:48:57,030 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 06:48:57,030 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536071255] [2020-12-09 06:48:57,030 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:48:57,031 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 06:48:57,031 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897165814] [2020-12-09 06:48:57,031 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 06:48:57,032 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:48:57,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 06:48:57,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 06:48:57,032 INFO L87 Difference]: Start difference. First operand 3250 states and 12738 transitions. Second operand 4 states. [2020-12-09 06:48:57,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:48:57,103 INFO L93 Difference]: Finished difference Result 3450 states and 13108 transitions. [2020-12-09 06:48:57,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 06:48:57,103 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-12-09 06:48:57,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:48:57,131 INFO L225 Difference]: With dead ends: 3450 [2020-12-09 06:48:57,131 INFO L226 Difference]: Without dead ends: 2850 [2020-12-09 06:48:57,132 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 06:48:57,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2850 states. [2020-12-09 06:48:57,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2850 to 2850. [2020-12-09 06:48:57,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2850 states. [2020-12-09 06:48:57,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2850 states to 2850 states and 10998 transitions. [2020-12-09 06:48:57,231 INFO L78 Accepts]: Start accepts. Automaton has 2850 states and 10998 transitions. Word has length 12 [2020-12-09 06:48:57,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:48:57,231 INFO L481 AbstractCegarLoop]: Abstraction has 2850 states and 10998 transitions. [2020-12-09 06:48:57,231 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 06:48:57,231 INFO L276 IsEmpty]: Start isEmpty. Operand 2850 states and 10998 transitions. [2020-12-09 06:48:57,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-09 06:48:57,234 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:48:57,234 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:48:57,234 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-09 06:48:57,235 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:48:57,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:48:57,235 INFO L82 PathProgramCache]: Analyzing trace with hash 2056863090, now seen corresponding path program 1 times [2020-12-09 06:48:57,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:48:57,235 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308585240] [2020-12-09 06:48:57,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:48:57,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:48:57,299 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 06:48:57,299 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308585240] [2020-12-09 06:48:57,299 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:48:57,299 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 06:48:57,299 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376327944] [2020-12-09 06:48:57,300 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 06:48:57,300 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:48:57,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 06:48:57,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 06:48:57,300 INFO L87 Difference]: Start difference. First operand 2850 states and 10998 transitions. Second operand 4 states. [2020-12-09 06:48:57,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:48:57,346 INFO L93 Difference]: Finished difference Result 3170 states and 11914 transitions. [2020-12-09 06:48:57,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 06:48:57,347 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-12-09 06:48:57,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:48:57,374 INFO L225 Difference]: With dead ends: 3170 [2020-12-09 06:48:57,374 INFO L226 Difference]: Without dead ends: 2770 [2020-12-09 06:48:57,374 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 06:48:57,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2770 states. [2020-12-09 06:48:57,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2770 to 2770. [2020-12-09 06:48:57,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2770 states. [2020-12-09 06:48:57,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2770 states to 2770 states and 10634 transitions. [2020-12-09 06:48:57,454 INFO L78 Accepts]: Start accepts. Automaton has 2770 states and 10634 transitions. Word has length 14 [2020-12-09 06:48:57,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:48:57,454 INFO L481 AbstractCegarLoop]: Abstraction has 2770 states and 10634 transitions. [2020-12-09 06:48:57,454 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 06:48:57,454 INFO L276 IsEmpty]: Start isEmpty. Operand 2770 states and 10634 transitions. [2020-12-09 06:48:57,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-09 06:48:57,456 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:48:57,457 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:48:57,457 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-09 06:48:57,457 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:48:57,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:48:57,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1550792981, now seen corresponding path program 1 times [2020-12-09 06:48:57,457 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:48:57,457 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720302123] [2020-12-09 06:48:57,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:48:57,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:48:57,554 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 06:48:57,554 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720302123] [2020-12-09 06:48:57,554 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:48:57,554 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 06:48:57,554 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635857503] [2020-12-09 06:48:57,554 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 06:48:57,554 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:48:57,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 06:48:57,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 06:48:57,555 INFO L87 Difference]: Start difference. First operand 2770 states and 10634 transitions. Second operand 5 states. [2020-12-09 06:48:57,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:48:57,674 INFO L93 Difference]: Finished difference Result 3122 states and 11700 transitions. [2020-12-09 06:48:57,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 06:48:57,675 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-12-09 06:48:57,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:48:57,694 INFO L225 Difference]: With dead ends: 3122 [2020-12-09 06:48:57,694 INFO L226 Difference]: Without dead ends: 2762 [2020-12-09 06:48:57,695 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-12-09 06:48:57,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2762 states. [2020-12-09 06:48:57,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2762 to 2762. [2020-12-09 06:48:57,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2762 states. [2020-12-09 06:48:57,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2762 states to 2762 states and 10582 transitions. [2020-12-09 06:48:57,763 INFO L78 Accepts]: Start accepts. Automaton has 2762 states and 10582 transitions. Word has length 15 [2020-12-09 06:48:57,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:48:57,763 INFO L481 AbstractCegarLoop]: Abstraction has 2762 states and 10582 transitions. [2020-12-09 06:48:57,763 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 06:48:57,763 INFO L276 IsEmpty]: Start isEmpty. Operand 2762 states and 10582 transitions. [2020-12-09 06:48:57,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 06:48:57,766 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:48:57,766 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:48:57,766 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-09 06:48:57,766 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:48:57,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:48:57,767 INFO L82 PathProgramCache]: Analyzing trace with hash -852350186, now seen corresponding path program 1 times [2020-12-09 06:48:57,767 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:48:57,767 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642324638] [2020-12-09 06:48:57,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:48:57,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:48:57,860 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 06:48:57,860 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642324638] [2020-12-09 06:48:57,860 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:48:57,860 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 06:48:57,860 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944743456] [2020-12-09 06:48:57,861 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 06:48:57,861 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:48:57,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 06:48:57,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 06:48:57,862 INFO L87 Difference]: Start difference. First operand 2762 states and 10582 transitions. Second operand 5 states. [2020-12-09 06:48:57,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:48:57,961 INFO L93 Difference]: Finished difference Result 3002 states and 11194 transitions. [2020-12-09 06:48:57,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 06:48:57,962 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-12-09 06:48:57,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:48:57,983 INFO L225 Difference]: With dead ends: 3002 [2020-12-09 06:48:57,983 INFO L226 Difference]: Without dead ends: 2666 [2020-12-09 06:48:57,983 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-09 06:48:57,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2666 states. [2020-12-09 06:48:58,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2666 to 2650. [2020-12-09 06:48:58,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2650 states. [2020-12-09 06:48:58,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2650 states to 2650 states and 10070 transitions. [2020-12-09 06:48:58,044 INFO L78 Accepts]: Start accepts. Automaton has 2650 states and 10070 transitions. Word has length 16 [2020-12-09 06:48:58,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:48:58,044 INFO L481 AbstractCegarLoop]: Abstraction has 2650 states and 10070 transitions. [2020-12-09 06:48:58,044 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 06:48:58,044 INFO L276 IsEmpty]: Start isEmpty. Operand 2650 states and 10070 transitions. [2020-12-09 06:48:58,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-09 06:48:58,047 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:48:58,047 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 06:48:58,047 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-09 06:48:58,048 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:48:58,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:48:58,048 INFO L82 PathProgramCache]: Analyzing trace with hash -6951252, now seen corresponding path program 1 times [2020-12-09 06:48:58,048 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:48:58,048 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934114153] [2020-12-09 06:48:58,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:48:58,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:48:58,286 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 06:48:58,286 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934114153] [2020-12-09 06:48:58,286 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:48:58,286 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 06:48:58,286 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252606105] [2020-12-09 06:48:58,286 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 06:48:58,287 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:48:58,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 06:48:58,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-09 06:48:58,287 INFO L87 Difference]: Start difference. First operand 2650 states and 10070 transitions. Second operand 7 states. [2020-12-09 06:48:58,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:48:58,434 INFO L93 Difference]: Finished difference Result 2818 states and 10520 transitions. [2020-12-09 06:48:58,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 06:48:58,435 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-12-09 06:48:58,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:48:58,449 INFO L225 Difference]: With dead ends: 2818 [2020-12-09 06:48:58,449 INFO L226 Difference]: Without dead ends: 2618 [2020-12-09 06:48:58,449 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-09 06:48:58,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2618 states. [2020-12-09 06:48:58,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2618 to 2618. [2020-12-09 06:48:58,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2618 states. [2020-12-09 06:48:58,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2618 states to 2618 states and 9910 transitions. [2020-12-09 06:48:58,529 INFO L78 Accepts]: Start accepts. Automaton has 2618 states and 9910 transitions. Word has length 17 [2020-12-09 06:48:58,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:48:58,529 INFO L481 AbstractCegarLoop]: Abstraction has 2618 states and 9910 transitions. [2020-12-09 06:48:58,529 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 06:48:58,529 INFO L276 IsEmpty]: Start isEmpty. Operand 2618 states and 9910 transitions. [2020-12-09 06:48:58,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-09 06:48:58,533 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:48:58,533 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 06:48:58,533 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-09 06:48:58,533 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:48:58,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:48:58,533 INFO L82 PathProgramCache]: Analyzing trace with hash -35820278, now seen corresponding path program 1 times [2020-12-09 06:48:58,533 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:48:58,534 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468479093] [2020-12-09 06:48:58,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:48:58,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:48:58,646 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 06:48:58,646 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468479093] [2020-12-09 06:48:58,646 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:48:58,646 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 06:48:58,647 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307542800] [2020-12-09 06:48:58,647 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 06:48:58,647 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:48:58,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 06:48:58,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-09 06:48:58,647 INFO L87 Difference]: Start difference. First operand 2618 states and 9910 transitions. Second operand 6 states. [2020-12-09 06:48:58,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:48:58,741 INFO L93 Difference]: Finished difference Result 2726 states and 10162 transitions. [2020-12-09 06:48:58,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 06:48:58,741 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-12-09 06:48:58,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:48:58,748 INFO L225 Difference]: With dead ends: 2726 [2020-12-09 06:48:58,749 INFO L226 Difference]: Without dead ends: 2546 [2020-12-09 06:48:58,749 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-12-09 06:48:58,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2546 states. [2020-12-09 06:48:58,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2546 to 2546. [2020-12-09 06:48:58,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2546 states. [2020-12-09 06:48:58,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2546 states to 2546 states and 9646 transitions. [2020-12-09 06:48:58,796 INFO L78 Accepts]: Start accepts. Automaton has 2546 states and 9646 transitions. Word has length 17 [2020-12-09 06:48:58,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:48:58,797 INFO L481 AbstractCegarLoop]: Abstraction has 2546 states and 9646 transitions. [2020-12-09 06:48:58,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 06:48:58,797 INFO L276 IsEmpty]: Start isEmpty. Operand 2546 states and 9646 transitions. [2020-12-09 06:48:58,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-09 06:48:58,800 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:48:58,800 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:48:58,800 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-09 06:48:58,800 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:48:58,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:48:58,801 INFO L82 PathProgramCache]: Analyzing trace with hash -448947241, now seen corresponding path program 1 times [2020-12-09 06:48:58,801 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:48:58,801 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987199750] [2020-12-09 06:48:58,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:48:58,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:48:58,850 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 06:48:58,850 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987199750] [2020-12-09 06:48:58,850 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:48:58,850 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 06:48:58,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140534450] [2020-12-09 06:48:58,850 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 06:48:58,850 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:48:58,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 06:48:58,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 06:48:58,851 INFO L87 Difference]: Start difference. First operand 2546 states and 9646 transitions. Second operand 4 states. [2020-12-09 06:48:58,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:48:58,885 INFO L93 Difference]: Finished difference Result 2542 states and 8776 transitions. [2020-12-09 06:48:58,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 06:48:58,885 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-12-09 06:48:58,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:48:58,890 INFO L225 Difference]: With dead ends: 2542 [2020-12-09 06:48:58,890 INFO L226 Difference]: Without dead ends: 1942 [2020-12-09 06:48:58,890 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 06:48:58,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1942 states. [2020-12-09 06:48:58,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1942 to 1942. [2020-12-09 06:48:58,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1942 states. [2020-12-09 06:48:58,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1942 states and 6626 transitions. [2020-12-09 06:48:58,935 INFO L78 Accepts]: Start accepts. Automaton has 1942 states and 6626 transitions. Word has length 18 [2020-12-09 06:48:58,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:48:58,936 INFO L481 AbstractCegarLoop]: Abstraction has 1942 states and 6626 transitions. [2020-12-09 06:48:58,936 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 06:48:58,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 6626 transitions. [2020-12-09 06:48:58,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-09 06:48:58,939 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:48:58,939 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 06:48:58,939 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-09 06:48:58,939 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:48:58,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:48:58,939 INFO L82 PathProgramCache]: Analyzing trace with hash 574173915, now seen corresponding path program 1 times [2020-12-09 06:48:58,939 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:48:58,939 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147446220] [2020-12-09 06:48:58,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:48:58,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:48:58,990 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 06:48:58,990 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147446220] [2020-12-09 06:48:58,990 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:48:58,990 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 06:48:58,990 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480196292] [2020-12-09 06:48:58,990 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 06:48:58,990 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:48:58,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 06:48:58,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 06:48:58,991 INFO L87 Difference]: Start difference. First operand 1942 states and 6626 transitions. Second operand 5 states. [2020-12-09 06:48:59,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:48:59,040 INFO L93 Difference]: Finished difference Result 1584 states and 4952 transitions. [2020-12-09 06:48:59,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 06:48:59,041 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-12-09 06:48:59,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:48:59,045 INFO L225 Difference]: With dead ends: 1584 [2020-12-09 06:48:59,045 INFO L226 Difference]: Without dead ends: 1224 [2020-12-09 06:48:59,045 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 06:48:59,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2020-12-09 06:48:59,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 1224. [2020-12-09 06:48:59,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1224 states. [2020-12-09 06:48:59,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 3754 transitions. [2020-12-09 06:48:59,072 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 3754 transitions. Word has length 19 [2020-12-09 06:48:59,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:48:59,072 INFO L481 AbstractCegarLoop]: Abstraction has 1224 states and 3754 transitions. [2020-12-09 06:48:59,072 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 06:48:59,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 3754 transitions. [2020-12-09 06:48:59,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-09 06:48:59,075 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:48:59,075 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] [2020-12-09 06:48:59,075 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-09 06:48:59,075 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:48:59,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:48:59,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1384629662, now seen corresponding path program 1 times [2020-12-09 06:48:59,076 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:48:59,076 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840059818] [2020-12-09 06:48:59,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:48:59,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:48:59,128 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 06:48:59,128 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840059818] [2020-12-09 06:48:59,128 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:48:59,128 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 06:48:59,128 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635134206] [2020-12-09 06:48:59,128 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 06:48:59,129 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:48:59,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 06:48:59,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 06:48:59,129 INFO L87 Difference]: Start difference. First operand 1224 states and 3754 transitions. Second operand 4 states. [2020-12-09 06:48:59,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:48:59,156 INFO L93 Difference]: Finished difference Result 1817 states and 5368 transitions. [2020-12-09 06:48:59,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 06:48:59,156 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2020-12-09 06:48:59,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:48:59,159 INFO L225 Difference]: With dead ends: 1817 [2020-12-09 06:48:59,159 INFO L226 Difference]: Without dead ends: 1248 [2020-12-09 06:48:59,159 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 06:48:59,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2020-12-09 06:48:59,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 1208. [2020-12-09 06:48:59,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1208 states. [2020-12-09 06:48:59,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1208 states and 3514 transitions. [2020-12-09 06:48:59,178 INFO L78 Accepts]: Start accepts. Automaton has 1208 states and 3514 transitions. Word has length 21 [2020-12-09 06:48:59,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:48:59,178 INFO L481 AbstractCegarLoop]: Abstraction has 1208 states and 3514 transitions. [2020-12-09 06:48:59,178 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 06:48:59,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1208 states and 3514 transitions. [2020-12-09 06:48:59,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-09 06:48:59,180 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:48:59,180 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 06:48:59,180 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-09 06:48:59,180 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:48:59,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:48:59,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1856738907, now seen corresponding path program 1 times [2020-12-09 06:48:59,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:48:59,181 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971550781] [2020-12-09 06:48:59,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:48:59,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:48:59,244 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 06:48:59,244 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971550781] [2020-12-09 06:48:59,245 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:48:59,245 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 06:48:59,245 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902140774] [2020-12-09 06:48:59,245 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 06:48:59,245 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:48:59,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 06:48:59,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-09 06:48:59,246 INFO L87 Difference]: Start difference. First operand 1208 states and 3514 transitions. Second operand 6 states. [2020-12-09 06:48:59,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:48:59,291 INFO L93 Difference]: Finished difference Result 1022 states and 2932 transitions. [2020-12-09 06:48:59,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 06:48:59,291 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-12-09 06:48:59,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:48:59,293 INFO L225 Difference]: With dead ends: 1022 [2020-12-09 06:48:59,293 INFO L226 Difference]: Without dead ends: 910 [2020-12-09 06:48:59,293 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 06:48:59,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2020-12-09 06:48:59,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 910. [2020-12-09 06:48:59,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 910 states. [2020-12-09 06:48:59,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 2644 transitions. [2020-12-09 06:48:59,309 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 2644 transitions. Word has length 22 [2020-12-09 06:48:59,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:48:59,309 INFO L481 AbstractCegarLoop]: Abstraction has 910 states and 2644 transitions. [2020-12-09 06:48:59,309 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 06:48:59,309 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 2644 transitions. [2020-12-09 06:48:59,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-09 06:48:59,311 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:48:59,311 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] [2020-12-09 06:48:59,311 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-09 06:48:59,311 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:48:59,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:48:59,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1093513864, now seen corresponding path program 1 times [2020-12-09 06:48:59,312 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:48:59,312 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691166063] [2020-12-09 06:48:59,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:48:59,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:48:59,519 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 06:48:59,519 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691166063] [2020-12-09 06:48:59,519 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:48:59,519 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-09 06:48:59,519 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615214029] [2020-12-09 06:48:59,520 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-09 06:48:59,520 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:48:59,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-09 06:48:59,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-12-09 06:48:59,520 INFO L87 Difference]: Start difference. First operand 910 states and 2644 transitions. Second operand 8 states. [2020-12-09 06:48:59,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:48:59,729 INFO L93 Difference]: Finished difference Result 1199 states and 3344 transitions. [2020-12-09 06:48:59,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 06:48:59,730 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2020-12-09 06:48:59,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:48:59,732 INFO L225 Difference]: With dead ends: 1199 [2020-12-09 06:48:59,732 INFO L226 Difference]: Without dead ends: 1112 [2020-12-09 06:48:59,732 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2020-12-09 06:48:59,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2020-12-09 06:48:59,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 1010. [2020-12-09 06:48:59,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1010 states. [2020-12-09 06:48:59,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 2878 transitions. [2020-12-09 06:48:59,751 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 2878 transitions. Word has length 25 [2020-12-09 06:48:59,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:48:59,751 INFO L481 AbstractCegarLoop]: Abstraction has 1010 states and 2878 transitions. [2020-12-09 06:48:59,751 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-09 06:48:59,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 2878 transitions. [2020-12-09 06:48:59,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-09 06:48:59,754 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:48:59,754 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] [2020-12-09 06:48:59,754 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-09 06:48:59,754 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:48:59,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:48:59,754 INFO L82 PathProgramCache]: Analyzing trace with hash -688096488, now seen corresponding path program 1 times [2020-12-09 06:48:59,755 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:48:59,755 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10873319] [2020-12-09 06:48:59,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:48:59,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:48:59,813 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 06:48:59,814 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10873319] [2020-12-09 06:48:59,814 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:48:59,814 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 06:48:59,814 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436731334] [2020-12-09 06:48:59,814 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 06:48:59,814 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:48:59,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 06:48:59,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 06:48:59,815 INFO L87 Difference]: Start difference. First operand 1010 states and 2878 transitions. Second operand 5 states. [2020-12-09 06:48:59,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:48:59,846 INFO L93 Difference]: Finished difference Result 1316 states and 3636 transitions. [2020-12-09 06:48:59,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 06:48:59,847 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2020-12-09 06:48:59,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:48:59,848 INFO L225 Difference]: With dead ends: 1316 [2020-12-09 06:48:59,848 INFO L226 Difference]: Without dead ends: 792 [2020-12-09 06:48:59,848 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-09 06:48:59,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2020-12-09 06:48:59,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 786. [2020-12-09 06:48:59,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-12-09 06:48:59,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 2075 transitions. [2020-12-09 06:48:59,861 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 2075 transitions. Word has length 25 [2020-12-09 06:48:59,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:48:59,861 INFO L481 AbstractCegarLoop]: Abstraction has 786 states and 2075 transitions. [2020-12-09 06:48:59,861 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 06:48:59,861 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 2075 transitions. [2020-12-09 06:48:59,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-09 06:48:59,862 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:48:59,862 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] [2020-12-09 06:48:59,862 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-09 06:48:59,863 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:48:59,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:48:59,863 INFO L82 PathProgramCache]: Analyzing trace with hash 385240342, now seen corresponding path program 2 times [2020-12-09 06:48:59,863 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:48:59,863 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247731788] [2020-12-09 06:48:59,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:48:59,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:48:59,922 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 06:48:59,922 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247731788] [2020-12-09 06:48:59,923 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:48:59,923 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-09 06:48:59,923 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550833244] [2020-12-09 06:48:59,923 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 06:48:59,923 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:48:59,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 06:48:59,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-09 06:48:59,923 INFO L87 Difference]: Start difference. First operand 786 states and 2075 transitions. Second operand 7 states. [2020-12-09 06:48:59,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:48:59,976 INFO L93 Difference]: Finished difference Result 744 states and 1992 transitions. [2020-12-09 06:48:59,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 06:48:59,976 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2020-12-09 06:48:59,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:48:59,977 INFO L225 Difference]: With dead ends: 744 [2020-12-09 06:48:59,977 INFO L226 Difference]: Without dead ends: 227 [2020-12-09 06:48:59,977 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 06:48:59,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2020-12-09 06:48:59,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 191. [2020-12-09 06:48:59,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-12-09 06:48:59,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 464 transitions. [2020-12-09 06:48:59,981 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 464 transitions. Word has length 25 [2020-12-09 06:48:59,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:48:59,981 INFO L481 AbstractCegarLoop]: Abstraction has 191 states and 464 transitions. [2020-12-09 06:48:59,981 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 06:48:59,981 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 464 transitions. [2020-12-09 06:48:59,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-09 06:48:59,981 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:48:59,981 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, 1, 1] [2020-12-09 06:48:59,981 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-09 06:48:59,981 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:48:59,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:48:59,982 INFO L82 PathProgramCache]: Analyzing trace with hash -224604943, now seen corresponding path program 1 times [2020-12-09 06:48:59,982 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:48:59,982 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526966973] [2020-12-09 06:48:59,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:49:00,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:49:00,212 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 06:49:00,212 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526966973] [2020-12-09 06:49:00,212 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:49:00,212 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-09 06:49:00,212 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424501477] [2020-12-09 06:49:00,212 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-09 06:49:00,212 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:49:00,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-09 06:49:00,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-12-09 06:49:00,213 INFO L87 Difference]: Start difference. First operand 191 states and 464 transitions. Second operand 9 states. [2020-12-09 06:49:00,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:49:00,466 INFO L93 Difference]: Finished difference Result 286 states and 695 transitions. [2020-12-09 06:49:00,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-09 06:49:00,467 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2020-12-09 06:49:00,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:49:00,468 INFO L225 Difference]: With dead ends: 286 [2020-12-09 06:49:00,468 INFO L226 Difference]: Without dead ends: 225 [2020-12-09 06:49:00,468 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2020-12-09 06:49:00,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2020-12-09 06:49:00,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 169. [2020-12-09 06:49:00,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2020-12-09 06:49:00,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 416 transitions. [2020-12-09 06:49:00,471 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 416 transitions. Word has length 28 [2020-12-09 06:49:00,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:49:00,471 INFO L481 AbstractCegarLoop]: Abstraction has 169 states and 416 transitions. [2020-12-09 06:49:00,471 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-09 06:49:00,471 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 416 transitions. [2020-12-09 06:49:00,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-09 06:49:00,471 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:49:00,472 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, 1, 1] [2020-12-09 06:49:00,472 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-09 06:49:00,472 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:49:00,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:49:00,472 INFO L82 PathProgramCache]: Analyzing trace with hash 238339441, now seen corresponding path program 2 times [2020-12-09 06:49:00,472 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:49:00,472 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585223163] [2020-12-09 06:49:00,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:49:00,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 06:49:00,505 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 06:49:00,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 06:49:00,534 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 06:49:00,562 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-12-09 06:49:00,562 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-09 06:49:00,562 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-09 06:49:00,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 06:49:00 BasicIcfg [2020-12-09 06:49:00,636 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 06:49:00,636 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 06:49:00,636 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 06:49:00,636 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 06:49:00,637 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:48:46" (3/4) ... [2020-12-09 06:49:00,638 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-09 06:49:00,708 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_597a5b47-d9cb-41b2-a30e-394ac4a85cba/bin/utaipan/witness.graphml [2020-12-09 06:49:00,708 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 06:49:00,708 INFO L168 Benchmark]: Toolchain (without parser) took 16111.14 ms. Allocated memory was 125.8 MB in the beginning and 377.5 MB in the end (delta: 251.7 MB). Free memory was 104.2 MB in the beginning and 272.5 MB in the end (delta: -168.2 MB). Peak memory consumption was 82.6 MB. Max. memory is 16.1 GB. [2020-12-09 06:49:00,708 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 77.6 MB. Free memory is still 51.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 06:49:00,709 INFO L168 Benchmark]: CACSL2BoogieTranslator took 368.12 ms. Allocated memory is still 125.8 MB. Free memory was 104.0 MB in the beginning and 101.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 38.8 MB. Max. memory is 16.1 GB. [2020-12-09 06:49:00,709 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.64 ms. Allocated memory is still 125.8 MB. Free memory was 101.8 MB in the beginning and 98.6 MB in the end (delta: 3.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 06:49:00,709 INFO L168 Benchmark]: Boogie Preprocessor took 30.16 ms. Allocated memory is still 125.8 MB. Free memory was 98.6 MB in the beginning and 96.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 06:49:00,709 INFO L168 Benchmark]: RCFGBuilder took 1447.34 ms. Allocated memory was 125.8 MB in the beginning and 153.1 MB in the end (delta: 27.3 MB). Free memory was 96.1 MB in the beginning and 64.8 MB in the end (delta: 31.4 MB). Peak memory consumption was 79.9 MB. Max. memory is 16.1 GB. [2020-12-09 06:49:00,710 INFO L168 Benchmark]: TraceAbstraction took 14137.60 ms. Allocated memory was 153.1 MB in the beginning and 377.5 MB in the end (delta: 224.4 MB). Free memory was 64.8 MB in the beginning and 291.3 MB in the end (delta: -226.6 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 06:49:00,710 INFO L168 Benchmark]: Witness Printer took 71.58 ms. Allocated memory is still 377.5 MB. Free memory was 291.3 MB in the beginning and 272.5 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2020-12-09 06:49:00,711 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.15 ms. Allocated memory is still 77.6 MB. Free memory is still 51.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 368.12 ms. Allocated memory is still 125.8 MB. Free memory was 104.0 MB in the beginning and 101.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 38.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 51.64 ms. Allocated memory is still 125.8 MB. Free memory was 101.8 MB in the beginning and 98.6 MB in the end (delta: 3.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 30.16 ms. Allocated memory is still 125.8 MB. Free memory was 98.6 MB in the beginning and 96.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1447.34 ms. Allocated memory was 125.8 MB in the beginning and 153.1 MB in the end (delta: 27.3 MB). Free memory was 96.1 MB in the beginning and 64.8 MB in the end (delta: 31.4 MB). Peak memory consumption was 79.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 14137.60 ms. Allocated memory was 153.1 MB in the beginning and 377.5 MB in the end (delta: 224.4 MB). Free memory was 64.8 MB in the beginning and 291.3 MB in the end (delta: -226.6 MB). There was no memory consumed. Max. memory is 16.1 GB. * Witness Printer took 71.58 ms. Allocated memory is still 377.5 MB. Free memory was 291.3 MB in the beginning and 272.5 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1743 VarBasedMoverChecksPositive, 88 VarBasedMoverChecksNegative, 33 SemBasedMoverChecksPositive, 55 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 225 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 9.5s, 126 PlacesBefore, 47 PlacesAfterwards, 115 TransitionsBefore, 35 TransitionsAfterwards, 2630 CoEnabledTransitionPairs, 7 FixpointIterations, 39 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 92 TotalNumberOfCompositions, 7514 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_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L723] 0 _Bool y$flush_delayed; [L724] 0 int y$mem_tmp; [L725] 0 _Bool y$r_buff0_thd0; [L726] 0 _Bool y$r_buff0_thd1; [L727] 0 _Bool y$r_buff0_thd2; [L728] 0 _Bool y$r_buff0_thd3; [L729] 0 _Bool y$r_buff0_thd4; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$r_buff1_thd4; [L735] 0 _Bool y$read_delayed; [L736] 0 int *y$read_delayed_var; [L737] 0 int y$w_buff0; [L738] 0 _Bool y$w_buff0_used; [L739] 0 int y$w_buff1; [L740] 0 _Bool y$w_buff1_used; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L844] 0 pthread_t t805; [L845] FCALL, FORK 0 pthread_create(&t805, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L846] 0 pthread_t t806; [L847] FCALL, FORK 0 pthread_create(&t806, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L848] 0 pthread_t t807; [L849] FCALL, FORK 0 pthread_create(&t807, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L783] 3 y$w_buff1 = y$w_buff0 [L784] 3 y$w_buff0 = 2 [L785] 3 y$w_buff1_used = y$w_buff0_used [L786] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L788] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L789] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L790] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L791] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L792] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L793] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L796] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L850] 0 pthread_t t808; [L851] FCALL, FORK 0 pthread_create(&t808, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L816] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L819] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L763] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L766] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L799] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L799] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L800] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L800] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L801] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L801] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L802] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L802] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L803] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L806] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L808] 3 return 0; [L822] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L822] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L822] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L822] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L823] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L823] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L824] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L824] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L825] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L825] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L826] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L826] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 4 return 0; [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L773] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L776] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L778] 2 return 0; [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L857] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L857] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L857] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L857] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L858] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L858] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L859] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L859] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L860] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L860] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L861] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 y$flush_delayed = weak$$choice2 [L867] 0 y$mem_tmp = y [L868] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L868] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L869] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L869] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L869] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L869] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L870] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L870] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L870] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L870] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L871] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L871] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L871] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L871] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L872] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L872] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L873] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L873] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L873] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L874] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L874] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L876] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L876] 0 y = y$flush_delayed ? y$mem_tmp : y [L877] 0 y$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_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 114 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 13.9s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.7s, HoareTripleCheckerStatistics: 604 SDtfs, 774 SDslu, 1293 SDs, 0 SdLazy, 477 SolverSat, 156 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4610occurred 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.7s AutomataMinimizationTime, 15 MinimizatonAttempts, 256 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 309 NumberOfCodeBlocks, 309 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 266 ConstructedInterpolants, 0 QuantifiedInterpolants, 58509 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...