./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe030_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_5b1c588f-f219-449b-84a2-59b9ccf7a532/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_5b1c588f-f219-449b-84a2-59b9ccf7a532/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_5b1c588f-f219-449b-84a2-59b9ccf7a532/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_5b1c588f-f219-449b-84a2-59b9ccf7a532/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe030_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_5b1c588f-f219-449b-84a2-59b9ccf7a532/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_5b1c588f-f219-449b-84a2-59b9ccf7a532/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f95b811d25aee10b6f2a8b74d7fa37a6425dbdbf ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2020-12-09 04:39:11,886 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 04:39:11,888 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 04:39:11,921 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 04:39:11,921 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 04:39:11,923 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 04:39:11,924 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 04:39:11,927 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 04:39:11,929 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 04:39:11,930 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 04:39:11,930 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 04:39:11,931 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 04:39:11,932 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 04:39:11,933 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 04:39:11,934 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 04:39:11,935 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 04:39:11,936 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 04:39:11,936 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 04:39:11,938 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 04:39:11,940 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 04:39:11,941 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 04:39:11,942 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 04:39:11,943 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 04:39:11,944 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 04:39:11,947 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 04:39:11,947 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 04:39:11,947 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 04:39:11,948 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 04:39:11,948 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 04:39:11,949 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 04:39:11,950 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 04:39:11,950 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 04:39:11,951 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 04:39:11,952 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 04:39:11,952 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 04:39:11,953 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 04:39:11,953 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 04:39:11,953 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 04:39:11,953 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 04:39:11,954 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 04:39:11,955 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 04:39:11,955 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_5b1c588f-f219-449b-84a2-59b9ccf7a532/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-09 04:39:11,972 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 04:39:11,972 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 04:39:11,973 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 04:39:11,973 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 04:39:11,973 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 04:39:11,974 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 04:39:11,974 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 04:39:11,974 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 04:39:11,974 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 04:39:11,974 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 04:39:11,974 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 04:39:11,974 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 04:39:11,975 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 04:39:11,975 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 04:39:11,975 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 04:39:11,975 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 04:39:11,975 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 04:39:11,976 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 04:39:11,976 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 04:39:11,976 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 04:39:11,976 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 04:39:11,976 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 04:39:11,976 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 04:39:11,976 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 04:39:11,977 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 04:39:11,977 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 04:39:11,977 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 04:39:11,977 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 04:39:11,977 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 04:39:11,977 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 04:39:11,977 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 04:39:11,978 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 04:39:11,978 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 04:39:11,978 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 04:39:11,978 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 04:39:11,978 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 04:39:11,978 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 04:39:11,978 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 04:39:11,979 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 04:39:11,979 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_5b1c588f-f219-449b-84a2-59b9ccf7a532/bin/utaipan/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_5b1c588f-f219-449b-84a2-59b9ccf7a532/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f95b811d25aee10b6f2a8b74d7fa37a6425dbdbf [2020-12-09 04:39:12,157 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 04:39:12,173 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 04:39:12,175 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 04:39:12,176 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 04:39:12,176 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 04:39:12,177 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_5b1c588f-f219-449b-84a2-59b9ccf7a532/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/safe030_power.opt.i [2020-12-09 04:39:12,222 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5b1c588f-f219-449b-84a2-59b9ccf7a532/bin/utaipan/data/00c8897eb/d97055d9b0714f39994c2706d667213d/FLAGb796cf47f [2020-12-09 04:39:12,644 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 04:39:12,645 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_5b1c588f-f219-449b-84a2-59b9ccf7a532/sv-benchmarks/c/pthread-wmm/safe030_power.opt.i [2020-12-09 04:39:12,656 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5b1c588f-f219-449b-84a2-59b9ccf7a532/bin/utaipan/data/00c8897eb/d97055d9b0714f39994c2706d667213d/FLAGb796cf47f [2020-12-09 04:39:12,669 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_5b1c588f-f219-449b-84a2-59b9ccf7a532/bin/utaipan/data/00c8897eb/d97055d9b0714f39994c2706d667213d [2020-12-09 04:39:12,671 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 04:39:12,673 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 04:39:12,674 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 04:39:12,674 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 04:39:12,677 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 04:39:12,677 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:39:12" (1/1) ... [2020-12-09 04:39:12,679 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@436aefc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:39:12, skipping insertion in model container [2020-12-09 04:39:12,679 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:39:12" (1/1) ... [2020-12-09 04:39:12,685 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 04:39:12,724 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 04:39:12,865 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_5b1c588f-f219-449b-84a2-59b9ccf7a532/sv-benchmarks/c/pthread-wmm/safe030_power.opt.i[951,964] [2020-12-09 04:39:12,964 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 04:39:12,971 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 04:39:12,979 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_5b1c588f-f219-449b-84a2-59b9ccf7a532/sv-benchmarks/c/pthread-wmm/safe030_power.opt.i[951,964] [2020-12-09 04:39:13,013 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 04:39:13,063 INFO L208 MainTranslator]: Completed translation [2020-12-09 04:39:13,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:39:13 WrapperNode [2020-12-09 04:39:13,064 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 04:39:13,065 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 04:39:13,065 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 04:39:13,065 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 04:39:13,074 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:39:13" (1/1) ... [2020-12-09 04:39:13,086 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:39:13" (1/1) ... [2020-12-09 04:39:13,113 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 04:39:13,114 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 04:39:13,114 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 04:39:13,114 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 04:39:13,121 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:39:13" (1/1) ... [2020-12-09 04:39:13,121 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:39:13" (1/1) ... [2020-12-09 04:39:13,125 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:39:13" (1/1) ... [2020-12-09 04:39:13,125 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:39:13" (1/1) ... [2020-12-09 04:39:13,135 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:39:13" (1/1) ... [2020-12-09 04:39:13,138 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:39:13" (1/1) ... [2020-12-09 04:39:13,142 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:39:13" (1/1) ... [2020-12-09 04:39:13,147 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 04:39:13,148 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 04:39:13,148 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 04:39:13,148 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 04:39:13,149 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:39:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5b1c588f-f219-449b-84a2-59b9ccf7a532/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 04:39:13,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-09 04:39:13,204 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-12-09 04:39:13,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 04:39:13,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-09 04:39:13,204 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-12-09 04:39:13,204 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-12-09 04:39:13,204 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-12-09 04:39:13,205 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-12-09 04:39:13,205 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-12-09 04:39:13,205 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-12-09 04:39:13,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 04:39:13,205 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-12-09 04:39:13,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 04:39:13,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 04:39:13,206 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-12-09 04:39:14,471 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 04:39:14,471 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2020-12-09 04:39:14,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:39:14 BoogieIcfgContainer [2020-12-09 04:39:14,472 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 04:39:14,473 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 04:39:14,474 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 04:39:14,476 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 04:39:14,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 04:39:12" (1/3) ... [2020-12-09 04:39:14,476 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ff93618 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:39:14, skipping insertion in model container [2020-12-09 04:39:14,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:39:13" (2/3) ... [2020-12-09 04:39:14,477 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ff93618 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:39:14, skipping insertion in model container [2020-12-09 04:39:14,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:39:14" (3/3) ... [2020-12-09 04:39:14,478 INFO L111 eAbstractionObserver]: Analyzing ICFG safe030_power.opt.i [2020-12-09 04:39:14,488 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-09 04:39:14,488 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 04:39:14,490 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-09 04:39:14,491 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-09 04:39:14,519 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,519 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,519 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,519 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,519 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,519 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,520 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,520 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,520 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,520 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,520 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,520 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,520 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,520 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,521 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,521 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,521 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,521 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,521 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,521 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,521 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,521 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,521 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,521 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,521 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,522 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,522 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,522 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,522 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,522 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,522 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,522 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,522 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,522 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,523 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,524 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,524 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,524 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,524 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,524 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,524 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,524 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,524 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,524 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,524 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,525 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,525 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,529 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,529 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,529 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,529 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,530 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,530 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,531 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,531 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,531 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,531 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,531 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,531 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,531 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,531 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,532 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,533 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,533 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,533 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,533 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,533 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,533 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,533 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,533 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,533 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,533 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,534 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 04:39:14,535 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-12-09 04:39:14,542 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-12-09 04:39:14,556 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 04:39:14,556 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 04:39:14,556 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 04:39:14,556 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 04:39:14,556 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 04:39:14,556 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 04:39:14,556 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 04:39:14,556 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 04:39:14,564 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-12-09 04:39:14,566 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 95 transitions, 205 flow [2020-12-09 04:39:14,568 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 95 transitions, 205 flow [2020-12-09 04:39:14,569 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 103 places, 95 transitions, 205 flow [2020-12-09 04:39:14,598 INFO L129 PetriNetUnfolder]: 2/92 cut-off events. [2020-12-09 04:39:14,598 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-12-09 04:39:14,601 INFO L84 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 92 events. 2/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 65 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-12-09 04:39:14,603 INFO L116 LiptonReduction]: Number of co-enabled transitions 1578 [2020-12-09 04:39:14,737 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-12-09 04:39:14,737 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 04:39:15,071 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-12-09 04:39:15,071 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 04:39:15,106 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 04:39:15,107 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 04:39:15,107 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-09 04:39:15,108 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 04:39:15,134 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 04:39:15,135 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:15,136 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 04:39:15,136 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:15,492 WARN L197 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-12-09 04:39:15,840 WARN L197 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2020-12-09 04:39:15,952 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2020-12-09 04:39:16,160 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 04:39:16,160 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:16,161 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 04:39:16,161 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:16,201 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 4, 4, 3, 2, 1] term [2020-12-09 04:39:16,201 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:16,202 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 2, 1] term [2020-12-09 04:39:16,202 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:16,203 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 4, 4, 3, 2, 1] term [2020-12-09 04:39:16,203 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:16,207 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 04:39:16,207 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:16,208 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 04:39:16,208 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:16,234 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 04:39:16,234 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:16,235 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 04:39:16,235 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:16,257 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 04:39:16,258 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 04:39:16,258 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-09 04:39:16,258 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 04:39:16,303 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 04:39:16,303 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:16,304 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 04:39:16,304 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:16,306 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-12-09 04:39:16,307 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 04:39:16,309 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-12-09 04:39:16,309 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:16,347 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 04:39:16,348 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 04:39:16,351 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 04:39:16,352 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:16,352 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 04:39:16,352 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:16,355 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 04:39:16,355 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 04:39:16,357 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 04:39:16,357 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 04:39:16,358 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 04:39:16,358 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 04:39:16,360 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 04:39:16,360 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:16,361 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 04:39:16,361 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:16,363 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 04:39:16,363 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:16,417 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 04:39:16,417 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:16,418 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 04:39:16,418 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:16,436 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 04:39:16,436 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 04:39:16,436 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term [2020-12-09 04:39:16,436 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 04:39:16,489 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 04:39:16,489 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 04:39:16,490 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 04:39:16,490 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:16,491 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 04:39:16,491 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:16,493 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 04:39:16,493 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 04:39:16,494 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 04:39:16,494 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 04:39:16,496 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 04:39:16,496 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 04:39:16,497 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 04:39:16,498 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:16,499 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 04:39:16,499 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:16,500 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 04:39:16,500 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:16,538 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 04:39:16,539 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:16,539 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 04:39:16,539 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:16,541 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-12-09 04:39:16,541 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 04:39:16,543 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-12-09 04:39:16,543 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:16,692 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 04:39:16,692 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:16,693 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 04:39:16,693 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:16,695 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-12-09 04:39:16,695 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 04:39:16,697 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-12-09 04:39:16,697 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:16,745 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 04:39:16,745 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 04:39:16,747 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 04:39:16,747 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:16,747 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 04:39:16,748 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:16,750 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 04:39:16,750 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 04:39:16,751 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 04:39:16,751 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 04:39:16,752 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 04:39:16,752 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 04:39:16,755 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 04:39:16,755 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:16,757 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 04:39:16,757 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:16,758 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 04:39:16,758 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:17,083 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-12-09 04:39:17,206 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-12-09 04:39:17,347 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 04:39:17,347 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:17,348 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 04:39:17,348 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:17,364 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 04:39:17,365 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:17,365 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 04:39:17,365 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:17,392 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 04:39:17,392 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:17,393 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 04:39:17,393 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:17,412 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 04:39:17,412 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 04:39:17,413 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-09 04:39:17,413 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 04:39:17,435 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 04:39:17,435 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:17,435 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 04:39:17,435 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:17,461 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 04:39:17,461 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:17,461 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 04:39:17,461 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:17,482 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 04:39:17,483 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 04:39:17,483 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term [2020-12-09 04:39:17,483 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 04:39:17,499 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 04:39:17,499 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:17,499 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 04:39:17,499 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:17,581 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 04:39:17,581 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 04:39:17,581 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-09 04:39:17,581 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 04:39:17,600 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 04:39:17,600 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:17,601 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 04:39:17,601 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:17,638 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 04:39:17,638 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 04:39:17,639 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 04:39:17,640 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:17,640 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 04:39:17,640 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:17,642 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 04:39:17,642 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 04:39:17,643 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 04:39:17,643 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 04:39:17,644 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 04:39:17,644 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 04:39:17,646 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 04:39:17,646 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:17,647 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 04:39:17,647 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:17,648 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 04:39:17,648 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:17,685 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 04:39:17,685 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:17,685 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-09 04:39:17,685 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:17,687 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-12-09 04:39:17,687 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 04:39:17,689 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-12-09 04:39:17,689 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:17,850 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 04:39:17,850 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 04:39:17,851 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 04:39:17,851 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 04:39:17,853 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 04:39:17,853 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 04:39:17,854 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 04:39:17,855 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 04:39:17,870 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 04:39:17,870 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 04:39:17,871 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 04:39:17,871 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 04:39:17,872 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 04:39:17,873 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:17,874 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 04:39:17,874 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:18,062 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 04:39:18,062 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 04:39:18,063 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 04:39:18,063 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 04:39:18,064 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 04:39:18,064 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:18,066 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 04:39:18,066 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:18,081 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 04:39:18,081 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 04:39:18,082 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 04:39:18,082 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 04:39:18,083 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 04:39:18,083 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 04:39:18,085 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 04:39:18,085 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 04:39:18,337 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 04:39:18,338 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 04:39:18,338 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 04:39:18,338 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 04:39:18,339 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 04:39:18,339 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 04:39:18,340 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 04:39:18,340 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 04:39:18,352 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 04:39:18,353 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 04:39:18,353 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 04:39:18,354 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 04:39:18,355 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 04:39:18,355 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:18,357 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 04:39:18,357 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:18,381 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 04:39:18,381 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 04:39:18,381 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 04:39:18,381 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 04:39:18,382 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 04:39:18,382 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:18,383 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 04:39:18,383 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 04:39:18,395 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 04:39:18,395 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 04:39:18,396 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 04:39:18,396 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 04:39:18,397 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 04:39:18,397 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 04:39:18,398 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 04:39:18,398 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 04:39:19,396 WARN L197 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2020-12-09 04:39:19,521 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-12-09 04:39:19,795 WARN L197 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2020-12-09 04:39:19,926 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-12-09 04:39:19,933 INFO L131 LiptonReduction]: Checked pairs total: 3915 [2020-12-09 04:39:19,933 INFO L133 LiptonReduction]: Total number of compositions: 80 [2020-12-09 04:39:19,936 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 27 transitions, 69 flow [2020-12-09 04:39:19,966 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 770 states. [2020-12-09 04:39:19,968 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states. [2020-12-09 04:39:19,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-12-09 04:39:19,971 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 04:39:19,971 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-12-09 04:39:19,972 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 04:39:19,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 04:39:19,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1491491518, now seen corresponding path program 1 times [2020-12-09 04:39:19,981 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 04:39:19,982 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270312342] [2020-12-09 04:39:19,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 04:39:20,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:39:20,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 04:39:20,131 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270312342] [2020-12-09 04:39:20,132 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 04:39:20,132 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-09 04:39:20,132 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955578097] [2020-12-09 04:39:20,135 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 04:39:20,135 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 04:39:20,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 04:39:20,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 04:39:20,145 INFO L87 Difference]: Start difference. First operand 770 states. Second operand 3 states. [2020-12-09 04:39:20,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 04:39:20,200 INFO L93 Difference]: Finished difference Result 650 states and 2028 transitions. [2020-12-09 04:39:20,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 04:39:20,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-12-09 04:39:20,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 04:39:20,215 INFO L225 Difference]: With dead ends: 650 [2020-12-09 04:39:20,215 INFO L226 Difference]: Without dead ends: 550 [2020-12-09 04:39:20,216 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 04:39:20,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2020-12-09 04:39:20,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2020-12-09 04:39:20,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2020-12-09 04:39:20,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 1693 transitions. [2020-12-09 04:39:20,272 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 1693 transitions. Word has length 7 [2020-12-09 04:39:20,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 04:39:20,273 INFO L481 AbstractCegarLoop]: Abstraction has 550 states and 1693 transitions. [2020-12-09 04:39:20,273 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 04:39:20,273 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 1693 transitions. [2020-12-09 04:39:20,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-09 04:39:20,274 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 04:39:20,274 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 04:39:20,275 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 04:39:20,275 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 04:39:20,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 04:39:20,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1589045551, now seen corresponding path program 1 times [2020-12-09 04:39:20,275 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 04:39:20,275 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312185600] [2020-12-09 04:39:20,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 04:39:20,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:39:20,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 04:39:20,379 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312185600] [2020-12-09 04:39:20,379 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 04:39:20,379 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 04:39:20,379 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699045773] [2020-12-09 04:39:20,380 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 04:39:20,380 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 04:39:20,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 04:39:20,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 04:39:20,381 INFO L87 Difference]: Start difference. First operand 550 states and 1693 transitions. Second operand 4 states. [2020-12-09 04:39:20,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 04:39:20,414 INFO L93 Difference]: Finished difference Result 630 states and 1862 transitions. [2020-12-09 04:39:20,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 04:39:20,414 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-12-09 04:39:20,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 04:39:20,418 INFO L225 Difference]: With dead ends: 630 [2020-12-09 04:39:20,418 INFO L226 Difference]: Without dead ends: 530 [2020-12-09 04:39:20,419 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 04:39:20,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2020-12-09 04:39:20,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2020-12-09 04:39:20,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2020-12-09 04:39:20,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1617 transitions. [2020-12-09 04:39:20,437 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 1617 transitions. Word has length 10 [2020-12-09 04:39:20,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 04:39:20,437 INFO L481 AbstractCegarLoop]: Abstraction has 530 states and 1617 transitions. [2020-12-09 04:39:20,437 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 04:39:20,437 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 1617 transitions. [2020-12-09 04:39:20,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-09 04:39:20,439 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 04:39:20,439 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 04:39:20,439 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-09 04:39:20,439 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 04:39:20,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 04:39:20,439 INFO L82 PathProgramCache]: Analyzing trace with hash 2015868599, now seen corresponding path program 1 times [2020-12-09 04:39:20,439 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 04:39:20,439 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153566359] [2020-12-09 04:39:20,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 04:39:20,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:39:20,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 04:39:20,521 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153566359] [2020-12-09 04:39:20,521 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 04:39:20,521 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 04:39:20,521 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031888131] [2020-12-09 04:39:20,522 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 04:39:20,522 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 04:39:20,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 04:39:20,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 04:39:20,522 INFO L87 Difference]: Start difference. First operand 530 states and 1617 transitions. Second operand 4 states. [2020-12-09 04:39:20,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 04:39:20,555 INFO L93 Difference]: Finished difference Result 604 states and 1772 transitions. [2020-12-09 04:39:20,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 04:39:20,556 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-12-09 04:39:20,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 04:39:20,559 INFO L225 Difference]: With dead ends: 604 [2020-12-09 04:39:20,559 INFO L226 Difference]: Without dead ends: 514 [2020-12-09 04:39:20,559 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 04:39:20,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2020-12-09 04:39:20,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 514. [2020-12-09 04:39:20,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514 states. [2020-12-09 04:39:20,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 1557 transitions. [2020-12-09 04:39:20,572 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 1557 transitions. Word has length 11 [2020-12-09 04:39:20,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 04:39:20,572 INFO L481 AbstractCegarLoop]: Abstraction has 514 states and 1557 transitions. [2020-12-09 04:39:20,572 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 04:39:20,572 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 1557 transitions. [2020-12-09 04:39:20,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-09 04:39:20,573 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 04:39:20,573 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 04:39:20,573 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-09 04:39:20,573 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 04:39:20,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 04:39:20,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1932541835, now seen corresponding path program 1 times [2020-12-09 04:39:20,574 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 04:39:20,574 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059345848] [2020-12-09 04:39:20,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 04:39:20,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:39:20,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 04:39:20,632 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059345848] [2020-12-09 04:39:20,633 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 04:39:20,633 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 04:39:20,633 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234878208] [2020-12-09 04:39:20,633 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 04:39:20,633 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 04:39:20,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 04:39:20,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 04:39:20,634 INFO L87 Difference]: Start difference. First operand 514 states and 1557 transitions. Second operand 4 states. [2020-12-09 04:39:20,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 04:39:20,665 INFO L93 Difference]: Finished difference Result 800 states and 2294 transitions. [2020-12-09 04:39:20,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 04:39:20,665 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-12-09 04:39:20,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 04:39:20,669 INFO L225 Difference]: With dead ends: 800 [2020-12-09 04:39:20,669 INFO L226 Difference]: Without dead ends: 574 [2020-12-09 04:39:20,669 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 04:39:20,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-12-09 04:39:20,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 494. [2020-12-09 04:39:20,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2020-12-09 04:39:20,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 1423 transitions. [2020-12-09 04:39:20,681 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 1423 transitions. Word has length 12 [2020-12-09 04:39:20,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 04:39:20,681 INFO L481 AbstractCegarLoop]: Abstraction has 494 states and 1423 transitions. [2020-12-09 04:39:20,681 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 04:39:20,681 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 1423 transitions. [2020-12-09 04:39:20,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-09 04:39:20,682 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 04:39:20,682 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 04:39:20,682 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-09 04:39:20,682 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 04:39:20,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 04:39:20,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1932500512, now seen corresponding path program 1 times [2020-12-09 04:39:20,683 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 04:39:20,683 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102796522] [2020-12-09 04:39:20,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 04:39:20,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:39:20,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 04:39:20,782 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102796522] [2020-12-09 04:39:20,782 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 04:39:20,782 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 04:39:20,782 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758764397] [2020-12-09 04:39:20,782 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 04:39:20,783 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 04:39:20,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 04:39:20,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 04:39:20,783 INFO L87 Difference]: Start difference. First operand 494 states and 1423 transitions. Second operand 5 states. [2020-12-09 04:39:20,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 04:39:20,862 INFO L93 Difference]: Finished difference Result 548 states and 1537 transitions. [2020-12-09 04:39:20,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 04:39:20,863 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-12-09 04:39:20,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 04:39:20,866 INFO L225 Difference]: With dead ends: 548 [2020-12-09 04:39:20,866 INFO L226 Difference]: Without dead ends: 488 [2020-12-09 04:39:20,866 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-09 04:39:20,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2020-12-09 04:39:20,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 488. [2020-12-09 04:39:20,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2020-12-09 04:39:20,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 1401 transitions. [2020-12-09 04:39:20,877 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 1401 transitions. Word has length 12 [2020-12-09 04:39:20,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 04:39:20,877 INFO L481 AbstractCegarLoop]: Abstraction has 488 states and 1401 transitions. [2020-12-09 04:39:20,877 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 04:39:20,877 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 1401 transitions. [2020-12-09 04:39:20,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-09 04:39:20,878 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 04:39:20,878 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 04:39:20,878 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-09 04:39:20,878 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 04:39:20,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 04:39:20,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1901119999, now seen corresponding path program 1 times [2020-12-09 04:39:20,879 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 04:39:20,879 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929969205] [2020-12-09 04:39:20,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 04:39:20,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:39:20,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 04:39:20,928 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929969205] [2020-12-09 04:39:20,929 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 04:39:20,929 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 04:39:20,929 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786203676] [2020-12-09 04:39:20,929 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 04:39:20,929 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 04:39:20,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 04:39:20,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 04:39:20,930 INFO L87 Difference]: Start difference. First operand 488 states and 1401 transitions. Second operand 4 states. [2020-12-09 04:39:20,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 04:39:20,961 INFO L93 Difference]: Finished difference Result 755 states and 2074 transitions. [2020-12-09 04:39:20,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 04:39:20,962 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-12-09 04:39:20,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 04:39:20,965 INFO L225 Difference]: With dead ends: 755 [2020-12-09 04:39:20,965 INFO L226 Difference]: Without dead ends: 536 [2020-12-09 04:39:20,965 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 04:39:20,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2020-12-09 04:39:20,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 464. [2020-12-09 04:39:20,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2020-12-09 04:39:20,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 1274 transitions. [2020-12-09 04:39:20,976 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 1274 transitions. Word has length 13 [2020-12-09 04:39:20,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 04:39:20,976 INFO L481 AbstractCegarLoop]: Abstraction has 464 states and 1274 transitions. [2020-12-09 04:39:20,976 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 04:39:20,976 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 1274 transitions. [2020-12-09 04:39:20,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-09 04:39:20,977 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 04:39:20,977 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 04:39:20,977 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-09 04:39:20,977 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 04:39:20,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 04:39:20,977 INFO L82 PathProgramCache]: Analyzing trace with hash -734667343, now seen corresponding path program 1 times [2020-12-09 04:39:20,977 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 04:39:20,978 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491059592] [2020-12-09 04:39:20,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 04:39:20,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:39:21,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 04:39:21,076 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491059592] [2020-12-09 04:39:21,076 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 04:39:21,076 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 04:39:21,076 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080284616] [2020-12-09 04:39:21,077 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 04:39:21,077 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 04:39:21,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 04:39:21,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-09 04:39:21,077 INFO L87 Difference]: Start difference. First operand 464 states and 1274 transitions. Second operand 6 states. [2020-12-09 04:39:21,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 04:39:21,171 INFO L93 Difference]: Finished difference Result 528 states and 1420 transitions. [2020-12-09 04:39:21,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 04:39:21,172 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-12-09 04:39:21,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 04:39:21,175 INFO L225 Difference]: With dead ends: 528 [2020-12-09 04:39:21,176 INFO L226 Difference]: Without dead ends: 480 [2020-12-09 04:39:21,176 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-12-09 04:39:21,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2020-12-09 04:39:21,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 480. [2020-12-09 04:39:21,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2020-12-09 04:39:21,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 1310 transitions. [2020-12-09 04:39:21,192 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 1310 transitions. Word has length 13 [2020-12-09 04:39:21,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 04:39:21,192 INFO L481 AbstractCegarLoop]: Abstraction has 480 states and 1310 transitions. [2020-12-09 04:39:21,192 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 04:39:21,193 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 1310 transitions. [2020-12-09 04:39:21,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-09 04:39:21,194 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 04:39:21,194 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 04:39:21,194 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-09 04:39:21,194 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 04:39:21,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 04:39:21,194 INFO L82 PathProgramCache]: Analyzing trace with hash 203161555, now seen corresponding path program 2 times [2020-12-09 04:39:21,194 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 04:39:21,195 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663771492] [2020-12-09 04:39:21,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 04:39:21,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:39:21,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 04:39:21,302 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663771492] [2020-12-09 04:39:21,302 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 04:39:21,302 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 04:39:21,302 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664173194] [2020-12-09 04:39:21,302 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 04:39:21,302 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 04:39:21,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 04:39:21,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-09 04:39:21,303 INFO L87 Difference]: Start difference. First operand 480 states and 1310 transitions. Second operand 6 states. [2020-12-09 04:39:21,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 04:39:21,399 INFO L93 Difference]: Finished difference Result 507 states and 1340 transitions. [2020-12-09 04:39:21,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 04:39:21,400 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-12-09 04:39:21,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 04:39:21,402 INFO L225 Difference]: With dead ends: 507 [2020-12-09 04:39:21,402 INFO L226 Difference]: Without dead ends: 450 [2020-12-09 04:39:21,403 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-12-09 04:39:21,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2020-12-09 04:39:21,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 434. [2020-12-09 04:39:21,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2020-12-09 04:39:21,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1164 transitions. [2020-12-09 04:39:21,413 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 1164 transitions. Word has length 13 [2020-12-09 04:39:21,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 04:39:21,413 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 1164 transitions. [2020-12-09 04:39:21,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 04:39:21,413 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 1164 transitions. [2020-12-09 04:39:21,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-09 04:39:21,414 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 04:39:21,414 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 04:39:21,414 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-09 04:39:21,414 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 04:39:21,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 04:39:21,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1705621535, now seen corresponding path program 1 times [2020-12-09 04:39:21,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 04:39:21,415 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942283898] [2020-12-09 04:39:21,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 04:39:21,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:39:21,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 04:39:21,526 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942283898] [2020-12-09 04:39:21,527 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 04:39:21,527 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 04:39:21,527 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094462519] [2020-12-09 04:39:21,527 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 04:39:21,527 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 04:39:21,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 04:39:21,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-09 04:39:21,527 INFO L87 Difference]: Start difference. First operand 434 states and 1164 transitions. Second operand 6 states. [2020-12-09 04:39:21,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 04:39:21,618 INFO L93 Difference]: Finished difference Result 476 states and 1255 transitions. [2020-12-09 04:39:21,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 04:39:21,619 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-12-09 04:39:21,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 04:39:21,621 INFO L225 Difference]: With dead ends: 476 [2020-12-09 04:39:21,621 INFO L226 Difference]: Without dead ends: 446 [2020-12-09 04:39:21,621 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-09 04:39:21,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2020-12-09 04:39:21,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 446. [2020-12-09 04:39:21,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2020-12-09 04:39:21,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 1190 transitions. [2020-12-09 04:39:21,631 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 1190 transitions. Word has length 14 [2020-12-09 04:39:21,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 04:39:21,632 INFO L481 AbstractCegarLoop]: Abstraction has 446 states and 1190 transitions. [2020-12-09 04:39:21,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 04:39:21,632 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 1190 transitions. [2020-12-09 04:39:21,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-09 04:39:21,632 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 04:39:21,632 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 04:39:21,632 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-09 04:39:21,633 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 04:39:21,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 04:39:21,633 INFO L82 PathProgramCache]: Analyzing trace with hash -821783747, now seen corresponding path program 2 times [2020-12-09 04:39:21,633 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 04:39:21,633 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877065097] [2020-12-09 04:39:21,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 04:39:21,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:39:21,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 04:39:21,805 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877065097] [2020-12-09 04:39:21,805 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 04:39:21,805 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 04:39:21,805 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773843969] [2020-12-09 04:39:21,805 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 04:39:21,805 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 04:39:21,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 04:39:21,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-09 04:39:21,806 INFO L87 Difference]: Start difference. First operand 446 states and 1190 transitions. Second operand 7 states. [2020-12-09 04:39:21,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 04:39:21,906 INFO L93 Difference]: Finished difference Result 464 states and 1217 transitions. [2020-12-09 04:39:21,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 04:39:21,907 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-12-09 04:39:21,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 04:39:21,909 INFO L225 Difference]: With dead ends: 464 [2020-12-09 04:39:21,909 INFO L226 Difference]: Without dead ends: 434 [2020-12-09 04:39:21,909 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-12-09 04:39:21,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2020-12-09 04:39:21,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 422. [2020-12-09 04:39:21,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2020-12-09 04:39:21,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 1126 transitions. [2020-12-09 04:39:21,920 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 1126 transitions. Word has length 14 [2020-12-09 04:39:21,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 04:39:21,920 INFO L481 AbstractCegarLoop]: Abstraction has 422 states and 1126 transitions. [2020-12-09 04:39:21,920 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 04:39:21,921 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 1126 transitions. [2020-12-09 04:39:21,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-09 04:39:21,922 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 04:39:21,922 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 04:39:21,922 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-09 04:39:21,922 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 04:39:21,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 04:39:21,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1670281230, now seen corresponding path program 1 times [2020-12-09 04:39:21,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 04:39:21,923 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581386906] [2020-12-09 04:39:21,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 04:39:21,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:39:21,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 04:39:21,987 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581386906] [2020-12-09 04:39:21,987 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 04:39:21,987 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 04:39:21,987 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403632099] [2020-12-09 04:39:21,987 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 04:39:21,987 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 04:39:21,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 04:39:21,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 04:39:21,988 INFO L87 Difference]: Start difference. First operand 422 states and 1126 transitions. Second operand 4 states. [2020-12-09 04:39:22,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 04:39:22,011 INFO L93 Difference]: Finished difference Result 406 states and 950 transitions. [2020-12-09 04:39:22,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 04:39:22,011 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-12-09 04:39:22,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 04:39:22,013 INFO L225 Difference]: With dead ends: 406 [2020-12-09 04:39:22,013 INFO L226 Difference]: Without dead ends: 306 [2020-12-09 04:39:22,013 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 04:39:22,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2020-12-09 04:39:22,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2020-12-09 04:39:22,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2020-12-09 04:39:22,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 702 transitions. [2020-12-09 04:39:22,019 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 702 transitions. Word has length 15 [2020-12-09 04:39:22,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 04:39:22,019 INFO L481 AbstractCegarLoop]: Abstraction has 306 states and 702 transitions. [2020-12-09 04:39:22,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 04:39:22,019 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 702 transitions. [2020-12-09 04:39:22,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 04:39:22,020 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 04:39:22,020 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 04:39:22,020 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-09 04:39:22,020 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 04:39:22,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 04:39:22,020 INFO L82 PathProgramCache]: Analyzing trace with hash -942899002, now seen corresponding path program 1 times [2020-12-09 04:39:22,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 04:39:22,021 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852806281] [2020-12-09 04:39:22,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 04:39:22,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:39:22,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 04:39:22,086 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852806281] [2020-12-09 04:39:22,086 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 04:39:22,086 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 04:39:22,086 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149528534] [2020-12-09 04:39:22,087 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 04:39:22,087 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 04:39:22,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 04:39:22,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 04:39:22,087 INFO L87 Difference]: Start difference. First operand 306 states and 702 transitions. Second operand 5 states. [2020-12-09 04:39:22,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 04:39:22,117 INFO L93 Difference]: Finished difference Result 244 states and 502 transitions. [2020-12-09 04:39:22,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 04:39:22,118 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-12-09 04:39:22,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 04:39:22,119 INFO L225 Difference]: With dead ends: 244 [2020-12-09 04:39:22,119 INFO L226 Difference]: Without dead ends: 176 [2020-12-09 04:39:22,119 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-09 04:39:22,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-12-09 04:39:22,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2020-12-09 04:39:22,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2020-12-09 04:39:22,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 342 transitions. [2020-12-09 04:39:22,124 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 342 transitions. Word has length 16 [2020-12-09 04:39:22,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 04:39:22,124 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 342 transitions. [2020-12-09 04:39:22,124 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 04:39:22,124 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 342 transitions. [2020-12-09 04:39:22,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-09 04:39:22,125 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 04:39:22,125 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 04:39:22,125 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-09 04:39:22,125 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 04:39:22,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 04:39:22,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1796959845, now seen corresponding path program 1 times [2020-12-09 04:39:22,125 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 04:39:22,126 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248593201] [2020-12-09 04:39:22,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 04:39:22,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:39:22,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 04:39:22,189 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248593201] [2020-12-09 04:39:22,189 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 04:39:22,189 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 04:39:22,189 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020146044] [2020-12-09 04:39:22,189 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 04:39:22,190 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 04:39:22,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 04:39:22,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-09 04:39:22,190 INFO L87 Difference]: Start difference. First operand 176 states and 342 transitions. Second operand 6 states. [2020-12-09 04:39:22,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 04:39:22,226 INFO L93 Difference]: Finished difference Result 150 states and 290 transitions. [2020-12-09 04:39:22,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 04:39:22,227 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-12-09 04:39:22,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 04:39:22,227 INFO L225 Difference]: With dead ends: 150 [2020-12-09 04:39:22,227 INFO L226 Difference]: Without dead ends: 48 [2020-12-09 04:39:22,228 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-12-09 04:39:22,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-12-09 04:39:22,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-12-09 04:39:22,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-12-09 04:39:22,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 81 transitions. [2020-12-09 04:39:22,229 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 81 transitions. Word has length 18 [2020-12-09 04:39:22,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 04:39:22,229 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 81 transitions. [2020-12-09 04:39:22,229 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 04:39:22,229 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 81 transitions. [2020-12-09 04:39:22,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-09 04:39:22,230 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 04:39:22,230 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 04:39:22,230 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-09 04:39:22,230 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 04:39:22,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 04:39:22,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1886722460, now seen corresponding path program 1 times [2020-12-09 04:39:22,231 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 04:39:22,231 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561379761] [2020-12-09 04:39:22,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 04:39:22,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 04:39:22,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 04:39:22,453 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561379761] [2020-12-09 04:39:22,453 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 04:39:22,453 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-09 04:39:22,454 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736154846] [2020-12-09 04:39:22,454 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-09 04:39:22,454 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 04:39:22,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-09 04:39:22,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-12-09 04:39:22,454 INFO L87 Difference]: Start difference. First operand 48 states and 81 transitions. Second operand 9 states. [2020-12-09 04:39:22,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 04:39:22,632 INFO L93 Difference]: Finished difference Result 75 states and 120 transitions. [2020-12-09 04:39:22,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 04:39:22,632 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-12-09 04:39:22,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 04:39:22,633 INFO L225 Difference]: With dead ends: 75 [2020-12-09 04:39:22,633 INFO L226 Difference]: Without dead ends: 48 [2020-12-09 04:39:22,633 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-12-09 04:39:22,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-12-09 04:39:22,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 36. [2020-12-09 04:39:22,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-12-09 04:39:22,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 53 transitions. [2020-12-09 04:39:22,634 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 53 transitions. Word has length 21 [2020-12-09 04:39:22,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 04:39:22,634 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 53 transitions. [2020-12-09 04:39:22,634 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-09 04:39:22,634 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 53 transitions. [2020-12-09 04:39:22,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-09 04:39:22,634 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 04:39:22,634 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 04:39:22,634 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-09 04:39:22,634 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 04:39:22,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 04:39:22,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1747085148, now seen corresponding path program 2 times [2020-12-09 04:39:22,635 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 04:39:22,635 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393670338] [2020-12-09 04:39:22,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 04:39:22,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 04:39:22,662 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 04:39:22,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 04:39:22,697 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 04:39:22,719 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-12-09 04:39:22,720 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-09 04:39:22,720 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-09 04:39:22,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 04:39:22 BasicIcfg [2020-12-09 04:39:22,786 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 04:39:22,787 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 04:39:22,787 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 04:39:22,787 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 04:39:22,787 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:39:14" (3/4) ... [2020-12-09 04:39:22,789 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-09 04:39:22,862 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_5b1c588f-f219-449b-84a2-59b9ccf7a532/bin/utaipan/witness.graphml [2020-12-09 04:39:22,862 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 04:39:22,863 INFO L168 Benchmark]: Toolchain (without parser) took 10190.49 ms. Allocated memory was 83.9 MB in the beginning and 264.2 MB in the end (delta: 180.4 MB). Free memory was 50.2 MB in the beginning and 119.0 MB in the end (delta: -68.8 MB). Peak memory consumption was 110.0 MB. Max. memory is 16.1 GB. [2020-12-09 04:39:22,863 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 83.9 MB. Free memory was 42.0 MB in the beginning and 42.0 MB in the end (delta: 63.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 04:39:22,864 INFO L168 Benchmark]: CACSL2BoogieTranslator took 389.90 ms. Allocated memory is still 83.9 MB. Free memory was 50.0 MB in the beginning and 34.5 MB in the end (delta: 15.5 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2020-12-09 04:39:22,864 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.73 ms. Allocated memory was 83.9 MB in the beginning and 104.9 MB in the end (delta: 21.0 MB). Free memory was 34.5 MB in the beginning and 81.9 MB in the end (delta: -47.4 MB). Peak memory consumption was 8.2 MB. Max. memory is 16.1 GB. [2020-12-09 04:39:22,864 INFO L168 Benchmark]: Boogie Preprocessor took 33.41 ms. Allocated memory is still 104.9 MB. Free memory was 81.9 MB in the beginning and 79.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 04:39:22,864 INFO L168 Benchmark]: RCFGBuilder took 1324.67 ms. Allocated memory was 104.9 MB in the beginning and 125.8 MB in the end (delta: 21.0 MB). Free memory was 79.8 MB in the beginning and 44.5 MB in the end (delta: 35.3 MB). Peak memory consumption was 56.0 MB. Max. memory is 16.1 GB. [2020-12-09 04:39:22,865 INFO L168 Benchmark]: TraceAbstraction took 8312.73 ms. Allocated memory was 125.8 MB in the beginning and 264.2 MB in the end (delta: 138.4 MB). Free memory was 43.4 MB in the beginning and 130.5 MB in the end (delta: -87.1 MB). Peak memory consumption was 51.3 MB. Max. memory is 16.1 GB. [2020-12-09 04:39:22,865 INFO L168 Benchmark]: Witness Printer took 75.90 ms. Allocated memory is still 264.2 MB. Free memory was 130.5 MB in the beginning and 119.0 MB in the end (delta: 11.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-12-09 04:39:22,866 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 83.9 MB. Free memory was 42.0 MB in the beginning and 42.0 MB in the end (delta: 63.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 389.90 ms. Allocated memory is still 83.9 MB. Free memory was 50.0 MB in the beginning and 34.5 MB in the end (delta: 15.5 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 48.73 ms. Allocated memory was 83.9 MB in the beginning and 104.9 MB in the end (delta: 21.0 MB). Free memory was 34.5 MB in the beginning and 81.9 MB in the end (delta: -47.4 MB). Peak memory consumption was 8.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 33.41 ms. Allocated memory is still 104.9 MB. Free memory was 81.9 MB in the beginning and 79.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1324.67 ms. Allocated memory was 104.9 MB in the beginning and 125.8 MB in the end (delta: 21.0 MB). Free memory was 79.8 MB in the beginning and 44.5 MB in the end (delta: 35.3 MB). Peak memory consumption was 56.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 8312.73 ms. Allocated memory was 125.8 MB in the beginning and 264.2 MB in the end (delta: 138.4 MB). Free memory was 43.4 MB in the beginning and 130.5 MB in the end (delta: -87.1 MB). Peak memory consumption was 51.3 MB. Max. memory is 16.1 GB. * Witness Printer took 75.90 ms. Allocated memory is still 264.2 MB. Free memory was 130.5 MB in the beginning and 119.0 MB in the end (delta: 11.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1011 VarBasedMoverChecksPositive, 59 VarBasedMoverChecksNegative, 20 SemBasedMoverChecksPositive, 39 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 119 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 5.3s, 103 PlacesBefore, 36 PlacesAfterwards, 95 TransitionsBefore, 27 TransitionsAfterwards, 1578 CoEnabledTransitionPairs, 6 FixpointIterations, 34 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 80 TotalNumberOfCompositions, 3915 MoverChecksTotal - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L716] 0 _Bool y$flush_delayed; [L717] 0 int y$mem_tmp; [L718] 0 _Bool y$r_buff0_thd0; [L719] 0 _Bool y$r_buff0_thd1; [L720] 0 _Bool y$r_buff0_thd2; [L721] 0 _Bool y$r_buff0_thd3; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$r_buff1_thd3; [L726] 0 _Bool y$read_delayed; [L727] 0 int *y$read_delayed_var; [L728] 0 int y$w_buff0; [L729] 0 _Bool y$w_buff0_used; [L730] 0 int y$w_buff1; [L731] 0 _Bool y$w_buff1_used; [L733] 0 int z = 0; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L811] 0 pthread_t t2492; [L812] FCALL, FORK 0 pthread_create(&t2492, ((void *)0), P0, ((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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L813] 0 pthread_t t2493; [L814] FCALL, FORK 0 pthread_create(&t2493, ((void *)0), P1, ((void *)0)) 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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 0 pthread_t t2494; [L816] FCALL, FORK 0 pthread_create(&t2494, ((void *)0), P2, ((void *)0)) 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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L774] 3 y$w_buff1 = y$w_buff0 [L775] 3 y$w_buff0 = 2 [L776] 3 y$w_buff1_used = y$w_buff0_used [L777] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L779] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = (_Bool)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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] 3 z = 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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 1 z = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L742] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L754] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L757] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L789] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L789] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L791] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L792] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L793] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L796] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 3 return 0; [L760] 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) [L760] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L760] 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) [L760] 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) [L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L762] 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 [L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L764] 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 [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 2 return 0; [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L749] 1 return 0; [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L822] 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) [L822] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L822] 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) [L822] 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) [L823] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L824] 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 [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L826] 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 [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y [L833] 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) [L833] 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) [L834] 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)) [L834] 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)) [L835] 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)) [L835] 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)) [L836] 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)) [L836] 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)) [L837] 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)) [L837] 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)) [L838] 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)) [L838] 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)) [L839] 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)) [L839] 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)) [L840] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L841] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L841] 0 y = y$flush_delayed ? y$mem_tmp : y [L842] 0 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 94 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 8.1s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.4s, HoareTripleCheckerStatistics: 393 SDtfs, 399 SDslu, 778 SDs, 0 SdLazy, 365 SolverSat, 71 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=770occurred 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, 14 MinimizatonAttempts, 192 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 210 NumberOfCodeBlocks, 210 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 175 ConstructedInterpolants, 0 QuantifiedInterpolants, 24256 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...