./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe011_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f1ab63-2e0c-4b71-87c2-8be78cace4b5/bin/utaipan-WLngWcDbfI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f1ab63-2e0c-4b71-87c2-8be78cace4b5/bin/utaipan-WLngWcDbfI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f1ab63-2e0c-4b71-87c2-8be78cace4b5/bin/utaipan-WLngWcDbfI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f1ab63-2e0c-4b71-87c2-8be78cace4b5/bin/utaipan-WLngWcDbfI/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe011_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f1ab63-2e0c-4b71-87c2-8be78cace4b5/bin/utaipan-WLngWcDbfI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f1ab63-2e0c-4b71-87c2-8be78cace4b5/bin/utaipan-WLngWcDbfI --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a0cb5dc184dac0001c61c2131f6ae5a7bfabf957 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2021-10-11 02:24:40,838 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-11 02:24:40,840 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-11 02:24:40,891 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-11 02:24:40,892 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-11 02:24:40,900 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-11 02:24:40,903 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-11 02:24:40,908 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-11 02:24:40,912 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-11 02:24:40,919 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-11 02:24:40,920 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-11 02:24:40,922 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-11 02:24:40,922 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-11 02:24:40,926 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-11 02:24:40,928 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-11 02:24:40,930 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-11 02:24:40,933 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-11 02:24:40,937 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-11 02:24:40,940 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-11 02:24:40,949 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-11 02:24:40,952 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-11 02:24:40,954 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-11 02:24:40,957 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-11 02:24:40,958 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-11 02:24:40,963 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-11 02:24:40,963 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-11 02:24:40,964 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-11 02:24:40,966 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-11 02:24:40,967 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-11 02:24:40,969 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-11 02:24:40,970 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-11 02:24:40,971 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-11 02:24:40,973 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-11 02:24:40,975 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-11 02:24:40,977 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-11 02:24:40,977 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-11 02:24:40,978 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-11 02:24:40,979 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-11 02:24:40,979 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-11 02:24:40,980 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-11 02:24:40,982 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-11 02:24:40,985 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f1ab63-2e0c-4b71-87c2-8be78cace4b5/bin/utaipan-WLngWcDbfI/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-11 02:24:41,029 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-11 02:24:41,029 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-11 02:24:41,031 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-11 02:24:41,031 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-11 02:24:41,031 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-11 02:24:41,032 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-11 02:24:41,032 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-11 02:24:41,032 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-11 02:24:41,032 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-11 02:24:41,033 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-11 02:24:41,034 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-11 02:24:41,034 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-11 02:24:41,035 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-11 02:24:41,035 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-11 02:24:41,035 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-11 02:24:41,036 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-11 02:24:41,036 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-11 02:24:41,036 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-11 02:24:41,037 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-11 02:24:41,037 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-11 02:24:41,037 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-11 02:24:41,038 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-11 02:24:41,038 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-11 02:24:41,038 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-11 02:24:41,038 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-11 02:24:41,039 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-11 02:24:41,039 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-11 02:24:41,039 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-11 02:24:41,040 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-11 02:24:41,041 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-11 02:24:41,042 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-11 02:24:41,042 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-11 02:24:41,042 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-11 02:24:41,043 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-11 02:24:41,043 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-11 02:24:41,043 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-11 02:24:41,044 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-11 02:24:41,044 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-11 02:24:41,044 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-11 02:24:41,044 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f1ab63-2e0c-4b71-87c2-8be78cace4b5/bin/utaipan-WLngWcDbfI/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f1ab63-2e0c-4b71-87c2-8be78cace4b5/bin/utaipan-WLngWcDbfI Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a0cb5dc184dac0001c61c2131f6ae5a7bfabf957 [2021-10-11 02:24:41,398 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-11 02:24:41,426 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-11 02:24:41,428 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-11 02:24:41,430 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-11 02:24:41,431 INFO L275 PluginConnector]: CDTParser initialized [2021-10-11 02:24:41,432 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f1ab63-2e0c-4b71-87c2-8be78cace4b5/bin/utaipan-WLngWcDbfI/../../sv-benchmarks/c/pthread-wmm/safe011_rmo.oepc.i [2021-10-11 02:24:41,519 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f1ab63-2e0c-4b71-87c2-8be78cace4b5/bin/utaipan-WLngWcDbfI/data/de3f5d924/1ed19890ef47454ba966c1766bed74c8/FLAGfe31bc173 [2021-10-11 02:24:42,298 INFO L306 CDTParser]: Found 1 translation units. [2021-10-11 02:24:42,299 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f1ab63-2e0c-4b71-87c2-8be78cace4b5/sv-benchmarks/c/pthread-wmm/safe011_rmo.oepc.i [2021-10-11 02:24:42,331 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f1ab63-2e0c-4b71-87c2-8be78cace4b5/bin/utaipan-WLngWcDbfI/data/de3f5d924/1ed19890ef47454ba966c1766bed74c8/FLAGfe31bc173 [2021-10-11 02:24:42,546 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f1ab63-2e0c-4b71-87c2-8be78cace4b5/bin/utaipan-WLngWcDbfI/data/de3f5d924/1ed19890ef47454ba966c1766bed74c8 [2021-10-11 02:24:42,549 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-11 02:24:42,553 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-11 02:24:42,557 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-11 02:24:42,557 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-11 02:24:42,562 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-11 02:24:42,564 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:24:42" (1/1) ... [2021-10-11 02:24:42,567 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65edf3ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:24:42, skipping insertion in model container [2021-10-11 02:24:42,567 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:24:42" (1/1) ... [2021-10-11 02:24:42,576 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-11 02:24:42,658 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-11 02:24:42,962 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f1ab63-2e0c-4b71-87c2-8be78cace4b5/sv-benchmarks/c/pthread-wmm/safe011_rmo.oepc.i[950,963] [2021-10-11 02:24:43,346 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 02:24:43,362 INFO L203 MainTranslator]: Completed pre-run [2021-10-11 02:24:43,384 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f1ab63-2e0c-4b71-87c2-8be78cace4b5/sv-benchmarks/c/pthread-wmm/safe011_rmo.oepc.i[950,963] [2021-10-11 02:24:43,478 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 02:24:43,598 INFO L208 MainTranslator]: Completed translation [2021-10-11 02:24:43,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:24:43 WrapperNode [2021-10-11 02:24:43,599 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-11 02:24:43,600 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-11 02:24:43,601 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-11 02:24:43,601 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-11 02:24:43,611 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:24:43" (1/1) ... [2021-10-11 02:24:43,655 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:24:43" (1/1) ... [2021-10-11 02:24:43,723 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-11 02:24:43,726 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-11 02:24:43,727 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-11 02:24:43,727 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-11 02:24:43,738 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:24:43" (1/1) ... [2021-10-11 02:24:43,739 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:24:43" (1/1) ... [2021-10-11 02:24:43,756 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:24:43" (1/1) ... [2021-10-11 02:24:43,771 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:24:43" (1/1) ... [2021-10-11 02:24:43,784 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:24:43" (1/1) ... [2021-10-11 02:24:43,803 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:24:43" (1/1) ... [2021-10-11 02:24:43,807 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:24:43" (1/1) ... [2021-10-11 02:24:43,813 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-11 02:24:43,825 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-11 02:24:43,826 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-11 02:24:43,826 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-11 02:24:43,827 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:24:43" (1/1) ... No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f1ab63-2e0c-4b71-87c2-8be78cace4b5/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-11 02:24:43,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-11 02:24:43,927 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-10-11 02:24:43,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-11 02:24:43,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-11 02:24:43,928 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-10-11 02:24:43,928 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-10-11 02:24:43,929 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-10-11 02:24:43,929 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-10-11 02:24:43,929 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-10-11 02:24:43,929 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-10-11 02:24:43,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-11 02:24:43,930 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-10-11 02:24:43,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-11 02:24:43,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-11 02:24:43,933 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-11 02:24:46,572 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-11 02:24:46,572 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-10-11 02:24:46,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:24:46 BoogieIcfgContainer [2021-10-11 02:24:46,576 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-11 02:24:46,579 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-11 02:24:46,579 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-11 02:24:46,583 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-11 02:24:46,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:24:42" (1/3) ... [2021-10-11 02:24:46,585 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75604925 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:24:46, skipping insertion in model container [2021-10-11 02:24:46,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:24:43" (2/3) ... [2021-10-11 02:24:46,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75604925 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:24:46, skipping insertion in model container [2021-10-11 02:24:46,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:24:46" (3/3) ... [2021-10-11 02:24:46,588 INFO L111 eAbstractionObserver]: Analyzing ICFG safe011_rmo.oepc.i [2021-10-11 02:24:46,605 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-11 02:24:46,605 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-11 02:24:46,610 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-10-11 02:24:46,611 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-11 02:24:46,656 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,657 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,657 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,657 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,657 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,658 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,658 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,659 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,659 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,660 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,660 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,660 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,660 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,661 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,662 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,662 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,663 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,663 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,663 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,663 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,663 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,664 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,665 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,666 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,666 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,667 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,667 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,667 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,667 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,668 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,669 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,669 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,669 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,669 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,670 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,671 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,671 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,671 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,671 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,672 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,672 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,672 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,672 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,673 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,673 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,673 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,673 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,673 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,674 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,675 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,675 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,675 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,675 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,675 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,676 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,676 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,677 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,677 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,677 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,677 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,679 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,679 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,679 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,679 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,679 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,680 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,680 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,680 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,680 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,681 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,681 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,681 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,682 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,682 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,682 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,682 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,683 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,684 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,684 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,687 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,689 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,690 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,690 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,690 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,692 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,693 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,693 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,695 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,695 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,695 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,695 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,702 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,702 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,703 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,705 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,705 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,705 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,706 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,706 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,706 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,706 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,707 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,708 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,708 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,710 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,710 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,710 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,710 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,711 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,711 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,711 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,711 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,711 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,712 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,712 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,712 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:24:46,714 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-10-11 02:24:46,728 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-10-11 02:24:46,748 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-10-11 02:24:46,748 INFO L378 AbstractCegarLoop]: Hoare is true [2021-10-11 02:24:46,749 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-10-11 02:24:46,749 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-11 02:24:46,749 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-11 02:24:46,749 INFO L382 AbstractCegarLoop]: Difference is false [2021-10-11 02:24:46,749 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-11 02:24:46,750 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-10-11 02:24:46,765 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-10-11 02:24:46,767 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 97 transitions, 209 flow [2021-10-11 02:24:46,771 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 97 transitions, 209 flow [2021-10-11 02:24:46,773 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 209 flow [2021-10-11 02:24:46,853 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-10-11 02:24:46,854 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-11 02:24:46,860 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-10-11 02:24:46,868 INFO L116 LiptonReduction]: Number of co-enabled transitions 1694 [2021-10-11 02:24:48,084 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:48,085 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:24:48,088 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:48,088 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:24:48,093 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:48,094 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:24:48,099 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:48,100 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:24:48,160 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:48,160 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:24:48,166 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:48,167 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:24:48,172 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:48,172 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:24:48,181 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:48,182 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:24:48,319 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 02:24:48,320 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:24:48,322 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2021-10-11 02:24:48,323 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:24:48,397 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 02:24:48,399 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:24:48,401 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2021-10-11 02:24:48,402 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:24:48,781 WARN L197 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-10-11 02:24:48,931 WARN L197 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2021-10-11 02:24:49,484 WARN L197 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2021-10-11 02:24:49,686 WARN L197 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-10-11 02:24:49,763 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:49,763 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:24:49,764 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:49,765 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:24:49,768 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:49,768 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:24:49,771 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:49,772 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:24:49,815 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:49,816 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:24:49,817 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:49,817 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:24:49,820 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:49,820 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:24:49,823 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:49,823 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:24:49,877 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:49,877 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:24:49,878 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:49,878 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:24:49,881 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:49,881 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:24:49,884 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:49,884 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:24:49,904 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:49,905 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:24:49,906 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:49,906 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:24:49,908 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:49,908 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:24:49,915 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:49,916 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:24:49,980 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:49,982 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:24:49,983 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:49,983 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:24:49,986 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:49,986 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:24:49,989 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:49,990 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:24:50,026 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:50,027 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:24:50,028 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:50,028 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:24:50,031 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:50,031 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:24:50,034 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:50,034 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:24:50,144 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 02:24:50,144 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:24:50,145 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2021-10-11 02:24:50,146 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:24:50,159 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 4, 3, 2, 1] term [2021-10-11 02:24:50,159 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:24:50,161 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:24:50,161 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:24:50,164 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 4, 3, 2, 1] term [2021-10-11 02:24:50,164 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:24:50,234 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 02:24:50,234 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:24:50,236 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2021-10-11 02:24:50,237 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:24:51,499 WARN L197 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 226 DAG size of output: 186 [2021-10-11 02:24:52,474 WARN L197 SmtUtils]: Spent 965.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 183 [2021-10-11 02:24:54,320 WARN L197 SmtUtils]: Spent 1.83 s on a formula simplification. DAG size of input: 310 DAG size of output: 266 [2021-10-11 02:24:55,198 WARN L197 SmtUtils]: Spent 875.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-10-11 02:24:55,323 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:55,324 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:24:55,325 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:55,325 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:24:55,331 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:55,331 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:24:55,335 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:55,335 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:24:55,363 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:55,364 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:24:55,365 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:55,365 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:24:55,367 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:55,368 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:24:55,371 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:55,371 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:24:55,893 WARN L197 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2021-10-11 02:24:56,019 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2021-10-11 02:24:56,271 WARN L197 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-10-11 02:24:56,505 WARN L197 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-10-11 02:24:56,523 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:56,524 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:24:56,525 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:56,525 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:24:56,527 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:56,528 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:24:56,530 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:56,531 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:24:56,555 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:56,556 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:24:56,557 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:56,557 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:24:56,559 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:56,560 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:24:56,562 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:56,563 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:24:56,810 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2021-10-11 02:24:56,811 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:24:56,812 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-10-11 02:24:56,812 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:24:56,850 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 02:24:56,850 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:24:56,851 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2021-10-11 02:24:56,852 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:24:56,883 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:56,883 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:24:56,884 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:56,885 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:24:56,887 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:56,887 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:24:56,890 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:56,890 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:24:56,915 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:56,916 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:24:56,917 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:56,917 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:24:56,919 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:56,920 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:24:56,922 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:56,923 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:24:57,234 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2021-10-11 02:24:57,234 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:24:57,270 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 02:24:57,270 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:24:57,271 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2021-10-11 02:24:57,271 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:24:57,309 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2021-10-11 02:24:57,310 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:24:57,310 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-10-11 02:24:57,311 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:24:57,402 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:57,402 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:24:57,406 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:57,407 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:24:57,409 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:57,409 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:24:57,412 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:57,412 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:24:57,435 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:57,435 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:24:57,436 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:57,437 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:24:57,439 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:57,439 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:24:57,442 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:57,442 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:24:57,893 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:57,893 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:24:57,894 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:57,895 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:24:57,896 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:57,897 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:24:57,900 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:57,900 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:24:57,922 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:57,923 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:24:57,923 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:57,924 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:24:57,926 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:57,926 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:24:57,928 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:57,929 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:24:57,959 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:57,959 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:24:57,960 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:57,961 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:24:57,963 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:57,964 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:24:57,965 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:57,966 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:24:57,985 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:57,985 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:24:57,986 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:57,986 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:24:57,988 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:57,988 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:24:57,990 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:57,991 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:24:58,045 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 02:24:58,046 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:24:58,047 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2021-10-11 02:24:58,048 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:24:58,074 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 02:24:58,074 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:24:58,075 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2021-10-11 02:24:58,075 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:24:58,158 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:58,159 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:24:58,159 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:58,160 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:24:58,162 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:58,162 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:24:58,164 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:58,165 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:24:58,190 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:58,190 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:24:58,191 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:58,192 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:24:58,193 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:58,194 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:24:58,196 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:24:58,196 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:24:59,395 WARN L197 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2021-10-11 02:24:59,556 WARN L197 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2021-10-11 02:24:59,726 WARN L197 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2021-10-11 02:24:59,880 WARN L197 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2021-10-11 02:25:00,364 WARN L197 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 112 [2021-10-11 02:25:00,535 WARN L197 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-10-11 02:25:00,948 WARN L197 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 112 [2021-10-11 02:25:01,145 WARN L197 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-10-11 02:25:01,150 INFO L131 LiptonReduction]: Checked pairs total: 4814 [2021-10-11 02:25:01,150 INFO L133 LiptonReduction]: Total number of compositions: 81 [2021-10-11 02:25:01,157 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 28 transitions, 71 flow [2021-10-11 02:25:01,260 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 974 states. [2021-10-11 02:25:01,262 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states. [2021-10-11 02:25:01,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-11 02:25:01,267 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:25:01,268 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-11 02:25:01,270 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:25:01,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:25:01,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1057934, now seen corresponding path program 1 times [2021-10-11 02:25:01,301 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:25:01,303 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509794417] [2021-10-11 02:25:01,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:25:01,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:25:01,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:25:01,607 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509794417] [2021-10-11 02:25:01,607 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:25:01,607 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-11 02:25:01,608 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866375571] [2021-10-11 02:25:01,611 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:25:01,612 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:25:01,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:25:01,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:25:01,625 INFO L87 Difference]: Start difference. First operand 974 states. Second operand 3 states. [2021-10-11 02:25:01,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:25:01,732 INFO L93 Difference]: Finished difference Result 812 states and 2575 transitions. [2021-10-11 02:25:01,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:25:01,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2021-10-11 02:25:01,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:25:01,768 INFO L225 Difference]: With dead ends: 812 [2021-10-11 02:25:01,768 INFO L226 Difference]: Without dead ends: 687 [2021-10-11 02:25:01,769 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:25:01,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2021-10-11 02:25:01,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 687. [2021-10-11 02:25:01,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2021-10-11 02:25:01,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 2150 transitions. [2021-10-11 02:25:01,863 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 2150 transitions. Word has length 3 [2021-10-11 02:25:01,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:25:01,863 INFO L481 AbstractCegarLoop]: Abstraction has 687 states and 2150 transitions. [2021-10-11 02:25:01,863 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:25:01,864 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 2150 transitions. [2021-10-11 02:25:01,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-11 02:25:01,865 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:25:01,866 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:25:01,866 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-11 02:25:01,866 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:25:01,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:25:01,867 INFO L82 PathProgramCache]: Analyzing trace with hash -332907457, now seen corresponding path program 1 times [2021-10-11 02:25:01,867 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:25:01,867 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402674294] [2021-10-11 02:25:01,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:25:01,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:25:02,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:25:02,060 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402674294] [2021-10-11 02:25:02,060 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:25:02,061 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-11 02:25:02,061 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028691627] [2021-10-11 02:25:02,062 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:25:02,065 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:25:02,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:25:02,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:25:02,066 INFO L87 Difference]: Start difference. First operand 687 states and 2150 transitions. Second operand 4 states. [2021-10-11 02:25:02,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:25:02,117 INFO L93 Difference]: Finished difference Result 792 states and 2384 transitions. [2021-10-11 02:25:02,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 02:25:02,117 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2021-10-11 02:25:02,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:25:02,128 INFO L225 Difference]: With dead ends: 792 [2021-10-11 02:25:02,128 INFO L226 Difference]: Without dead ends: 667 [2021-10-11 02:25:02,129 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:25:02,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2021-10-11 02:25:02,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 667. [2021-10-11 02:25:02,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 667 states. [2021-10-11 02:25:02,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 2074 transitions. [2021-10-11 02:25:02,168 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 2074 transitions. Word has length 10 [2021-10-11 02:25:02,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:25:02,169 INFO L481 AbstractCegarLoop]: Abstraction has 667 states and 2074 transitions. [2021-10-11 02:25:02,170 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:25:02,170 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 2074 transitions. [2021-10-11 02:25:02,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-11 02:25:02,174 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:25:02,174 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:25:02,174 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-11 02:25:02,174 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:25:02,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:25:02,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1082766274, now seen corresponding path program 1 times [2021-10-11 02:25:02,175 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:25:02,175 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937923098] [2021-10-11 02:25:02,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:25:02,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:25:02,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:25:02,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937923098] [2021-10-11 02:25:02,306 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:25:02,306 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-11 02:25:02,306 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338668917] [2021-10-11 02:25:02,306 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:25:02,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:25:02,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:25:02,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:25:02,307 INFO L87 Difference]: Start difference. First operand 667 states and 2074 transitions. Second operand 4 states. [2021-10-11 02:25:02,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:25:02,349 INFO L93 Difference]: Finished difference Result 736 states and 2205 transitions. [2021-10-11 02:25:02,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 02:25:02,350 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2021-10-11 02:25:02,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:25:02,355 INFO L225 Difference]: With dead ends: 736 [2021-10-11 02:25:02,356 INFO L226 Difference]: Without dead ends: 621 [2021-10-11 02:25:02,356 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:25:02,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2021-10-11 02:25:02,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 621. [2021-10-11 02:25:02,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2021-10-11 02:25:02,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 1910 transitions. [2021-10-11 02:25:02,382 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 1910 transitions. Word has length 11 [2021-10-11 02:25:02,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:25:02,382 INFO L481 AbstractCegarLoop]: Abstraction has 621 states and 1910 transitions. [2021-10-11 02:25:02,382 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:25:02,383 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 1910 transitions. [2021-10-11 02:25:02,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-11 02:25:02,389 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:25:02,389 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:25:02,389 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-11 02:25:02,390 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:25:02,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:25:02,390 INFO L82 PathProgramCache]: Analyzing trace with hash -794597533, now seen corresponding path program 1 times [2021-10-11 02:25:02,391 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:25:02,391 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763023485] [2021-10-11 02:25:02,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:25:02,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:25:02,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:25:02,507 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763023485] [2021-10-11 02:25:02,508 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:25:02,508 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:25:02,508 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086383571] [2021-10-11 02:25:02,508 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:25:02,509 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:25:02,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:25:02,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:25:02,511 INFO L87 Difference]: Start difference. First operand 621 states and 1910 transitions. Second operand 5 states. [2021-10-11 02:25:02,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:25:02,587 INFO L93 Difference]: Finished difference Result 829 states and 2510 transitions. [2021-10-11 02:25:02,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 02:25:02,587 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2021-10-11 02:25:02,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:25:02,591 INFO L225 Difference]: With dead ends: 829 [2021-10-11 02:25:02,591 INFO L226 Difference]: Without dead ends: 437 [2021-10-11 02:25:02,592 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-11 02:25:02,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2021-10-11 02:25:02,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2021-10-11 02:25:02,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2021-10-11 02:25:02,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 1270 transitions. [2021-10-11 02:25:02,608 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 1270 transitions. Word has length 12 [2021-10-11 02:25:02,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:25:02,608 INFO L481 AbstractCegarLoop]: Abstraction has 437 states and 1270 transitions. [2021-10-11 02:25:02,608 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:25:02,608 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 1270 transitions. [2021-10-11 02:25:02,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-11 02:25:02,609 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:25:02,609 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:25:02,609 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-11 02:25:02,609 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:25:02,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:25:02,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1154818923, now seen corresponding path program 1 times [2021-10-11 02:25:02,610 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:25:02,610 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840528487] [2021-10-11 02:25:02,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:25:02,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:25:02,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:25:02,707 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840528487] [2021-10-11 02:25:02,708 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:25:02,708 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-11 02:25:02,708 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566812249] [2021-10-11 02:25:02,708 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:25:02,708 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:25:02,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:25:02,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:25:02,710 INFO L87 Difference]: Start difference. First operand 437 states and 1270 transitions. Second operand 4 states. [2021-10-11 02:25:02,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:25:02,806 INFO L93 Difference]: Finished difference Result 491 states and 1384 transitions. [2021-10-11 02:25:02,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 02:25:02,807 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2021-10-11 02:25:02,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:25:02,811 INFO L225 Difference]: With dead ends: 491 [2021-10-11 02:25:02,811 INFO L226 Difference]: Without dead ends: 431 [2021-10-11 02:25:02,812 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:25:02,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2021-10-11 02:25:02,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 431. [2021-10-11 02:25:02,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2021-10-11 02:25:02,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 1248 transitions. [2021-10-11 02:25:02,831 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 1248 transitions. Word has length 13 [2021-10-11 02:25:02,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:25:02,831 INFO L481 AbstractCegarLoop]: Abstraction has 431 states and 1248 transitions. [2021-10-11 02:25:02,831 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:25:02,831 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 1248 transitions. [2021-10-11 02:25:02,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-11 02:25:02,832 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:25:02,832 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:25:02,832 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-11 02:25:02,833 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:25:02,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:25:02,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1439607342, now seen corresponding path program 1 times [2021-10-11 02:25:02,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:25:02,833 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41512591] [2021-10-11 02:25:02,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:25:02,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:25:02,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:25:02,952 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41512591] [2021-10-11 02:25:02,953 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:25:02,953 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:25:02,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846313157] [2021-10-11 02:25:02,954 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:25:02,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:25:02,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:25:02,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:25:02,956 INFO L87 Difference]: Start difference. First operand 431 states and 1248 transitions. Second operand 5 states. [2021-10-11 02:25:03,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:25:03,079 INFO L93 Difference]: Finished difference Result 483 states and 1369 transitions. [2021-10-11 02:25:03,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 02:25:03,082 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2021-10-11 02:25:03,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:25:03,086 INFO L225 Difference]: With dead ends: 483 [2021-10-11 02:25:03,086 INFO L226 Difference]: Without dead ends: 438 [2021-10-11 02:25:03,086 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:25:03,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2021-10-11 02:25:03,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 434. [2021-10-11 02:25:03,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2021-10-11 02:25:03,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1256 transitions. [2021-10-11 02:25:03,103 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 1256 transitions. Word has length 14 [2021-10-11 02:25:03,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:25:03,104 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 1256 transitions. [2021-10-11 02:25:03,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:25:03,106 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 1256 transitions. [2021-10-11 02:25:03,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-11 02:25:03,107 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:25:03,107 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:25:03,107 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-11 02:25:03,107 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:25:03,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:25:03,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1439618874, now seen corresponding path program 1 times [2021-10-11 02:25:03,108 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:25:03,108 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740179166] [2021-10-11 02:25:03,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:25:03,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:25:03,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:25:03,278 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740179166] [2021-10-11 02:25:03,278 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:25:03,278 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 02:25:03,279 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417629259] [2021-10-11 02:25:03,279 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 02:25:03,279 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:25:03,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 02:25:03,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:25:03,281 INFO L87 Difference]: Start difference. First operand 434 states and 1256 transitions. Second operand 6 states. [2021-10-11 02:25:03,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:25:03,411 INFO L93 Difference]: Finished difference Result 478 states and 1346 transitions. [2021-10-11 02:25:03,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 02:25:03,412 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2021-10-11 02:25:03,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:25:03,416 INFO L225 Difference]: With dead ends: 478 [2021-10-11 02:25:03,416 INFO L226 Difference]: Without dead ends: 430 [2021-10-11 02:25:03,416 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-11 02:25:03,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2021-10-11 02:25:03,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 430. [2021-10-11 02:25:03,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2021-10-11 02:25:03,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1240 transitions. [2021-10-11 02:25:03,432 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 1240 transitions. Word has length 14 [2021-10-11 02:25:03,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:25:03,433 INFO L481 AbstractCegarLoop]: Abstraction has 430 states and 1240 transitions. [2021-10-11 02:25:03,433 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 02:25:03,433 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1240 transitions. [2021-10-11 02:25:03,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-11 02:25:03,434 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:25:03,434 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:25:03,435 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-11 02:25:03,435 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:25:03,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:25:03,435 INFO L82 PathProgramCache]: Analyzing trace with hash -298495698, now seen corresponding path program 2 times [2021-10-11 02:25:03,436 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:25:03,436 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787166650] [2021-10-11 02:25:03,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:25:03,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:25:03,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:25:03,534 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787166650] [2021-10-11 02:25:03,534 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:25:03,535 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 02:25:03,535 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527391581] [2021-10-11 02:25:03,535 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 02:25:03,535 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:25:03,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 02:25:03,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:25:03,536 INFO L87 Difference]: Start difference. First operand 430 states and 1240 transitions. Second operand 6 states. [2021-10-11 02:25:03,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:25:03,724 INFO L93 Difference]: Finished difference Result 461 states and 1299 transitions. [2021-10-11 02:25:03,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 02:25:03,725 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2021-10-11 02:25:03,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:25:03,729 INFO L225 Difference]: With dead ends: 461 [2021-10-11 02:25:03,729 INFO L226 Difference]: Without dead ends: 416 [2021-10-11 02:25:03,730 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-11 02:25:03,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2021-10-11 02:25:03,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 409. [2021-10-11 02:25:03,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2021-10-11 02:25:03,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 1172 transitions. [2021-10-11 02:25:03,746 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 1172 transitions. Word has length 14 [2021-10-11 02:25:03,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:25:03,747 INFO L481 AbstractCegarLoop]: Abstraction has 409 states and 1172 transitions. [2021-10-11 02:25:03,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 02:25:03,747 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 1172 transitions. [2021-10-11 02:25:03,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-11 02:25:03,748 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:25:03,748 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:25:03,748 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-11 02:25:03,748 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:25:03,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:25:03,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1678125271, now seen corresponding path program 1 times [2021-10-11 02:25:03,749 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:25:03,749 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677566028] [2021-10-11 02:25:03,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:25:03,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:25:03,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:25:03,853 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677566028] [2021-10-11 02:25:03,853 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:25:03,853 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 02:25:03,853 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041580173] [2021-10-11 02:25:03,854 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 02:25:03,854 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:25:03,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 02:25:03,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:25:03,855 INFO L87 Difference]: Start difference. First operand 409 states and 1172 transitions. Second operand 6 states. [2021-10-11 02:25:03,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:25:03,998 INFO L93 Difference]: Finished difference Result 470 states and 1335 transitions. [2021-10-11 02:25:03,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 02:25:03,999 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2021-10-11 02:25:03,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:25:04,003 INFO L225 Difference]: With dead ends: 470 [2021-10-11 02:25:04,004 INFO L226 Difference]: Without dead ends: 434 [2021-10-11 02:25:04,004 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:25:04,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2021-10-11 02:25:04,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 418. [2021-10-11 02:25:04,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2021-10-11 02:25:04,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 1196 transitions. [2021-10-11 02:25:04,021 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 1196 transitions. Word has length 15 [2021-10-11 02:25:04,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:25:04,021 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 1196 transitions. [2021-10-11 02:25:04,021 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 02:25:04,021 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 1196 transitions. [2021-10-11 02:25:04,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-11 02:25:04,023 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:25:04,023 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:25:04,023 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-11 02:25:04,023 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:25:04,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:25:04,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1677946525, now seen corresponding path program 1 times [2021-10-11 02:25:04,024 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:25:04,024 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206042821] [2021-10-11 02:25:04,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:25:04,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:25:04,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:25:04,201 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206042821] [2021-10-11 02:25:04,201 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:25:04,201 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 02:25:04,201 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857252394] [2021-10-11 02:25:04,202 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 02:25:04,202 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:25:04,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 02:25:04,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:25:04,203 INFO L87 Difference]: Start difference. First operand 418 states and 1196 transitions. Second operand 6 states. [2021-10-11 02:25:04,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:25:04,318 INFO L93 Difference]: Finished difference Result 482 states and 1360 transitions. [2021-10-11 02:25:04,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 02:25:04,319 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2021-10-11 02:25:04,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:25:04,323 INFO L225 Difference]: With dead ends: 482 [2021-10-11 02:25:04,323 INFO L226 Difference]: Without dead ends: 450 [2021-10-11 02:25:04,324 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-10-11 02:25:04,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2021-10-11 02:25:04,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2021-10-11 02:25:04,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2021-10-11 02:25:04,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1292 transitions. [2021-10-11 02:25:04,341 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1292 transitions. Word has length 15 [2021-10-11 02:25:04,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:25:04,341 INFO L481 AbstractCegarLoop]: Abstraction has 450 states and 1292 transitions. [2021-10-11 02:25:04,341 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 02:25:04,342 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1292 transitions. [2021-10-11 02:25:04,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-11 02:25:04,343 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:25:04,343 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:25:04,343 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-11 02:25:04,343 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:25:04,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:25:04,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1678471231, now seen corresponding path program 2 times [2021-10-11 02:25:04,344 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:25:04,344 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664942823] [2021-10-11 02:25:04,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:25:04,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:25:04,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:25:04,456 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664942823] [2021-10-11 02:25:04,456 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:25:04,456 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 02:25:04,457 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951441456] [2021-10-11 02:25:04,457 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 02:25:04,457 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:25:04,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 02:25:04,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:25:04,460 INFO L87 Difference]: Start difference. First operand 450 states and 1292 transitions. Second operand 6 states. [2021-10-11 02:25:04,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:25:04,638 INFO L93 Difference]: Finished difference Result 542 states and 1544 transitions. [2021-10-11 02:25:04,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 02:25:04,639 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2021-10-11 02:25:04,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:25:04,645 INFO L225 Difference]: With dead ends: 542 [2021-10-11 02:25:04,645 INFO L226 Difference]: Without dead ends: 506 [2021-10-11 02:25:04,646 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-10-11 02:25:04,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2021-10-11 02:25:04,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 456. [2021-10-11 02:25:04,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2021-10-11 02:25:04,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 1305 transitions. [2021-10-11 02:25:04,667 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 1305 transitions. Word has length 15 [2021-10-11 02:25:04,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:25:04,668 INFO L481 AbstractCegarLoop]: Abstraction has 456 states and 1305 transitions. [2021-10-11 02:25:04,668 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 02:25:04,668 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 1305 transitions. [2021-10-11 02:25:04,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-11 02:25:04,670 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:25:04,670 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:25:04,671 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-11 02:25:04,671 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:25:04,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:25:04,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1678465465, now seen corresponding path program 2 times [2021-10-11 02:25:04,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:25:04,672 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660876188] [2021-10-11 02:25:04,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:25:04,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:25:04,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:25:04,827 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660876188] [2021-10-11 02:25:04,828 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:25:04,828 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 02:25:04,829 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517038680] [2021-10-11 02:25:04,829 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-10-11 02:25:04,833 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:25:04,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-11 02:25:04,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-11 02:25:04,834 INFO L87 Difference]: Start difference. First operand 456 states and 1305 transitions. Second operand 7 states. [2021-10-11 02:25:05,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:25:05,026 INFO L93 Difference]: Finished difference Result 480 states and 1345 transitions. [2021-10-11 02:25:05,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 02:25:05,028 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2021-10-11 02:25:05,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:25:05,032 INFO L225 Difference]: With dead ends: 480 [2021-10-11 02:25:05,033 INFO L226 Difference]: Without dead ends: 448 [2021-10-11 02:25:05,033 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-10-11 02:25:05,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2021-10-11 02:25:05,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 416. [2021-10-11 02:25:05,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2021-10-11 02:25:05,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 1181 transitions. [2021-10-11 02:25:05,090 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 1181 transitions. Word has length 15 [2021-10-11 02:25:05,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:25:05,091 INFO L481 AbstractCegarLoop]: Abstraction has 416 states and 1181 transitions. [2021-10-11 02:25:05,091 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-10-11 02:25:05,091 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 1181 transitions. [2021-10-11 02:25:05,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-11 02:25:05,092 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:25:05,092 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:25:05,092 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-11 02:25:05,093 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:25:05,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:25:05,093 INFO L82 PathProgramCache]: Analyzing trace with hash -663461417, now seen corresponding path program 3 times [2021-10-11 02:25:05,094 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:25:05,094 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578899307] [2021-10-11 02:25:05,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:25:05,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:25:05,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:25:05,191 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578899307] [2021-10-11 02:25:05,191 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:25:05,192 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 02:25:05,192 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848997940] [2021-10-11 02:25:05,192 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-10-11 02:25:05,192 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:25:05,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-11 02:25:05,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-11 02:25:05,194 INFO L87 Difference]: Start difference. First operand 416 states and 1181 transitions. Second operand 7 states. [2021-10-11 02:25:05,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:25:05,391 INFO L93 Difference]: Finished difference Result 554 states and 1559 transitions. [2021-10-11 02:25:05,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 02:25:05,392 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2021-10-11 02:25:05,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:25:05,396 INFO L225 Difference]: With dead ends: 554 [2021-10-11 02:25:05,396 INFO L226 Difference]: Without dead ends: 502 [2021-10-11 02:25:05,397 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-10-11 02:25:05,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2021-10-11 02:25:05,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 475. [2021-10-11 02:25:05,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475 states. [2021-10-11 02:25:05,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 1357 transitions. [2021-10-11 02:25:05,414 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 1357 transitions. Word has length 15 [2021-10-11 02:25:05,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:25:05,415 INFO L481 AbstractCegarLoop]: Abstraction has 475 states and 1357 transitions. [2021-10-11 02:25:05,415 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-10-11 02:25:05,415 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 1357 transitions. [2021-10-11 02:25:05,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-11 02:25:05,417 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:25:05,417 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:25:05,417 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-11 02:25:05,417 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:25:05,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:25:05,418 INFO L82 PathProgramCache]: Analyzing trace with hash 482235907, now seen corresponding path program 1 times [2021-10-11 02:25:05,418 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:25:05,418 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960584155] [2021-10-11 02:25:05,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:25:05,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:25:05,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:25:05,576 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960584155] [2021-10-11 02:25:05,576 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:25:05,577 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 02:25:05,577 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68717783] [2021-10-11 02:25:05,577 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-10-11 02:25:05,577 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:25:05,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-11 02:25:05,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-11 02:25:05,578 INFO L87 Difference]: Start difference. First operand 475 states and 1357 transitions. Second operand 7 states. [2021-10-11 02:25:05,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:25:05,806 INFO L93 Difference]: Finished difference Result 614 states and 1757 transitions. [2021-10-11 02:25:05,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 02:25:05,807 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2021-10-11 02:25:05,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:25:05,812 INFO L225 Difference]: With dead ends: 614 [2021-10-11 02:25:05,812 INFO L226 Difference]: Without dead ends: 582 [2021-10-11 02:25:05,813 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-10-11 02:25:05,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2021-10-11 02:25:05,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 500. [2021-10-11 02:25:05,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2021-10-11 02:25:05,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 1439 transitions. [2021-10-11 02:25:05,832 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 1439 transitions. Word has length 16 [2021-10-11 02:25:05,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:25:05,832 INFO L481 AbstractCegarLoop]: Abstraction has 500 states and 1439 transitions. [2021-10-11 02:25:05,832 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-10-11 02:25:05,832 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 1439 transitions. [2021-10-11 02:25:05,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-11 02:25:05,834 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:25:05,834 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:25:05,834 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-11 02:25:05,834 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:25:05,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:25:05,835 INFO L82 PathProgramCache]: Analyzing trace with hash 482229180, now seen corresponding path program 1 times [2021-10-11 02:25:05,835 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:25:05,835 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109628637] [2021-10-11 02:25:05,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:25:05,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:25:05,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:25:05,942 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109628637] [2021-10-11 02:25:05,943 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:25:05,943 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 02:25:05,943 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016981272] [2021-10-11 02:25:05,943 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-10-11 02:25:05,944 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:25:05,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-11 02:25:05,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-11 02:25:05,944 INFO L87 Difference]: Start difference. First operand 500 states and 1439 transitions. Second operand 7 states. [2021-10-11 02:25:06,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:25:06,200 INFO L93 Difference]: Finished difference Result 582 states and 1669 transitions. [2021-10-11 02:25:06,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 02:25:06,200 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2021-10-11 02:25:06,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:25:06,205 INFO L225 Difference]: With dead ends: 582 [2021-10-11 02:25:06,205 INFO L226 Difference]: Without dead ends: 558 [2021-10-11 02:25:06,206 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-10-11 02:25:06,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2021-10-11 02:25:06,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 500. [2021-10-11 02:25:06,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2021-10-11 02:25:06,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 1439 transitions. [2021-10-11 02:25:06,225 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 1439 transitions. Word has length 16 [2021-10-11 02:25:06,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:25:06,225 INFO L481 AbstractCegarLoop]: Abstraction has 500 states and 1439 transitions. [2021-10-11 02:25:06,225 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-10-11 02:25:06,226 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 1439 transitions. [2021-10-11 02:25:06,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-11 02:25:06,227 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:25:06,227 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:25:06,227 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-11 02:25:06,228 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:25:06,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:25:06,228 INFO L82 PathProgramCache]: Analyzing trace with hash 492960667, now seen corresponding path program 2 times [2021-10-11 02:25:06,228 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:25:06,228 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099620154] [2021-10-11 02:25:06,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:25:06,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:25:06,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:25:06,327 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099620154] [2021-10-11 02:25:06,328 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:25:06,328 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 02:25:06,328 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650674194] [2021-10-11 02:25:06,328 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-10-11 02:25:06,329 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:25:06,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-11 02:25:06,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-10-11 02:25:06,330 INFO L87 Difference]: Start difference. First operand 500 states and 1439 transitions. Second operand 7 states. [2021-10-11 02:25:06,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:25:06,510 INFO L93 Difference]: Finished difference Result 726 states and 2018 transitions. [2021-10-11 02:25:06,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 02:25:06,511 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2021-10-11 02:25:06,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:25:06,518 INFO L225 Difference]: With dead ends: 726 [2021-10-11 02:25:06,518 INFO L226 Difference]: Without dead ends: 628 [2021-10-11 02:25:06,519 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-10-11 02:25:06,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2021-10-11 02:25:06,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 468. [2021-10-11 02:25:06,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2021-10-11 02:25:06,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 1323 transitions. [2021-10-11 02:25:06,545 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 1323 transitions. Word has length 16 [2021-10-11 02:25:06,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:25:06,545 INFO L481 AbstractCegarLoop]: Abstraction has 468 states and 1323 transitions. [2021-10-11 02:25:06,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-10-11 02:25:06,545 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 1323 transitions. [2021-10-11 02:25:06,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-11 02:25:06,547 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:25:06,548 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:25:06,548 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-11 02:25:06,548 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:25:06,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:25:06,549 INFO L82 PathProgramCache]: Analyzing trace with hash 492953940, now seen corresponding path program 2 times [2021-10-11 02:25:06,549 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:25:06,549 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298403173] [2021-10-11 02:25:06,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:25:06,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:25:06,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:25:06,679 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298403173] [2021-10-11 02:25:06,679 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:25:06,679 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 02:25:06,680 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503084701] [2021-10-11 02:25:06,680 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-10-11 02:25:06,680 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:25:06,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-11 02:25:06,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-10-11 02:25:06,681 INFO L87 Difference]: Start difference. First operand 468 states and 1323 transitions. Second operand 7 states. [2021-10-11 02:25:06,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:25:06,861 INFO L93 Difference]: Finished difference Result 538 states and 1503 transitions. [2021-10-11 02:25:06,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 02:25:06,861 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2021-10-11 02:25:06,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:25:06,866 INFO L225 Difference]: With dead ends: 538 [2021-10-11 02:25:06,867 INFO L226 Difference]: Without dead ends: 510 [2021-10-11 02:25:06,867 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-10-11 02:25:06,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2021-10-11 02:25:06,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 468. [2021-10-11 02:25:06,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2021-10-11 02:25:06,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 1311 transitions. [2021-10-11 02:25:06,888 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 1311 transitions. Word has length 16 [2021-10-11 02:25:06,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:25:06,888 INFO L481 AbstractCegarLoop]: Abstraction has 468 states and 1311 transitions. [2021-10-11 02:25:06,889 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-10-11 02:25:06,889 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 1311 transitions. [2021-10-11 02:25:06,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-11 02:25:06,891 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:25:06,891 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:25:06,891 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-11 02:25:06,891 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:25:06,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:25:06,892 INFO L82 PathProgramCache]: Analyzing trace with hash 492530139, now seen corresponding path program 1 times [2021-10-11 02:25:06,892 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:25:06,892 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591999817] [2021-10-11 02:25:06,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:25:06,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:25:06,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:25:06,952 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591999817] [2021-10-11 02:25:06,953 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:25:06,953 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:25:06,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742950880] [2021-10-11 02:25:06,953 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:25:06,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:25:06,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:25:06,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:25:06,955 INFO L87 Difference]: Start difference. First operand 468 states and 1311 transitions. Second operand 4 states. [2021-10-11 02:25:06,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:25:06,985 INFO L93 Difference]: Finished difference Result 746 states and 2049 transitions. [2021-10-11 02:25:06,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:25:06,986 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2021-10-11 02:25:06,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:25:06,989 INFO L225 Difference]: With dead ends: 746 [2021-10-11 02:25:06,989 INFO L226 Difference]: Without dead ends: 429 [2021-10-11 02:25:06,990 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:25:06,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2021-10-11 02:25:07,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 397. [2021-10-11 02:25:07,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2021-10-11 02:25:07,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1032 transitions. [2021-10-11 02:25:07,004 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1032 transitions. Word has length 16 [2021-10-11 02:25:07,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:25:07,004 INFO L481 AbstractCegarLoop]: Abstraction has 397 states and 1032 transitions. [2021-10-11 02:25:07,004 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:25:07,004 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1032 transitions. [2021-10-11 02:25:07,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-11 02:25:07,005 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:25:07,006 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:25:07,006 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-11 02:25:07,006 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:25:07,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:25:07,006 INFO L82 PathProgramCache]: Analyzing trace with hash 907485884, now seen corresponding path program 3 times [2021-10-11 02:25:07,007 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:25:07,007 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444607518] [2021-10-11 02:25:07,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:25:07,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:25:07,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:25:07,132 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444607518] [2021-10-11 02:25:07,132 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:25:07,132 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-11 02:25:07,133 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522673551] [2021-10-11 02:25:07,133 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-10-11 02:25:07,133 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:25:07,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-11 02:25:07,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-11 02:25:07,134 INFO L87 Difference]: Start difference. First operand 397 states and 1032 transitions. Second operand 8 states. [2021-10-11 02:25:07,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:25:07,375 INFO L93 Difference]: Finished difference Result 434 states and 1107 transitions. [2021-10-11 02:25:07,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 02:25:07,375 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2021-10-11 02:25:07,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:25:07,378 INFO L225 Difference]: With dead ends: 434 [2021-10-11 02:25:07,378 INFO L226 Difference]: Without dead ends: 410 [2021-10-11 02:25:07,379 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-10-11 02:25:07,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2021-10-11 02:25:07,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 385. [2021-10-11 02:25:07,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2021-10-11 02:25:07,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 998 transitions. [2021-10-11 02:25:07,391 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 998 transitions. Word has length 16 [2021-10-11 02:25:07,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:25:07,391 INFO L481 AbstractCegarLoop]: Abstraction has 385 states and 998 transitions. [2021-10-11 02:25:07,392 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-10-11 02:25:07,392 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 998 transitions. [2021-10-11 02:25:07,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-11 02:25:07,393 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:25:07,393 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:25:07,393 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-11 02:25:07,393 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:25:07,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:25:07,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1222661999, now seen corresponding path program 2 times [2021-10-11 02:25:07,394 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:25:07,394 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040984339] [2021-10-11 02:25:07,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:25:07,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:25:07,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:25:07,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040984339] [2021-10-11 02:25:07,447 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:25:07,447 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:25:07,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096642991] [2021-10-11 02:25:07,448 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:25:07,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:25:07,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:25:07,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:25:07,449 INFO L87 Difference]: Start difference. First operand 385 states and 998 transitions. Second operand 4 states. [2021-10-11 02:25:07,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:25:07,476 INFO L93 Difference]: Finished difference Result 378 states and 868 transitions. [2021-10-11 02:25:07,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 02:25:07,477 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2021-10-11 02:25:07,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:25:07,479 INFO L225 Difference]: With dead ends: 378 [2021-10-11 02:25:07,479 INFO L226 Difference]: Without dead ends: 289 [2021-10-11 02:25:07,479 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:25:07,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-10-11 02:25:07,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2021-10-11 02:25:07,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2021-10-11 02:25:07,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 658 transitions. [2021-10-11 02:25:07,488 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 658 transitions. Word has length 16 [2021-10-11 02:25:07,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:25:07,488 INFO L481 AbstractCegarLoop]: Abstraction has 289 states and 658 transitions. [2021-10-11 02:25:07,488 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:25:07,489 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 658 transitions. [2021-10-11 02:25:07,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-11 02:25:07,489 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:25:07,489 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:25:07,490 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-11 02:25:07,490 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:25:07,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:25:07,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1411500507, now seen corresponding path program 1 times [2021-10-11 02:25:07,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:25:07,491 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172566969] [2021-10-11 02:25:07,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:25:07,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:25:07,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:25:07,546 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172566969] [2021-10-11 02:25:07,546 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:25:07,546 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 02:25:07,546 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351579347] [2021-10-11 02:25:07,547 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:25:07,547 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:25:07,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:25:07,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:25:07,548 INFO L87 Difference]: Start difference. First operand 289 states and 658 transitions. Second operand 5 states. [2021-10-11 02:25:07,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:25:07,584 INFO L93 Difference]: Finished difference Result 236 states and 480 transitions. [2021-10-11 02:25:07,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 02:25:07,585 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2021-10-11 02:25:07,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:25:07,587 INFO L225 Difference]: With dead ends: 236 [2021-10-11 02:25:07,587 INFO L226 Difference]: Without dead ends: 187 [2021-10-11 02:25:07,587 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 [2021-10-11 02:25:07,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2021-10-11 02:25:07,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2021-10-11 02:25:07,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2021-10-11 02:25:07,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 372 transitions. [2021-10-11 02:25:07,593 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 372 transitions. Word has length 17 [2021-10-11 02:25:07,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:25:07,595 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 372 transitions. [2021-10-11 02:25:07,595 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:25:07,595 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 372 transitions. [2021-10-11 02:25:07,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-11 02:25:07,596 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:25:07,596 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:25:07,596 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-11 02:25:07,596 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:25:07,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:25:07,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1049838257, now seen corresponding path program 1 times [2021-10-11 02:25:07,597 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:25:07,597 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950867127] [2021-10-11 02:25:07,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:25:07,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:25:07,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:25:07,774 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950867127] [2021-10-11 02:25:07,774 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:25:07,774 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-11 02:25:07,775 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226093073] [2021-10-11 02:25:07,775 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-10-11 02:25:07,775 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:25:07,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-11 02:25:07,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-10-11 02:25:07,776 INFO L87 Difference]: Start difference. First operand 187 states and 372 transitions. Second operand 9 states. [2021-10-11 02:25:07,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:25:07,987 INFO L93 Difference]: Finished difference Result 199 states and 385 transitions. [2021-10-11 02:25:07,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 02:25:07,988 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2021-10-11 02:25:07,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:25:07,989 INFO L225 Difference]: With dead ends: 199 [2021-10-11 02:25:07,989 INFO L226 Difference]: Without dead ends: 185 [2021-10-11 02:25:07,990 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-10-11 02:25:07,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-10-11 02:25:08,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2021-10-11 02:25:08,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2021-10-11 02:25:08,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 368 transitions. [2021-10-11 02:25:08,021 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 368 transitions. Word has length 19 [2021-10-11 02:25:08,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:25:08,021 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 368 transitions. [2021-10-11 02:25:08,021 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-10-11 02:25:08,021 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 368 transitions. [2021-10-11 02:25:08,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-11 02:25:08,022 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:25:08,022 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:25:08,022 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-11 02:25:08,022 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:25:08,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:25:08,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1534850081, now seen corresponding path program 2 times [2021-10-11 02:25:08,023 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:25:08,023 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18698410] [2021-10-11 02:25:08,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:25:08,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:25:08,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:25:08,189 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18698410] [2021-10-11 02:25:08,190 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:25:08,190 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-11 02:25:08,190 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270418195] [2021-10-11 02:25:08,190 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-10-11 02:25:08,191 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:25:08,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-11 02:25:08,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-11 02:25:08,192 INFO L87 Difference]: Start difference. First operand 185 states and 368 transitions. Second operand 8 states. [2021-10-11 02:25:08,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:25:08,378 INFO L93 Difference]: Finished difference Result 197 states and 381 transitions. [2021-10-11 02:25:08,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 02:25:08,379 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2021-10-11 02:25:08,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:25:08,380 INFO L225 Difference]: With dead ends: 197 [2021-10-11 02:25:08,380 INFO L226 Difference]: Without dead ends: 183 [2021-10-11 02:25:08,381 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-10-11 02:25:08,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-10-11 02:25:08,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2021-10-11 02:25:08,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2021-10-11 02:25:08,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 364 transitions. [2021-10-11 02:25:08,387 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 364 transitions. Word has length 19 [2021-10-11 02:25:08,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:25:08,388 INFO L481 AbstractCegarLoop]: Abstraction has 183 states and 364 transitions. [2021-10-11 02:25:08,388 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-10-11 02:25:08,388 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 364 transitions. [2021-10-11 02:25:08,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-11 02:25:08,389 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:25:08,389 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:25:08,389 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-11 02:25:08,389 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:25:08,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:25:08,390 INFO L82 PathProgramCache]: Analyzing trace with hash -445266509, now seen corresponding path program 3 times [2021-10-11 02:25:08,390 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:25:08,390 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005933207] [2021-10-11 02:25:08,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:25:08,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:25:08,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:25:08,664 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005933207] [2021-10-11 02:25:08,665 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:25:08,665 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-11 02:25:08,665 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923792412] [2021-10-11 02:25:08,665 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-10-11 02:25:08,665 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:25:08,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-11 02:25:08,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-10-11 02:25:08,666 INFO L87 Difference]: Start difference. First operand 183 states and 364 transitions. Second operand 9 states. [2021-10-11 02:25:08,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:25:08,896 INFO L93 Difference]: Finished difference Result 183 states and 361 transitions. [2021-10-11 02:25:08,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 02:25:08,897 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2021-10-11 02:25:08,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:25:08,898 INFO L225 Difference]: With dead ends: 183 [2021-10-11 02:25:08,899 INFO L226 Difference]: Without dead ends: 153 [2021-10-11 02:25:08,899 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-10-11 02:25:08,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-10-11 02:25:08,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 145. [2021-10-11 02:25:08,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2021-10-11 02:25:08,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 293 transitions. [2021-10-11 02:25:08,904 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 293 transitions. Word has length 19 [2021-10-11 02:25:08,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:25:08,904 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 293 transitions. [2021-10-11 02:25:08,904 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-10-11 02:25:08,905 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 293 transitions. [2021-10-11 02:25:08,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-11 02:25:08,905 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:25:08,905 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:25:08,905 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-11 02:25:08,905 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:25:08,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:25:08,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1211997573, now seen corresponding path program 1 times [2021-10-11 02:25:08,906 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:25:08,906 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974570583] [2021-10-11 02:25:08,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:25:08,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:25:09,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:25:09,001 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974570583] [2021-10-11 02:25:09,002 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:25:09,002 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 02:25:09,002 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356717445] [2021-10-11 02:25:09,002 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 02:25:09,003 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:25:09,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 02:25:09,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:25:09,003 INFO L87 Difference]: Start difference. First operand 145 states and 293 transitions. Second operand 6 states. [2021-10-11 02:25:09,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:25:09,050 INFO L93 Difference]: Finished difference Result 124 states and 250 transitions. [2021-10-11 02:25:09,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 02:25:09,051 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2021-10-11 02:25:09,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:25:09,052 INFO L225 Difference]: With dead ends: 124 [2021-10-11 02:25:09,052 INFO L226 Difference]: Without dead ends: 97 [2021-10-11 02:25:09,053 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 [2021-10-11 02:25:09,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-10-11 02:25:09,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 87. [2021-10-11 02:25:09,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2021-10-11 02:25:09,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 166 transitions. [2021-10-11 02:25:09,058 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 166 transitions. Word has length 19 [2021-10-11 02:25:09,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:25:09,058 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 166 transitions. [2021-10-11 02:25:09,058 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 02:25:09,059 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 166 transitions. [2021-10-11 02:25:09,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-11 02:25:09,059 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:25:09,060 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:25:09,060 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-11 02:25:09,060 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:25:09,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:25:09,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1196716410, now seen corresponding path program 1 times [2021-10-11 02:25:09,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:25:09,061 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600211705] [2021-10-11 02:25:09,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:25:09,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:25:09,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:25:09,422 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600211705] [2021-10-11 02:25:09,423 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:25:09,423 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-11 02:25:09,423 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585689313] [2021-10-11 02:25:09,423 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-10-11 02:25:09,424 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:25:09,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-11 02:25:09,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-10-11 02:25:09,425 INFO L87 Difference]: Start difference. First operand 87 states and 166 transitions. Second operand 10 states. [2021-10-11 02:25:09,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:25:09,680 INFO L93 Difference]: Finished difference Result 124 states and 226 transitions. [2021-10-11 02:25:09,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 02:25:09,680 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2021-10-11 02:25:09,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:25:09,681 INFO L225 Difference]: With dead ends: 124 [2021-10-11 02:25:09,681 INFO L226 Difference]: Without dead ends: 79 [2021-10-11 02:25:09,681 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-10-11 02:25:09,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2021-10-11 02:25:09,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 63. [2021-10-11 02:25:09,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2021-10-11 02:25:09,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 110 transitions. [2021-10-11 02:25:09,684 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 110 transitions. Word has length 22 [2021-10-11 02:25:09,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:25:09,684 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 110 transitions. [2021-10-11 02:25:09,684 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-10-11 02:25:09,684 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 110 transitions. [2021-10-11 02:25:09,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-11 02:25:09,684 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:25:09,684 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:25:09,684 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-11 02:25:09,684 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:25:09,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:25:09,685 INFO L82 PathProgramCache]: Analyzing trace with hash 2124764362, now seen corresponding path program 2 times [2021-10-11 02:25:09,685 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:25:09,685 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097873734] [2021-10-11 02:25:09,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:25:09,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 02:25:09,723 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 02:25:09,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 02:25:09,780 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 02:25:09,834 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-10-11 02:25:09,835 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-10-11 02:25:09,835 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-11 02:25:09,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:25:09 BasicIcfg [2021-10-11 02:25:09,944 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-11 02:25:09,945 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-11 02:25:09,945 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-11 02:25:09,945 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-11 02:25:09,946 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:24:46" (3/4) ... [2021-10-11 02:25:09,947 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-11 02:25:10,063 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3f1ab63-2e0c-4b71-87c2-8be78cace4b5/bin/utaipan-WLngWcDbfI/witness.graphml [2021-10-11 02:25:10,063 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-11 02:25:10,064 INFO L168 Benchmark]: Toolchain (without parser) took 27511.37 ms. Allocated memory was 100.7 MB in the beginning and 390.1 MB in the end (delta: 289.4 MB). Free memory was 67.9 MB in the beginning and 301.5 MB in the end (delta: -233.7 MB). Peak memory consumption was 55.2 MB. Max. memory is 16.1 GB. [2021-10-11 02:25:10,064 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 81.8 MB. Free memory was 52.8 MB in the beginning and 52.8 MB in the end (delta: 21.3 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 02:25:10,065 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1042.53 ms. Allocated memory is still 100.7 MB. Free memory was 67.3 MB in the beginning and 53.2 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-10-11 02:25:10,066 INFO L168 Benchmark]: Boogie Procedure Inliner took 123.88 ms. Allocated memory is still 100.7 MB. Free memory was 53.2 MB in the beginning and 50.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 02:25:10,067 INFO L168 Benchmark]: Boogie Preprocessor took 98.42 ms. Allocated memory is still 100.7 MB. Free memory was 50.6 MB in the beginning and 48.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 02:25:10,067 INFO L168 Benchmark]: RCFGBuilder took 2751.36 ms. Allocated memory was 100.7 MB in the beginning and 138.4 MB in the end (delta: 37.7 MB). Free memory was 48.5 MB in the beginning and 108.5 MB in the end (delta: -60.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 16.1 GB. [2021-10-11 02:25:10,067 INFO L168 Benchmark]: TraceAbstraction took 23365.73 ms. Allocated memory was 138.4 MB in the beginning and 390.1 MB in the end (delta: 251.7 MB). Free memory was 107.5 MB in the beginning and 315.2 MB in the end (delta: -207.7 MB). Peak memory consumption was 42.9 MB. Max. memory is 16.1 GB. [2021-10-11 02:25:10,068 INFO L168 Benchmark]: Witness Printer took 118.41 ms. Allocated memory is still 390.1 MB. Free memory was 315.2 MB in the beginning and 301.5 MB in the end (delta: 13.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-10-11 02:25:10,071 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.31 ms. Allocated memory is still 81.8 MB. Free memory was 52.8 MB in the beginning and 52.8 MB in the end (delta: 21.3 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 1042.53 ms. Allocated memory is still 100.7 MB. Free memory was 67.3 MB in the beginning and 53.2 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 123.88 ms. Allocated memory is still 100.7 MB. Free memory was 53.2 MB in the beginning and 50.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 98.42 ms. Allocated memory is still 100.7 MB. Free memory was 50.6 MB in the beginning and 48.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2751.36 ms. Allocated memory was 100.7 MB in the beginning and 138.4 MB in the end (delta: 37.7 MB). Free memory was 48.5 MB in the beginning and 108.5 MB in the end (delta: -60.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 23365.73 ms. Allocated memory was 138.4 MB in the beginning and 390.1 MB in the end (delta: 251.7 MB). Free memory was 107.5 MB in the beginning and 315.2 MB in the end (delta: -207.7 MB). Peak memory consumption was 42.9 MB. Max. memory is 16.1 GB. * Witness Printer took 118.41 ms. Allocated memory is still 390.1 MB. Free memory was 315.2 MB in the beginning and 301.5 MB in the end (delta: 13.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1201 VarBasedMoverChecksPositive, 66 VarBasedMoverChecksNegative, 29 SemBasedMoverChecksPositive, 37 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 159 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 14.3s, 105 PlacesBefore, 37 PlacesAfterwards, 97 TransitionsBefore, 28 TransitionsAfterwards, 1694 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 81 TotalNumberOfCompositions, 4814 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; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L719] 0 int z = 0; [L720] 0 _Bool z$flush_delayed; [L721] 0 int z$mem_tmp; [L722] 0 _Bool z$r_buff0_thd0; [L723] 0 _Bool z$r_buff0_thd1; [L724] 0 _Bool z$r_buff0_thd2; [L725] 0 _Bool z$r_buff0_thd3; [L726] 0 _Bool z$r_buff1_thd0; [L727] 0 _Bool z$r_buff1_thd1; [L728] 0 _Bool z$r_buff1_thd2; [L729] 0 _Bool z$r_buff1_thd3; [L730] 0 _Bool z$read_delayed; [L731] 0 int *z$read_delayed_var; [L732] 0 int z$w_buff0; [L733] 0 _Bool z$w_buff0_used; [L734] 0 int z$w_buff1; [L735] 0 _Bool z$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t2037; [L819] FCALL, FORK 0 pthread_create(&t2037, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L820] 0 pthread_t t2038; [L821] FCALL, FORK 0 pthread_create(&t2038, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L822] 0 pthread_t t2039; [L823] FCALL, FORK 0 pthread_create(&t2039, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 2 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, 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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, 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, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L796] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L796] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L797] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L798] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L798] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L799] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L800] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L800] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L756] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L776] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L776] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L777] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L777] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L778] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L779] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L779] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L780] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L829] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L829] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L830] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L831] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L831] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L832] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L833] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L833] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 z$flush_delayed = weak$$choice2 [L839] 0 z$mem_tmp = z [L840] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L840] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L841] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L841] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L842] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L842] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L843] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L843] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L844] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L845] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L846] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L848] 0 z = z$flush_delayed ? z$mem_tmp : z [L849] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 96 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 23.0s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 14.5s, HoareTripleCheckerStatistics: 713 SDtfs, 879 SDslu, 1798 SDs, 0 SdLazy, 1093 SolverSat, 251 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 167 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=974occurred 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.5s AutomataMinimizationTime, 26 MinimizatonAttempts, 569 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 415 NumberOfCodeBlocks, 415 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 367 ConstructedInterpolants, 0 QuantifiedInterpolants, 52743 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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...