./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe029_power.oepc.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_worker_vcloud-master_on_vcloud-master/run_dir_b51952ec-4e46-4e1f-af35-270e3f362005/bin/utaipan-WLngWcDbfI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51952ec-4e46-4e1f-af35-270e3f362005/bin/utaipan-WLngWcDbfI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51952ec-4e46-4e1f-af35-270e3f362005/bin/utaipan-WLngWcDbfI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51952ec-4e46-4e1f-af35-270e3f362005/bin/utaipan-WLngWcDbfI/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe029_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51952ec-4e46-4e1f-af35-270e3f362005/bin/utaipan-WLngWcDbfI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51952ec-4e46-4e1f-af35-270e3f362005/bin/utaipan-WLngWcDbfI --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 b7d71823ad5db35c113ed891cb1a29f2915df928 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 [2021-10-11 02:31:59,078 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-11 02:31:59,081 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-11 02:31:59,111 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-11 02:31:59,111 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-11 02:31:59,113 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-11 02:31:59,115 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-11 02:31:59,117 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-11 02:31:59,119 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-11 02:31:59,120 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-11 02:31:59,122 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-11 02:31:59,123 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-11 02:31:59,124 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-11 02:31:59,125 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-11 02:31:59,126 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-11 02:31:59,128 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-11 02:31:59,129 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-11 02:31:59,130 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-11 02:31:59,132 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-11 02:31:59,134 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-11 02:31:59,136 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-11 02:31:59,138 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-11 02:31:59,140 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-11 02:31:59,141 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-11 02:31:59,144 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-11 02:31:59,144 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-11 02:31:59,145 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-11 02:31:59,146 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-11 02:31:59,146 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-11 02:31:59,148 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-11 02:31:59,148 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-11 02:31:59,149 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-11 02:31:59,150 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-11 02:31:59,151 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-11 02:31:59,152 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-11 02:31:59,153 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-11 02:31:59,154 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-11 02:31:59,154 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-11 02:31:59,154 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-11 02:31:59,155 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-11 02:31:59,156 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-11 02:31:59,157 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51952ec-4e46-4e1f-af35-270e3f362005/bin/utaipan-WLngWcDbfI/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-11 02:31:59,180 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-11 02:31:59,181 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-11 02:31:59,182 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-11 02:31:59,182 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-11 02:31:59,182 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-11 02:31:59,182 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-11 02:31:59,183 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-11 02:31:59,183 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-11 02:31:59,183 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-11 02:31:59,183 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-11 02:31:59,184 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-11 02:31:59,184 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-11 02:31:59,184 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-11 02:31:59,184 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-11 02:31:59,184 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-11 02:31:59,185 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-11 02:31:59,185 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-11 02:31:59,186 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-11 02:31:59,186 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-11 02:31:59,186 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-11 02:31:59,186 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-11 02:31:59,187 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-11 02:31:59,187 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-11 02:31:59,187 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-11 02:31:59,187 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-11 02:31:59,187 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-11 02:31:59,188 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-11 02:31:59,188 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-11 02:31:59,188 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-11 02:31:59,188 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-11 02:31:59,189 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-11 02:31:59,189 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-11 02:31:59,189 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-11 02:31:59,189 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-11 02:31:59,190 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-11 02:31:59,190 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-11 02:31:59,190 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-11 02:31:59,190 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-11 02:31:59,190 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-11 02:31:59,191 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_worker_vcloud-master_on_vcloud-master/run_dir_b51952ec-4e46-4e1f-af35-270e3f362005/bin/utaipan-WLngWcDbfI/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_worker_vcloud-master_on_vcloud-master/run_dir_b51952ec-4e46-4e1f-af35-270e3f362005/bin/utaipan-WLngWcDbfI 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 -> b7d71823ad5db35c113ed891cb1a29f2915df928 [2021-10-11 02:31:59,438 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-11 02:31:59,469 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-11 02:31:59,472 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-11 02:31:59,473 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-11 02:31:59,474 INFO L275 PluginConnector]: CDTParser initialized [2021-10-11 02:31:59,475 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51952ec-4e46-4e1f-af35-270e3f362005/bin/utaipan-WLngWcDbfI/../../sv-benchmarks/c/pthread-wmm/safe029_power.oepc.i [2021-10-11 02:31:59,549 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51952ec-4e46-4e1f-af35-270e3f362005/bin/utaipan-WLngWcDbfI/data/d162fc0ef/2c30426e9bf64d8ca253123c73cd9411/FLAG4cf2efe1f [2021-10-11 02:32:00,081 INFO L306 CDTParser]: Found 1 translation units. [2021-10-11 02:32:00,082 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51952ec-4e46-4e1f-af35-270e3f362005/sv-benchmarks/c/pthread-wmm/safe029_power.oepc.i [2021-10-11 02:32:00,106 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51952ec-4e46-4e1f-af35-270e3f362005/bin/utaipan-WLngWcDbfI/data/d162fc0ef/2c30426e9bf64d8ca253123c73cd9411/FLAG4cf2efe1f [2021-10-11 02:32:00,362 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51952ec-4e46-4e1f-af35-270e3f362005/bin/utaipan-WLngWcDbfI/data/d162fc0ef/2c30426e9bf64d8ca253123c73cd9411 [2021-10-11 02:32:00,365 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-11 02:32:00,366 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-11 02:32:00,371 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-11 02:32:00,371 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-11 02:32:00,375 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-11 02:32:00,376 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:32:00" (1/1) ... [2021-10-11 02:32:00,378 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c538030 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:32:00, skipping insertion in model container [2021-10-11 02:32:00,382 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:32:00" (1/1) ... [2021-10-11 02:32:00,388 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-11 02:32:00,447 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-11 02:32:00,647 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51952ec-4e46-4e1f-af35-270e3f362005/sv-benchmarks/c/pthread-wmm/safe029_power.oepc.i[952,965] [2021-10-11 02:32:00,838 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 02:32:00,847 INFO L203 MainTranslator]: Completed pre-run [2021-10-11 02:32:00,859 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51952ec-4e46-4e1f-af35-270e3f362005/sv-benchmarks/c/pthread-wmm/safe029_power.oepc.i[952,965] [2021-10-11 02:32:00,954 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 02:32:01,033 INFO L208 MainTranslator]: Completed translation [2021-10-11 02:32:01,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:32:01 WrapperNode [2021-10-11 02:32:01,033 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-11 02:32:01,034 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-11 02:32:01,035 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-11 02:32:01,035 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-11 02:32:01,043 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:32:01" (1/1) ... [2021-10-11 02:32:01,064 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:32:01" (1/1) ... [2021-10-11 02:32:01,105 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-11 02:32:01,106 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-11 02:32:01,106 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-11 02:32:01,106 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-11 02:32:01,115 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:32:01" (1/1) ... [2021-10-11 02:32:01,115 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:32:01" (1/1) ... [2021-10-11 02:32:01,121 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:32:01" (1/1) ... [2021-10-11 02:32:01,122 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:32:01" (1/1) ... [2021-10-11 02:32:01,132 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:32:01" (1/1) ... [2021-10-11 02:32:01,136 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:32:01" (1/1) ... [2021-10-11 02:32:01,140 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:32:01" (1/1) ... [2021-10-11 02:32:01,145 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-11 02:32:01,146 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-11 02:32:01,147 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-11 02:32:01,147 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-11 02:32:01,148 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:32:01" (1/1) ... No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51952ec-4e46-4e1f-af35-270e3f362005/bin/utaipan-WLngWcDbfI/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 [2021-10-11 02:32:01,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-11 02:32:01,232 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-10-11 02:32:01,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-11 02:32:01,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-11 02:32:01,232 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-10-11 02:32:01,232 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-10-11 02:32:01,233 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-10-11 02:32:01,233 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-10-11 02:32:01,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-11 02:32:01,233 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-10-11 02:32:01,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-11 02:32:01,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-11 02:32:01,235 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-11 02:32:03,404 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-11 02:32:03,404 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-10-11 02:32:03,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:32:03 BoogieIcfgContainer [2021-10-11 02:32:03,408 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-11 02:32:03,412 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-11 02:32:03,413 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-11 02:32:03,416 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-11 02:32:03,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:32:00" (1/3) ... [2021-10-11 02:32:03,418 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@104a9088 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:32:03, skipping insertion in model container [2021-10-11 02:32:03,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:32:01" (2/3) ... [2021-10-11 02:32:03,419 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@104a9088 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:32:03, skipping insertion in model container [2021-10-11 02:32:03,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:32:03" (3/3) ... [2021-10-11 02:32:03,421 INFO L111 eAbstractionObserver]: Analyzing ICFG safe029_power.oepc.i [2021-10-11 02:32:03,440 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-11 02:32:03,440 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-11 02:32:03,444 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-10-11 02:32:03,445 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-11 02:32:03,486 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,487 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,487 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,487 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,487 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,488 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,488 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,488 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,488 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,489 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,489 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,491 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,491 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,491 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,492 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,493 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,493 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,493 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,494 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,494 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,494 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,494 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,494 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,496 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,496 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,497 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,497 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,497 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,497 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,498 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,498 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,499 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,499 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,500 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,500 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,501 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,501 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,501 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,501 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,502 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,503 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,503 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,503 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,504 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,504 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,505 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,505 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,505 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,505 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,505 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,506 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,507 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,509 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,510 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,512 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,513 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,513 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,513 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,513 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,513 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,514 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,514 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,515 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,515 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,515 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,515 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,518 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,518 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,519 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,519 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,519 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,519 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,520 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,520 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,520 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,521 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:32:03,526 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-10-11 02:32:03,542 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-10-11 02:32:03,578 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-10-11 02:32:03,578 INFO L378 AbstractCegarLoop]: Hoare is true [2021-10-11 02:32:03,578 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-10-11 02:32:03,578 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-11 02:32:03,578 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-11 02:32:03,578 INFO L382 AbstractCegarLoop]: Difference is false [2021-10-11 02:32:03,578 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-11 02:32:03,578 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-10-11 02:32:03,591 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-10-11 02:32:03,593 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 79 transitions, 168 flow [2021-10-11 02:32:03,596 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 79 transitions, 168 flow [2021-10-11 02:32:03,598 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 84 places, 79 transitions, 168 flow [2021-10-11 02:32:03,637 INFO L129 PetriNetUnfolder]: 2/77 cut-off events. [2021-10-11 02:32:03,637 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-11 02:32:03,644 INFO L84 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 77 events. 2/77 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2021-10-11 02:32:03,649 INFO L116 LiptonReduction]: Number of co-enabled transitions 926 [2021-10-11 02:32:04,099 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 02:32:04,100 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:04,102 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2021-10-11 02:32:04,103 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:04,144 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 4, 3, 2, 1] term [2021-10-11 02:32:04,145 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:04,146 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:32:04,147 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:04,149 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 4, 3, 2, 1] term [2021-10-11 02:32:04,149 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:04,230 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 2, 1] term [2021-10-11 02:32:04,231 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:04,233 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2021-10-11 02:32:04,236 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:05,442 WARN L197 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 224 DAG size of output: 184 [2021-10-11 02:32:06,415 WARN L197 SmtUtils]: Spent 969.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 181 [2021-10-11 02:32:08,358 WARN L197 SmtUtils]: Spent 1.94 s on a formula simplification. DAG size of input: 308 DAG size of output: 264 [2021-10-11 02:32:09,241 WARN L197 SmtUtils]: Spent 880.00 ms on a formula simplification that was a NOOP. DAG size: 261 [2021-10-11 02:32:09,512 WARN L197 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-10-11 02:32:10,066 WARN L197 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 86 [2021-10-11 02:32:10,229 WARN L197 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-10-11 02:32:10,342 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 02:32:10,343 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:10,344 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 1] term [2021-10-11 02:32:10,345 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:10,395 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 02:32:10,396 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:10,397 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2021-10-11 02:32:10,398 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:10,476 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2021-10-11 02:32:10,476 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:32:10,477 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-10-11 02:32:10,478 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:32:10,536 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 02:32:10,536 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:10,538 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2021-10-11 02:32:10,539 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:10,615 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2021-10-11 02:32:10,615 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:32:10,618 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-10-11 02:32:10,618 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:32:10,656 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 02:32:10,656 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:10,658 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2021-10-11 02:32:10,658 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:10,728 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:32:10,729 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:32:10,731 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2021-10-11 02:32:10,731 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:10,733 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:32:10,733 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:10,736 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:32:10,737 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:32:10,739 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:32:10,739 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:32:10,741 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:32:10,741 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:32:10,744 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2021-10-11 02:32:10,744 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:10,747 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2021-10-11 02:32:10,747 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:10,749 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2021-10-11 02:32:10,749 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:10,811 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 02:32:10,811 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:10,812 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2021-10-11 02:32:10,813 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:10,815 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2021-10-11 02:32:10,816 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-10-11 02:32:10,819 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 3, 2, 1] term [2021-10-11 02:32:10,819 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:10,937 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 2, 1] term [2021-10-11 02:32:10,937 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:10,938 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2021-10-11 02:32:10,939 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:10,972 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 02:32:10,972 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:10,973 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2021-10-11 02:32:10,973 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:11,003 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 4, 4, 3, 2, 1] term [2021-10-11 02:32:11,003 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:11,005 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 2, 1] term [2021-10-11 02:32:11,005 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:11,006 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 4, 4, 3, 2, 1] term [2021-10-11 02:32:11,006 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:11,043 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 02:32:11,044 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:11,045 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2021-10-11 02:32:11,046 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:11,084 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2021-10-11 02:32:11,101 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:32:11,103 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-10-11 02:32:11,103 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:32:11,484 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 02:32:11,485 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:11,486 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2021-10-11 02:32:11,486 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:11,489 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2021-10-11 02:32:11,489 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-10-11 02:32:11,492 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 3, 2, 1] term [2021-10-11 02:32:11,492 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:11,550 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:32:11,551 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:32:11,555 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2021-10-11 02:32:11,555 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:11,556 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:32:11,556 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:11,559 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:32:11,560 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:32:11,562 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:32:11,563 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:32:11,564 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:32:11,565 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:32:11,567 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2021-10-11 02:32:11,567 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:11,570 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2021-10-11 02:32:11,570 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:11,572 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2021-10-11 02:32:11,572 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:11,713 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 02:32:11,714 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:11,714 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2021-10-11 02:32:11,715 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:11,785 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2021-10-11 02:32:11,785 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:32:11,786 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-10-11 02:32:11,786 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:32:11,852 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:32:11,852 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:32:11,861 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2021-10-11 02:32:11,861 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:11,862 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:32:11,863 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:11,866 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:32:11,867 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:32:11,868 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:32:11,869 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:32:11,871 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:32:11,872 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:32:11,874 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2021-10-11 02:32:11,875 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:11,878 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2021-10-11 02:32:11,878 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:11,880 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2021-10-11 02:32:11,880 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:11,943 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 02:32:11,943 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:11,944 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2021-10-11 02:32:11,944 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:11,947 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2021-10-11 02:32:11,947 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-10-11 02:32:11,950 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 3, 2, 1] term [2021-10-11 02:32:11,950 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:12,024 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 02:32:12,025 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:12,025 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2021-10-11 02:32:12,026 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:12,028 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2021-10-11 02:32:12,029 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-10-11 02:32:12,031 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 3, 2, 1] term [2021-10-11 02:32:12,032 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:12,069 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:32:12,069 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:32:12,091 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2021-10-11 02:32:12,091 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:12,092 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:32:12,092 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:12,095 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:32:12,096 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:32:12,098 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:32:12,098 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:32:12,100 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:32:12,100 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:32:12,102 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2021-10-11 02:32:12,103 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:12,104 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2021-10-11 02:32:12,105 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:12,107 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2021-10-11 02:32:12,107 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:12,499 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2021-10-11 02:32:12,499 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:32:12,500 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-10-11 02:32:12,500 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:32:12,551 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 02:32:12,552 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:12,553 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2021-10-11 02:32:12,554 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:12,651 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2021-10-11 02:32:12,652 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:32:12,676 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 02:32:12,677 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:12,677 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2021-10-11 02:32:12,678 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:12,704 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2021-10-11 02:32:12,704 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:32:12,705 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-10-11 02:32:12,705 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:32:12,785 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:32:12,786 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:32:12,786 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:32:12,787 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:32:12,788 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:32:12,789 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:12,790 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:32:12,791 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:12,808 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:32:12,808 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:32:12,809 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:32:12,809 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:32:12,811 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:32:12,811 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:32:12,813 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:32:12,813 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:32:12,968 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:32:12,969 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:32:12,970 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:32:12,970 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:32:12,972 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:32:12,972 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:32:12,974 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:32:12,974 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:32:12,993 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:32:12,993 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:32:12,994 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:32:12,995 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:32:12,996 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:32:12,997 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:12,998 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:32:12,999 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:13,177 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:32:13,177 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:32:13,178 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:32:13,178 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:32:13,180 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:32:13,181 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:13,182 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:32:13,183 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:13,201 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:32:13,202 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:32:13,203 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:32:13,203 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:32:13,205 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:32:13,205 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:32:13,207 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:32:13,207 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:32:13,715 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2021-10-11 02:32:13,832 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2021-10-11 02:32:14,029 WARN L197 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-10-11 02:32:14,238 WARN L197 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-10-11 02:32:14,785 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2021-10-11 02:32:14,785 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:32:14,824 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:32:14,825 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:32:14,825 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:32:14,826 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:32:14,827 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:32:14,827 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:14,829 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:32:14,829 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:14,847 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:32:14,848 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:32:14,848 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:32:14,849 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:32:14,850 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:32:14,851 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:32:14,852 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:32:14,853 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:32:14,924 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2021-10-11 02:32:14,924 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:32:14,950 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:32:14,951 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:32:14,951 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:32:14,951 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:32:14,953 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:32:14,955 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:32:14,956 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:32:14,957 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:32:14,974 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:32:14,974 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:32:14,975 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:32:14,975 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:32:14,977 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:32:14,977 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:14,978 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:32:14,979 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:32:15,722 WARN L197 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 90 [2021-10-11 02:32:15,837 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-10-11 02:32:16,164 WARN L197 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 90 [2021-10-11 02:32:16,317 WARN L197 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-10-11 02:32:16,672 WARN L197 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 104 [2021-10-11 02:32:16,822 WARN L197 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2021-10-11 02:32:17,139 WARN L197 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 104 [2021-10-11 02:32:17,283 WARN L197 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2021-10-11 02:32:17,287 INFO L131 LiptonReduction]: Checked pairs total: 2551 [2021-10-11 02:32:17,287 INFO L133 LiptonReduction]: Total number of compositions: 69 [2021-10-11 02:32:17,302 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 27 places, 21 transitions, 52 flow [2021-10-11 02:32:17,324 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 194 states. [2021-10-11 02:32:17,325 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states. [2021-10-11 02:32:17,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-11 02:32:17,331 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:32:17,332 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-11 02:32:17,332 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:32:17,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:32:17,338 INFO L82 PathProgramCache]: Analyzing trace with hash 910322, now seen corresponding path program 1 times [2021-10-11 02:32:17,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:32:17,348 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133671243] [2021-10-11 02:32:17,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:32:17,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:32:17,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:32:17,564 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133671243] [2021-10-11 02:32:17,565 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:32:17,565 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-11 02:32:17,565 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293482525] [2021-10-11 02:32:17,569 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:32:17,569 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:32:17,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:32:17,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:32:17,590 INFO L87 Difference]: Start difference. First operand 194 states. Second operand 3 states. [2021-10-11 02:32:17,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:32:17,682 INFO L93 Difference]: Finished difference Result 162 states and 385 transitions. [2021-10-11 02:32:17,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:32:17,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2021-10-11 02:32:17,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:32:17,701 INFO L225 Difference]: With dead ends: 162 [2021-10-11 02:32:17,701 INFO L226 Difference]: Without dead ends: 137 [2021-10-11 02:32:17,702 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 [2021-10-11 02:32:17,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-10-11 02:32:17,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2021-10-11 02:32:17,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2021-10-11 02:32:17,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 320 transitions. [2021-10-11 02:32:17,742 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 320 transitions. Word has length 3 [2021-10-11 02:32:17,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:32:17,743 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 320 transitions. [2021-10-11 02:32:17,743 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:32:17,743 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 320 transitions. [2021-10-11 02:32:17,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-10-11 02:32:17,744 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:32:17,744 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:32:17,745 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-11 02:32:17,745 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:32:17,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:32:17,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1383112192, now seen corresponding path program 1 times [2021-10-11 02:32:17,746 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:32:17,746 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883825458] [2021-10-11 02:32:17,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:32:17,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:32:17,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:32:17,986 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883825458] [2021-10-11 02:32:17,986 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:32:17,986 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-11 02:32:17,986 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726948551] [2021-10-11 02:32:17,988 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:32:17,988 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:32:17,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:32:17,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:32:17,990 INFO L87 Difference]: Start difference. First operand 137 states and 320 transitions. Second operand 4 states. [2021-10-11 02:32:18,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:32:18,039 INFO L93 Difference]: Finished difference Result 158 states and 350 transitions. [2021-10-11 02:32:18,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 02:32:18,040 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2021-10-11 02:32:18,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:32:18,044 INFO L225 Difference]: With dead ends: 158 [2021-10-11 02:32:18,045 INFO L226 Difference]: Without dead ends: 133 [2021-10-11 02:32:18,045 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 [2021-10-11 02:32:18,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-10-11 02:32:18,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2021-10-11 02:32:18,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2021-10-11 02:32:18,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 308 transitions. [2021-10-11 02:32:18,064 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 308 transitions. Word has length 8 [2021-10-11 02:32:18,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:32:18,065 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 308 transitions. [2021-10-11 02:32:18,065 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:32:18,065 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 308 transitions. [2021-10-11 02:32:18,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-11 02:32:18,066 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:32:18,066 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:32:18,066 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-11 02:32:18,067 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:32:18,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:32:18,067 INFO L82 PathProgramCache]: Analyzing trace with hash -73810597, now seen corresponding path program 1 times [2021-10-11 02:32:18,067 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:32:18,067 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322139763] [2021-10-11 02:32:18,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:32:18,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:32:18,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:32:18,251 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322139763] [2021-10-11 02:32:18,252 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:32:18,252 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:32:18,252 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141270166] [2021-10-11 02:32:18,252 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:32:18,253 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:32:18,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:32:18,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:32:18,254 INFO L87 Difference]: Start difference. First operand 133 states and 308 transitions. Second operand 5 states. [2021-10-11 02:32:18,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:32:18,344 INFO L93 Difference]: Finished difference Result 151 states and 334 transitions. [2021-10-11 02:32:18,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 02:32:18,345 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2021-10-11 02:32:18,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:32:18,346 INFO L225 Difference]: With dead ends: 151 [2021-10-11 02:32:18,346 INFO L226 Difference]: Without dead ends: 131 [2021-10-11 02:32:18,347 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:32:18,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-10-11 02:32:18,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2021-10-11 02:32:18,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2021-10-11 02:32:18,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 302 transitions. [2021-10-11 02:32:18,356 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 302 transitions. Word has length 9 [2021-10-11 02:32:18,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:32:18,357 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 302 transitions. [2021-10-11 02:32:18,357 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:32:18,357 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 302 transitions. [2021-10-11 02:32:18,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-11 02:32:18,358 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:32:18,358 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:32:18,359 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-11 02:32:18,359 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:32:18,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:32:18,359 INFO L82 PathProgramCache]: Analyzing trace with hash 2006819981, now seen corresponding path program 1 times [2021-10-11 02:32:18,360 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:32:18,360 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638662893] [2021-10-11 02:32:18,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:32:18,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:32:18,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:32:18,465 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638662893] [2021-10-11 02:32:18,465 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:32:18,465 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:32:18,466 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35746937] [2021-10-11 02:32:18,466 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:32:18,466 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:32:18,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:32:18,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:32:18,468 INFO L87 Difference]: Start difference. First operand 131 states and 302 transitions. Second operand 5 states. [2021-10-11 02:32:18,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:32:18,619 INFO L93 Difference]: Finished difference Result 147 states and 327 transitions. [2021-10-11 02:32:18,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 02:32:18,620 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2021-10-11 02:32:18,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:32:18,622 INFO L225 Difference]: With dead ends: 147 [2021-10-11 02:32:18,623 INFO L226 Difference]: Without dead ends: 132 [2021-10-11 02:32:18,623 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-10-11 02:32:18,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-10-11 02:32:18,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2021-10-11 02:32:18,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2021-10-11 02:32:18,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 304 transitions. [2021-10-11 02:32:18,646 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 304 transitions. Word has length 10 [2021-10-11 02:32:18,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:32:18,646 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 304 transitions. [2021-10-11 02:32:18,647 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:32:18,647 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 304 transitions. [2021-10-11 02:32:18,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-11 02:32:18,649 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:32:18,649 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:32:18,650 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-11 02:32:18,650 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:32:18,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:32:18,650 INFO L82 PathProgramCache]: Analyzing trace with hash 2006851694, now seen corresponding path program 1 times [2021-10-11 02:32:18,651 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:32:18,651 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331778618] [2021-10-11 02:32:18,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:32:18,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:32:18,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:32:18,892 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331778618] [2021-10-11 02:32:18,892 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:32:18,893 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 02:32:18,893 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673803083] [2021-10-11 02:32:18,893 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 02:32:18,893 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:32:18,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 02:32:18,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:32:18,894 INFO L87 Difference]: Start difference. First operand 132 states and 304 transitions. Second operand 6 states. [2021-10-11 02:32:18,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:32:18,999 INFO L93 Difference]: Finished difference Result 145 states and 318 transitions. [2021-10-11 02:32:19,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 02:32:19,001 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2021-10-11 02:32:19,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:32:19,002 INFO L225 Difference]: With dead ends: 145 [2021-10-11 02:32:19,002 INFO L226 Difference]: Without dead ends: 126 [2021-10-11 02:32:19,002 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-10-11 02:32:19,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2021-10-11 02:32:19,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2021-10-11 02:32:19,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2021-10-11 02:32:19,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 286 transitions. [2021-10-11 02:32:19,009 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 286 transitions. Word has length 10 [2021-10-11 02:32:19,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:32:19,009 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 286 transitions. [2021-10-11 02:32:19,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 02:32:19,009 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 286 transitions. [2021-10-11 02:32:19,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-11 02:32:19,010 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:32:19,010 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:32:19,011 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-11 02:32:19,011 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:32:19,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:32:19,011 INFO L82 PathProgramCache]: Analyzing trace with hash 2005061351, now seen corresponding path program 2 times [2021-10-11 02:32:19,011 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:32:19,011 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253063860] [2021-10-11 02:32:19,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:32:19,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:32:19,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:32:19,184 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253063860] [2021-10-11 02:32:19,184 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:32:19,184 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 02:32:19,184 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777762866] [2021-10-11 02:32:19,185 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 02:32:19,185 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:32:19,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 02:32:19,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:32:19,185 INFO L87 Difference]: Start difference. First operand 126 states and 286 transitions. Second operand 6 states. [2021-10-11 02:32:19,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:32:19,316 INFO L93 Difference]: Finished difference Result 139 states and 303 transitions. [2021-10-11 02:32:19,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 02:32:19,322 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2021-10-11 02:32:19,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:32:19,323 INFO L225 Difference]: With dead ends: 139 [2021-10-11 02:32:19,323 INFO L226 Difference]: Without dead ends: 124 [2021-10-11 02:32:19,323 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-11 02:32:19,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-10-11 02:32:19,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2021-10-11 02:32:19,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2021-10-11 02:32:19,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 278 transitions. [2021-10-11 02:32:19,329 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 278 transitions. Word has length 10 [2021-10-11 02:32:19,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:32:19,329 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 278 transitions. [2021-10-11 02:32:19,329 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 02:32:19,330 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 278 transitions. [2021-10-11 02:32:19,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-11 02:32:19,330 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:32:19,331 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:32:19,331 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-11 02:32:19,331 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:32:19,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:32:19,331 INFO L82 PathProgramCache]: Analyzing trace with hash 2081859420, now seen corresponding path program 1 times [2021-10-11 02:32:19,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:32:19,332 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050525842] [2021-10-11 02:32:19,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:32:19,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:32:19,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:32:19,544 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050525842] [2021-10-11 02:32:19,544 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:32:19,544 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 02:32:19,544 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782363987] [2021-10-11 02:32:19,545 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-10-11 02:32:19,545 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:32:19,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-11 02:32:19,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-11 02:32:19,546 INFO L87 Difference]: Start difference. First operand 123 states and 278 transitions. Second operand 7 states. [2021-10-11 02:32:19,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:32:19,734 INFO L93 Difference]: Finished difference Result 157 states and 330 transitions. [2021-10-11 02:32:19,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 02:32:19,735 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2021-10-11 02:32:19,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:32:19,736 INFO L225 Difference]: With dead ends: 157 [2021-10-11 02:32:19,736 INFO L226 Difference]: Without dead ends: 119 [2021-10-11 02:32:19,737 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-10-11 02:32:19,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-10-11 02:32:19,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 107. [2021-10-11 02:32:19,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2021-10-11 02:32:19,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 230 transitions. [2021-10-11 02:32:19,741 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 230 transitions. Word has length 11 [2021-10-11 02:32:19,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:32:19,742 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 230 transitions. [2021-10-11 02:32:19,742 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-10-11 02:32:19,742 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 230 transitions. [2021-10-11 02:32:19,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-11 02:32:19,743 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:32:19,743 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:32:19,743 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-11 02:32:19,743 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:32:19,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:32:19,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1609340406, now seen corresponding path program 1 times [2021-10-11 02:32:19,744 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:32:19,744 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816320091] [2021-10-11 02:32:19,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:32:19,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:32:19,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:32:19,814 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816320091] [2021-10-11 02:32:19,814 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:32:19,814 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:32:19,814 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521890570] [2021-10-11 02:32:19,815 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:32:19,815 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:32:19,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:32:19,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:32:19,816 INFO L87 Difference]: Start difference. First operand 107 states and 230 transitions. Second operand 4 states. [2021-10-11 02:32:19,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:32:19,857 INFO L93 Difference]: Finished difference Result 157 states and 322 transitions. [2021-10-11 02:32:19,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 02:32:19,857 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2021-10-11 02:32:19,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:32:19,858 INFO L225 Difference]: With dead ends: 157 [2021-10-11 02:32:19,858 INFO L226 Difference]: Without dead ends: 79 [2021-10-11 02:32:19,859 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 [2021-10-11 02:32:19,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2021-10-11 02:32:19,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2021-10-11 02:32:19,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2021-10-11 02:32:19,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 156 transitions. [2021-10-11 02:32:19,862 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 156 transitions. Word has length 11 [2021-10-11 02:32:19,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:32:19,862 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 156 transitions. [2021-10-11 02:32:19,862 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:32:19,862 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 156 transitions. [2021-10-11 02:32:19,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-11 02:32:19,863 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:32:19,863 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:32:19,863 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-11 02:32:19,863 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:32:19,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:32:19,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1651370987, now seen corresponding path program 1 times [2021-10-11 02:32:19,864 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:32:19,864 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199268401] [2021-10-11 02:32:19,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:32:19,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:32:19,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:32:19,928 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199268401] [2021-10-11 02:32:19,928 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:32:19,928 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:32:19,928 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209066952] [2021-10-11 02:32:19,928 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:32:19,928 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:32:19,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:32:19,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:32:19,929 INFO L87 Difference]: Start difference. First operand 79 states and 156 transitions. Second operand 4 states. [2021-10-11 02:32:19,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:32:19,954 INFO L93 Difference]: Finished difference Result 70 states and 116 transitions. [2021-10-11 02:32:19,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:32:19,955 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2021-10-11 02:32:19,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:32:19,955 INFO L225 Difference]: With dead ends: 70 [2021-10-11 02:32:19,955 INFO L226 Difference]: Without dead ends: 53 [2021-10-11 02:32:19,956 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 [2021-10-11 02:32:19,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-10-11 02:32:19,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2021-10-11 02:32:19,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2021-10-11 02:32:19,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 84 transitions. [2021-10-11 02:32:19,958 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 84 transitions. Word has length 12 [2021-10-11 02:32:19,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:32:19,958 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 84 transitions. [2021-10-11 02:32:19,958 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:32:19,959 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 84 transitions. [2021-10-11 02:32:19,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-11 02:32:19,959 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:32:19,959 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:32:19,959 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-11 02:32:19,959 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:32:19,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:32:19,960 INFO L82 PathProgramCache]: Analyzing trace with hash 453077670, now seen corresponding path program 1 times [2021-10-11 02:32:19,960 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:32:19,960 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860211259] [2021-10-11 02:32:19,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:32:19,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:32:20,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:32:20,036 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860211259] [2021-10-11 02:32:20,036 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:32:20,036 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 02:32:20,037 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730035049] [2021-10-11 02:32:20,037 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:32:20,037 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:32:20,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:32:20,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:32:20,038 INFO L87 Difference]: Start difference. First operand 53 states and 84 transitions. Second operand 5 states. [2021-10-11 02:32:20,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:32:20,074 INFO L93 Difference]: Finished difference Result 40 states and 57 transitions. [2021-10-11 02:32:20,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 02:32:20,075 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2021-10-11 02:32:20,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:32:20,075 INFO L225 Difference]: With dead ends: 40 [2021-10-11 02:32:20,075 INFO L226 Difference]: Without dead ends: 25 [2021-10-11 02:32:20,076 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-10-11 02:32:20,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-10-11 02:32:20,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2021-10-11 02:32:20,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2021-10-11 02:32:20,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2021-10-11 02:32:20,077 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 13 [2021-10-11 02:32:20,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:32:20,077 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2021-10-11 02:32:20,077 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:32:20,077 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2021-10-11 02:32:20,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-11 02:32:20,078 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:32:20,078 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:32:20,078 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-11 02:32:20,078 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:32:20,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:32:20,079 INFO L82 PathProgramCache]: Analyzing trace with hash 969539651, now seen corresponding path program 1 times [2021-10-11 02:32:20,079 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:32:20,079 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064007423] [2021-10-11 02:32:20,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:32:20,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 02:32:20,152 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 02:32:20,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 02:32:20,228 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 02:32:20,279 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-10-11 02:32:20,279 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-10-11 02:32:20,279 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-11 02:32:20,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:32:20 BasicIcfg [2021-10-11 02:32:20,382 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-11 02:32:20,383 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-11 02:32:20,383 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-11 02:32:20,383 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-11 02:32:20,384 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:32:03" (3/4) ... [2021-10-11 02:32:20,386 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-11 02:32:20,497 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b51952ec-4e46-4e1f-af35-270e3f362005/bin/utaipan-WLngWcDbfI/witness.graphml [2021-10-11 02:32:20,497 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-11 02:32:20,498 INFO L168 Benchmark]: Toolchain (without parser) took 20131.63 ms. Allocated memory was 113.2 MB in the beginning and 318.8 MB in the end (delta: 205.5 MB). Free memory was 74.6 MB in the beginning and 250.2 MB in the end (delta: -175.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 16.1 GB. [2021-10-11 02:32:20,498 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 113.2 MB. Free memory was 88.0 MB in the beginning and 88.0 MB in the end (delta: 28.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 02:32:20,499 INFO L168 Benchmark]: CACSL2BoogieTranslator took 662.66 ms. Allocated memory is still 113.2 MB. Free memory was 74.4 MB in the beginning and 63.4 MB in the end (delta: 11.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-11 02:32:20,499 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.99 ms. Allocated memory is still 113.2 MB. Free memory was 63.4 MB in the beginning and 60.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-11 02:32:20,500 INFO L168 Benchmark]: Boogie Preprocessor took 39.81 ms. Allocated memory is still 113.2 MB. Free memory was 60.6 MB in the beginning and 58.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 02:32:20,500 INFO L168 Benchmark]: RCFGBuilder took 2262.15 ms. Allocated memory was 113.2 MB in the beginning and 151.0 MB in the end (delta: 37.7 MB). Free memory was 58.5 MB in the beginning and 103.1 MB in the end (delta: -44.6 MB). Peak memory consumption was 61.7 MB. Max. memory is 16.1 GB. [2021-10-11 02:32:20,500 INFO L168 Benchmark]: TraceAbstraction took 16970.14 ms. Allocated memory was 151.0 MB in the beginning and 318.8 MB in the end (delta: 167.8 MB). Free memory was 102.1 MB in the beginning and 259.6 MB in the end (delta: -157.5 MB). Peak memory consumption was 11.3 MB. Max. memory is 16.1 GB. [2021-10-11 02:32:20,501 INFO L168 Benchmark]: Witness Printer took 114.42 ms. Allocated memory is still 318.8 MB. Free memory was 259.6 MB in the beginning and 250.2 MB in the end (delta: 9.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-11 02:32:20,504 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.29 ms. Allocated memory is still 113.2 MB. Free memory was 88.0 MB in the beginning and 88.0 MB in the end (delta: 28.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 662.66 ms. Allocated memory is still 113.2 MB. Free memory was 74.4 MB in the beginning and 63.4 MB in the end (delta: 11.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 70.99 ms. Allocated memory is still 113.2 MB. Free memory was 63.4 MB in the beginning and 60.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 39.81 ms. Allocated memory is still 113.2 MB. Free memory was 60.6 MB in the beginning and 58.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2262.15 ms. Allocated memory was 113.2 MB in the beginning and 151.0 MB in the end (delta: 37.7 MB). Free memory was 58.5 MB in the beginning and 103.1 MB in the end (delta: -44.6 MB). Peak memory consumption was 61.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 16970.14 ms. Allocated memory was 151.0 MB in the beginning and 318.8 MB in the end (delta: 167.8 MB). Free memory was 102.1 MB in the beginning and 259.6 MB in the end (delta: -157.5 MB). Peak memory consumption was 11.3 MB. Max. memory is 16.1 GB. * Witness Printer took 114.42 ms. Allocated memory is still 318.8 MB. Free memory was 259.6 MB in the beginning and 250.2 MB in the end (delta: 9.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 563 VarBasedMoverChecksPositive, 49 VarBasedMoverChecksNegative, 15 SemBasedMoverChecksPositive, 34 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.4s, 69 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 13.6s, 84 PlacesBefore, 27 PlacesAfterwards, 79 TransitionsBefore, 21 TransitionsAfterwards, 926 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 69 TotalNumberOfCompositions, 2551 MoverChecksTotal - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L709] 0 _Bool main$tmp_guard0; [L710] 0 _Bool main$tmp_guard1; [L712] 0 int x = 0; [L714] 0 int y = 0; [L715] 0 _Bool y$flush_delayed; [L716] 0 int y$mem_tmp; [L717] 0 _Bool y$r_buff0_thd0; [L718] 0 _Bool y$r_buff0_thd1; [L719] 0 _Bool y$r_buff0_thd2; [L720] 0 _Bool y$r_buff1_thd0; [L721] 0 _Bool y$r_buff1_thd1; [L722] 0 _Bool y$r_buff1_thd2; [L723] 0 _Bool y$read_delayed; [L724] 0 int *y$read_delayed_var; [L725] 0 int y$w_buff0; [L726] 0 _Bool y$w_buff0_used; [L727] 0 int y$w_buff1; [L728] 0 _Bool y$w_buff1_used; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L790] 0 pthread_t t2473; [L791] FCALL, FORK 0 pthread_create(&t2473, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L792] 0 pthread_t t2474; [L793] FCALL, FORK 0 pthread_create(&t2474, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L734] 1 y$w_buff1 = y$w_buff0 [L735] 1 y$w_buff0 = 2 [L736] 1 y$w_buff1_used = y$w_buff0_used [L737] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L739] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L740] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L741] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L742] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L745] 1 x = 1 VAL [__unbuffered_cnt=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L762] 2 x = 2 VAL [__unbuffered_cnt=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L765] 2 y = 1 VAL [__unbuffered_cnt=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L748] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L749] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L750] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L751] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L752] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L757] 1 return 0; [L768] 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) [L768] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L768] 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) [L768] 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) [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L770] 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 [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L772] 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 [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L3] COND FALSE 0 !(!cond) [L799] 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) [L799] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L799] 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) [L799] 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) [L800] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L800] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L801] 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 [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L802] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L803] 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 [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 y$flush_delayed = weak$$choice2 [L809] 0 y$mem_tmp = y [L810] 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) [L810] 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) [L811] 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)) [L811] 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)) [L812] 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)) [L812] 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)) [L813] 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)) [L813] 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)) [L814] 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)) [L814] 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)) [L815] 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)) [L815] 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)) [L816] 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)) [L816] 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)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L818] 0 y = y$flush_delayed ? y$mem_tmp : y [L819] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 78 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 16.7s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 13.7s, HoareTripleCheckerStatistics: 182 SDtfs, 168 SDslu, 306 SDs, 0 SdLazy, 224 SolverSat, 58 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=194occurred 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.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 13 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 113 NumberOfCodeBlocks, 113 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 87 ConstructedInterpolants, 0 QuantifiedInterpolants, 6341 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...