./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe010_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c6b78d71-3ada-4f2a-b7f1-2553b40d157e/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_c6b78d71-3ada-4f2a-b7f1-2553b40d157e/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c6b78d71-3ada-4f2a-b7f1-2553b40d157e/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c6b78d71-3ada-4f2a-b7f1-2553b40d157e/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe010_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_c6b78d71-3ada-4f2a-b7f1-2553b40d157e/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c6b78d71-3ada-4f2a-b7f1-2553b40d157e/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9a4f3deacaba0f29c3fb37425b4075902dc6c5e9 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2020-12-09 05:38:56,873 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 05:38:56,875 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 05:38:56,904 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 05:38:56,905 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 05:38:56,906 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 05:38:56,907 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 05:38:56,909 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 05:38:56,910 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 05:38:56,911 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 05:38:56,912 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 05:38:56,913 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 05:38:56,913 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 05:38:56,914 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 05:38:56,915 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 05:38:56,916 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 05:38:56,917 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 05:38:56,917 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 05:38:56,919 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 05:38:56,920 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 05:38:56,922 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 05:38:56,923 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 05:38:56,924 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 05:38:56,925 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 05:38:56,927 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 05:38:56,927 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 05:38:56,928 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 05:38:56,928 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 05:38:56,929 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 05:38:56,930 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 05:38:56,930 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 05:38:56,931 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 05:38:56,931 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 05:38:56,932 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 05:38:56,933 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 05:38:56,933 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 05:38:56,934 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 05:38:56,934 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 05:38:56,934 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 05:38:56,935 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 05:38:56,935 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 05:38:56,936 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c6b78d71-3ada-4f2a-b7f1-2553b40d157e/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-09 05:38:56,952 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 05:38:56,952 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 05:38:56,953 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 05:38:56,953 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 05:38:56,953 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 05:38:56,953 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 05:38:56,953 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 05:38:56,953 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 05:38:56,953 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 05:38:56,953 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 05:38:56,954 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 05:38:56,954 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 05:38:56,954 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 05:38:56,954 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 05:38:56,954 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 05:38:56,954 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 05:38:56,955 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 05:38:56,955 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 05:38:56,955 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 05:38:56,955 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 05:38:56,955 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 05:38:56,955 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 05:38:56,955 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 05:38:56,955 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 05:38:56,955 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 05:38:56,955 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 05:38:56,956 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 05:38:56,956 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 05:38:56,956 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 05:38:56,956 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 05:38:56,956 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 05:38:56,956 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 05:38:56,956 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 05:38:56,956 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 05:38:56,957 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 05:38:56,957 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 05:38:56,957 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 05:38:56,957 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 05:38:56,957 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 05:38:56,957 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_c6b78d71-3ada-4f2a-b7f1-2553b40d157e/bin/utaipan/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_c6b78d71-3ada-4f2a-b7f1-2553b40d157e/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9a4f3deacaba0f29c3fb37425b4075902dc6c5e9 [2020-12-09 05:38:57,146 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 05:38:57,162 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 05:38:57,164 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 05:38:57,165 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 05:38:57,165 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 05:38:57,166 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c6b78d71-3ada-4f2a-b7f1-2553b40d157e/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/safe010_pso.opt.i [2020-12-09 05:38:57,205 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c6b78d71-3ada-4f2a-b7f1-2553b40d157e/bin/utaipan/data/5e124d0d2/4f367576808b445982faca31e0184805/FLAG8dce0ab5a [2020-12-09 05:38:57,613 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 05:38:57,613 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c6b78d71-3ada-4f2a-b7f1-2553b40d157e/sv-benchmarks/c/pthread-wmm/safe010_pso.opt.i [2020-12-09 05:38:57,624 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c6b78d71-3ada-4f2a-b7f1-2553b40d157e/bin/utaipan/data/5e124d0d2/4f367576808b445982faca31e0184805/FLAG8dce0ab5a [2020-12-09 05:38:57,634 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c6b78d71-3ada-4f2a-b7f1-2553b40d157e/bin/utaipan/data/5e124d0d2/4f367576808b445982faca31e0184805 [2020-12-09 05:38:57,635 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 05:38:57,636 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 05:38:57,638 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 05:38:57,638 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 05:38:57,640 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 05:38:57,640 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:38:57" (1/1) ... [2020-12-09 05:38:57,642 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e739fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:38:57, skipping insertion in model container [2020-12-09 05:38:57,642 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:38:57" (1/1) ... [2020-12-09 05:38:57,647 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 05:38:57,692 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 05:38:57,793 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_c6b78d71-3ada-4f2a-b7f1-2553b40d157e/sv-benchmarks/c/pthread-wmm/safe010_pso.opt.i[949,962] [2020-12-09 05:38:57,893 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 05:38:57,900 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 05:38:57,908 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_c6b78d71-3ada-4f2a-b7f1-2553b40d157e/sv-benchmarks/c/pthread-wmm/safe010_pso.opt.i[949,962] [2020-12-09 05:38:57,940 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 05:38:57,988 INFO L208 MainTranslator]: Completed translation [2020-12-09 05:38:57,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:38:57 WrapperNode [2020-12-09 05:38:57,988 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 05:38:57,989 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 05:38:57,989 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 05:38:57,989 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 05:38:57,998 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:38:57" (1/1) ... [2020-12-09 05:38:58,010 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:38:57" (1/1) ... [2020-12-09 05:38:58,039 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 05:38:58,039 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 05:38:58,040 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 05:38:58,040 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 05:38:58,048 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:38:57" (1/1) ... [2020-12-09 05:38:58,048 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:38:57" (1/1) ... [2020-12-09 05:38:58,053 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:38:57" (1/1) ... [2020-12-09 05:38:58,053 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:38:57" (1/1) ... [2020-12-09 05:38:58,062 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:38:57" (1/1) ... [2020-12-09 05:38:58,066 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:38:57" (1/1) ... [2020-12-09 05:38:58,069 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:38:57" (1/1) ... [2020-12-09 05:38:58,073 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 05:38:58,073 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 05:38:58,074 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 05:38:58,074 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 05:38:58,075 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:38:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c6b78d71-3ada-4f2a-b7f1-2553b40d157e/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 05:38:58,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-09 05:38:58,137 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-12-09 05:38:58,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 05:38:58,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-09 05:38:58,137 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-12-09 05:38:58,137 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-12-09 05:38:58,137 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-12-09 05:38:58,137 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-12-09 05:38:58,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 05:38:58,138 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-12-09 05:38:58,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 05:38:58,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 05:38:58,139 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-12-09 05:38:59,308 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 05:38:59,309 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2020-12-09 05:38:59,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:38:59 BoogieIcfgContainer [2020-12-09 05:38:59,310 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 05:38:59,311 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 05:38:59,311 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 05:38:59,314 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 05:38:59,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 05:38:57" (1/3) ... [2020-12-09 05:38:59,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bf1aacf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:38:59, skipping insertion in model container [2020-12-09 05:38:59,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:38:57" (2/3) ... [2020-12-09 05:38:59,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bf1aacf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:38:59, skipping insertion in model container [2020-12-09 05:38:59,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:38:59" (3/3) ... [2020-12-09 05:38:59,316 INFO L111 eAbstractionObserver]: Analyzing ICFG safe010_pso.opt.i [2020-12-09 05:38:59,325 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-09 05:38:59,325 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 05:38:59,328 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-09 05:38:59,328 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-09 05:38:59,352 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,352 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,352 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,352 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,353 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,353 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,353 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,353 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,353 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,353 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,354 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,354 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,354 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,354 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,354 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,354 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,355 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,355 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,355 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,355 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,355 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,355 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,355 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,356 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,356 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,356 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,356 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,356 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,356 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,357 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,357 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,357 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,357 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,358 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,358 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,358 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,358 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,358 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,359 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,359 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,359 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,359 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,359 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,359 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,359 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,359 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,360 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,360 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,360 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,360 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,360 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,361 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,361 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,361 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,361 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,361 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,362 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,362 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,362 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,362 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,365 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,365 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,365 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,365 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,365 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,365 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,365 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,366 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,367 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,368 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,368 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,368 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,368 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,368 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,369 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,369 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,369 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,369 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 05:38:59,370 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-12-09 05:38:59,380 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-12-09 05:38:59,409 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 05:38:59,409 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 05:38:59,410 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 05:38:59,410 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 05:38:59,410 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 05:38:59,410 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 05:38:59,410 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 05:38:59,410 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 05:38:59,418 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-12-09 05:38:59,420 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 80 transitions, 170 flow [2020-12-09 05:38:59,422 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 80 transitions, 170 flow [2020-12-09 05:38:59,423 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 85 places, 80 transitions, 170 flow [2020-12-09 05:38:59,456 INFO L129 PetriNetUnfolder]: 2/78 cut-off events. [2020-12-09 05:38:59,456 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-12-09 05:38:59,459 INFO L84 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 78 events. 2/78 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2020-12-09 05:38:59,461 INFO L116 LiptonReduction]: Number of co-enabled transitions 926 [2020-12-09 05:38:59,767 WARN L197 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-12-09 05:39:00,125 WARN L197 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2020-12-09 05:39:00,234 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2020-12-09 05:39:00,316 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 05:39:00,317 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:39:00,319 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 05:39:00,319 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:39:00,374 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 05:39:00,374 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:39:00,375 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 05:39:00,375 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:39:00,446 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:39:00,446 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:39:00,450 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 05:39:00,451 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:39:00,452 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:39:00,452 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:39:00,455 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:39:00,455 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 05:39:00,457 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:39:00,457 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 05:39:00,458 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:39:00,458 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 05:39:00,461 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 05:39:00,462 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:39:00,464 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 05:39:00,464 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:39:00,465 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 05:39:00,466 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:39:00,513 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 05:39:00,514 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:39:00,514 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 05:39:00,515 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:39:00,517 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 05:39:00,517 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 05:39:00,519 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 05:39:00,519 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:39:00,859 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 05:39:00,859 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:39:00,860 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 05:39:00,860 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:39:00,869 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 4, 3, 2, 1] term [2020-12-09 05:39:00,870 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:39:00,870 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term [2020-12-09 05:39:00,870 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:39:00,871 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 4, 3, 2, 1] term [2020-12-09 05:39:00,871 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:39:00,896 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 2, 1] term [2020-12-09 05:39:00,897 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:39:00,897 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 05:39:00,898 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:39:01,785 WARN L197 SmtUtils]: Spent 869.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 184 [2020-12-09 05:39:02,107 WARN L197 SmtUtils]: Spent 320.00 ms on a formula simplification that was a NOOP. DAG size: 182 [2020-12-09 05:39:03,644 WARN L197 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 308 DAG size of output: 264 [2020-12-09 05:39:04,303 WARN L197 SmtUtils]: Spent 657.00 ms on a formula simplification that was a NOOP. DAG size: 261 [2020-12-09 05:39:04,329 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 05:39:04,329 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:39:04,330 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 05:39:04,330 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:39:04,331 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 05:39:04,332 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 05:39:04,340 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 05:39:04,340 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:39:04,371 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:39:04,371 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:39:04,381 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 05:39:04,381 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:39:04,382 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:39:04,382 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:39:04,384 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:39:04,384 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 05:39:04,385 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:39:04,385 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 05:39:04,386 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:39:04,386 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 05:39:04,388 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 05:39:04,388 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:39:04,389 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 05:39:04,389 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:39:04,390 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 05:39:04,390 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:39:04,505 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:39:04,505 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:39:04,507 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 05:39:04,507 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:39:04,508 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:39:04,508 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:39:04,509 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:39:04,509 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 05:39:04,511 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:39:04,511 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 05:39:04,512 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 05:39:04,512 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 05:39:04,513 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 05:39:04,513 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:39:04,514 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 05:39:04,514 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:39:04,516 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-09 05:39:04,516 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:39:04,555 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 05:39:04,555 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:39:04,555 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 05:39:04,555 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:39:04,557 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 05:39:04,557 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 05:39:04,559 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 05:39:04,559 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:39:04,599 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 05:39:04,599 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:39:04,600 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 05:39:04,600 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:39:04,631 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 05:39:04,631 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:39:04,631 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 05:39:04,632 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:39:04,665 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 05:39:04,665 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:39:04,666 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 05:39:04,666 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:39:04,695 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 05:39:04,695 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:39:04,696 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 05:39:04,696 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:39:05,015 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 05:39:05,016 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:39:05,017 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 05:39:05,017 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:39:05,052 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 05:39:05,052 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:39:05,053 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 05:39:05,053 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:39:05,082 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-12-09 05:39:05,082 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:39:05,162 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 05:39:05,162 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:39:05,163 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 05:39:05,163 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:39:05,181 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 05:39:05,181 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:39:05,182 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 05:39:05,182 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:39:05,210 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-09 05:39:05,210 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:39:05,211 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 05:39:05,211 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:39:05,236 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 05:39:05,237 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:39:05,237 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 05:39:05,238 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:39:05,270 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2020-12-09 05:39:05,270 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:39:05,532 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 2, 1] term [2020-12-09 05:39:05,532 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:39:05,532 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 05:39:05,532 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:39:05,549 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-09 05:39:05,549 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:39:05,550 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-09 05:39:05,550 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:39:05,942 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-12-09 05:39:05,942 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:39:06,989 WARN L197 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 106 [2020-12-09 05:39:07,149 WARN L197 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-12-09 05:39:07,444 WARN L197 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 106 [2020-12-09 05:39:07,573 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-12-09 05:39:07,583 INFO L131 LiptonReduction]: Checked pairs total: 2423 [2020-12-09 05:39:07,583 INFO L133 LiptonReduction]: Total number of compositions: 73 [2020-12-09 05:39:07,588 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 27 places, 21 transitions, 52 flow [2020-12-09 05:39:07,599 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 194 states. [2020-12-09 05:39:07,601 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states. [2020-12-09 05:39:07,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-12-09 05:39:07,604 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:39:07,605 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-12-09 05:39:07,605 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:39:07,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:39:07,610 INFO L82 PathProgramCache]: Analyzing trace with hash 914219, now seen corresponding path program 1 times [2020-12-09 05:39:07,618 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:39:07,619 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412093684] [2020-12-09 05:39:07,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:39:07,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:39:07,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:39:07,764 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412093684] [2020-12-09 05:39:07,764 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:39:07,764 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-09 05:39:07,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060292516] [2020-12-09 05:39:07,767 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 05:39:07,767 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:39:07,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 05:39:07,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:39:07,777 INFO L87 Difference]: Start difference. First operand 194 states. Second operand 3 states. [2020-12-09 05:39:07,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:39:07,818 INFO L93 Difference]: Finished difference Result 162 states and 385 transitions. [2020-12-09 05:39:07,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:39:07,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-12-09 05:39:07,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:39:07,828 INFO L225 Difference]: With dead ends: 162 [2020-12-09 05:39:07,828 INFO L226 Difference]: Without dead ends: 137 [2020-12-09 05:39:07,829 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:39:07,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-12-09 05:39:07,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2020-12-09 05:39:07,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-12-09 05:39:07,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 320 transitions. [2020-12-09 05:39:07,873 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 320 transitions. Word has length 3 [2020-12-09 05:39:07,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:39:07,873 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 320 transitions. [2020-12-09 05:39:07,873 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 05:39:07,873 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 320 transitions. [2020-12-09 05:39:07,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-12-09 05:39:07,874 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:39:07,874 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:39:07,874 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 05:39:07,874 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:39:07,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:39:07,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1599981207, now seen corresponding path program 1 times [2020-12-09 05:39:07,875 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:39:07,875 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767495341] [2020-12-09 05:39:07,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:39:07,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:39:08,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:39:08,001 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767495341] [2020-12-09 05:39:08,001 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:39:08,001 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 05:39:08,002 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815575331] [2020-12-09 05:39:08,003 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 05:39:08,003 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:39:08,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 05:39:08,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:39:08,004 INFO L87 Difference]: Start difference. First operand 137 states and 320 transitions. Second operand 4 states. [2020-12-09 05:39:08,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:39:08,031 INFO L93 Difference]: Finished difference Result 152 states and 337 transitions. [2020-12-09 05:39:08,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 05:39:08,032 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-12-09 05:39:08,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:39:08,033 INFO L225 Difference]: With dead ends: 152 [2020-12-09 05:39:08,033 INFO L226 Difference]: Without dead ends: 127 [2020-12-09 05:39:08,034 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 05:39:08,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-12-09 05:39:08,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2020-12-09 05:39:08,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-12-09 05:39:08,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 292 transitions. [2020-12-09 05:39:08,045 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 292 transitions. Word has length 8 [2020-12-09 05:39:08,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:39:08,045 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 292 transitions. [2020-12-09 05:39:08,045 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 05:39:08,045 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 292 transitions. [2020-12-09 05:39:08,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 05:39:08,046 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:39:08,046 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:39:08,046 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-09 05:39:08,046 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:39:08,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:39:08,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1939606054, now seen corresponding path program 1 times [2020-12-09 05:39:08,047 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:39:08,047 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743090262] [2020-12-09 05:39:08,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:39:08,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:39:08,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:39:08,121 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743090262] [2020-12-09 05:39:08,121 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:39:08,121 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 05:39:08,122 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889315696] [2020-12-09 05:39:08,122 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 05:39:08,122 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:39:08,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 05:39:08,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 05:39:08,122 INFO L87 Difference]: Start difference. First operand 127 states and 292 transitions. Second operand 5 states. [2020-12-09 05:39:08,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:39:08,167 INFO L93 Difference]: Finished difference Result 167 states and 374 transitions. [2020-12-09 05:39:08,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 05:39:08,168 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-12-09 05:39:08,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:39:08,169 INFO L225 Difference]: With dead ends: 167 [2020-12-09 05:39:08,169 INFO L226 Difference]: Without dead ends: 87 [2020-12-09 05:39:08,169 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 [2020-12-09 05:39:08,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-12-09 05:39:08,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2020-12-09 05:39:08,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-12-09 05:39:08,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 184 transitions. [2020-12-09 05:39:08,176 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 184 transitions. Word has length 9 [2020-12-09 05:39:08,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:39:08,176 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 184 transitions. [2020-12-09 05:39:08,176 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 05:39:08,176 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 184 transitions. [2020-12-09 05:39:08,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-09 05:39:08,177 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:39:08,177 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:39:08,177 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-09 05:39:08,177 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:39:08,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:39:08,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1839059167, now seen corresponding path program 1 times [2020-12-09 05:39:08,178 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:39:08,178 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525258558] [2020-12-09 05:39:08,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:39:08,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:39:08,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:39:08,290 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525258558] [2020-12-09 05:39:08,290 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:39:08,290 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 05:39:08,290 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691552668] [2020-12-09 05:39:08,291 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 05:39:08,291 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:39:08,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 05:39:08,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-09 05:39:08,291 INFO L87 Difference]: Start difference. First operand 87 states and 184 transitions. Second operand 6 states. [2020-12-09 05:39:08,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:39:08,400 INFO L93 Difference]: Finished difference Result 95 states and 191 transitions. [2020-12-09 05:39:08,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 05:39:08,400 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-12-09 05:39:08,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:39:08,401 INFO L225 Difference]: With dead ends: 95 [2020-12-09 05:39:08,401 INFO L226 Difference]: Without dead ends: 83 [2020-12-09 05:39:08,401 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-12-09 05:39:08,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-12-09 05:39:08,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2020-12-09 05:39:08,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-12-09 05:39:08,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 172 transitions. [2020-12-09 05:39:08,405 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 172 transitions. Word has length 11 [2020-12-09 05:39:08,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:39:08,405 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 172 transitions. [2020-12-09 05:39:08,405 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 05:39:08,405 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 172 transitions. [2020-12-09 05:39:08,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-09 05:39:08,406 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:39:08,406 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:39:08,406 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-09 05:39:08,406 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:39:08,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:39:08,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1175562397, now seen corresponding path program 1 times [2020-12-09 05:39:08,406 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:39:08,406 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572164696] [2020-12-09 05:39:08,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:39:08,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:39:08,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:39:08,457 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572164696] [2020-12-09 05:39:08,457 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:39:08,457 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 05:39:08,458 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817872223] [2020-12-09 05:39:08,458 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 05:39:08,458 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:39:08,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 05:39:08,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:39:08,459 INFO L87 Difference]: Start difference. First operand 83 states and 172 transitions. Second operand 4 states. [2020-12-09 05:39:08,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:39:08,481 INFO L93 Difference]: Finished difference Result 72 states and 126 transitions. [2020-12-09 05:39:08,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 05:39:08,482 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-12-09 05:39:08,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:39:08,482 INFO L225 Difference]: With dead ends: 72 [2020-12-09 05:39:08,482 INFO L226 Difference]: Without dead ends: 55 [2020-12-09 05:39:08,483 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 05:39:08,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-12-09 05:39:08,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2020-12-09 05:39:08,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-12-09 05:39:08,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 92 transitions. [2020-12-09 05:39:08,485 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 92 transitions. Word has length 12 [2020-12-09 05:39:08,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:39:08,485 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 92 transitions. [2020-12-09 05:39:08,485 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 05:39:08,485 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 92 transitions. [2020-12-09 05:39:08,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-09 05:39:08,486 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:39:08,486 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:39:08,486 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-09 05:39:08,486 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:39:08,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:39:08,486 INFO L82 PathProgramCache]: Analyzing trace with hash -554044553, now seen corresponding path program 1 times [2020-12-09 05:39:08,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:39:08,487 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107352122] [2020-12-09 05:39:08,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:39:08,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:39:08,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:39:08,538 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107352122] [2020-12-09 05:39:08,538 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:39:08,538 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 05:39:08,538 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082431485] [2020-12-09 05:39:08,538 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 05:39:08,538 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:39:08,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 05:39:08,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 05:39:08,539 INFO L87 Difference]: Start difference. First operand 55 states and 92 transitions. Second operand 5 states. [2020-12-09 05:39:08,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:39:08,566 INFO L93 Difference]: Finished difference Result 40 states and 60 transitions. [2020-12-09 05:39:08,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 05:39:08,566 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-12-09 05:39:08,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:39:08,567 INFO L225 Difference]: With dead ends: 40 [2020-12-09 05:39:08,567 INFO L226 Difference]: Without dead ends: 33 [2020-12-09 05:39:08,567 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-09 05:39:08,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-12-09 05:39:08,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-12-09 05:39:08,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-12-09 05:39:08,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 48 transitions. [2020-12-09 05:39:08,569 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 48 transitions. Word has length 13 [2020-12-09 05:39:08,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:39:08,569 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 48 transitions. [2020-12-09 05:39:08,569 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 05:39:08,569 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 48 transitions. [2020-12-09 05:39:08,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 05:39:08,569 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:39:08,569 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:39:08,569 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-09 05:39:08,569 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:39:08,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:39:08,570 INFO L82 PathProgramCache]: Analyzing trace with hash -647783936, now seen corresponding path program 1 times [2020-12-09 05:39:08,570 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:39:08,570 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550999962] [2020-12-09 05:39:08,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:39:08,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:39:08,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:39:08,756 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550999962] [2020-12-09 05:39:08,756 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:39:08,756 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-09 05:39:08,756 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958240340] [2020-12-09 05:39:08,757 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-09 05:39:08,757 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:39:08,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-09 05:39:08,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-09 05:39:08,757 INFO L87 Difference]: Start difference. First operand 33 states and 48 transitions. Second operand 8 states. [2020-12-09 05:39:08,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:39:08,889 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2020-12-09 05:39:08,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 05:39:08,889 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-12-09 05:39:08,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:39:08,890 INFO L225 Difference]: With dead ends: 50 [2020-12-09 05:39:08,890 INFO L226 Difference]: Without dead ends: 33 [2020-12-09 05:39:08,890 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2020-12-09 05:39:08,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-12-09 05:39:08,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2020-12-09 05:39:08,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-12-09 05:39:08,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2020-12-09 05:39:08,891 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 16 [2020-12-09 05:39:08,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:39:08,892 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2020-12-09 05:39:08,892 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-09 05:39:08,892 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2020-12-09 05:39:08,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 05:39:08,892 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:39:08,892 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:39:08,892 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-09 05:39:08,892 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:39:08,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:39:08,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1457285376, now seen corresponding path program 2 times [2020-12-09 05:39:08,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:39:08,893 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195814599] [2020-12-09 05:39:08,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:39:08,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 05:39:08,921 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 05:39:08,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 05:39:08,949 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 05:39:08,971 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-12-09 05:39:08,972 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-09 05:39:08,972 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-09 05:39:09,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 05:39:09 BasicIcfg [2020-12-09 05:39:09,013 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 05:39:09,013 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 05:39:09,013 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 05:39:09,014 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 05:39:09,014 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:38:59" (3/4) ... [2020-12-09 05:39:09,015 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-09 05:39:09,085 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_c6b78d71-3ada-4f2a-b7f1-2553b40d157e/bin/utaipan/witness.graphml [2020-12-09 05:39:09,085 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 05:39:09,086 INFO L168 Benchmark]: Toolchain (without parser) took 11449.47 ms. Allocated memory was 96.5 MB in the beginning and 209.7 MB in the end (delta: 113.2 MB). Free memory was 54.4 MB in the beginning and 106.4 MB in the end (delta: -52.1 MB). Peak memory consumption was 64.0 MB. Max. memory is 16.1 GB. [2020-12-09 05:39:09,087 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 96.5 MB. Free memory is still 72.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 05:39:09,087 INFO L168 Benchmark]: CACSL2BoogieTranslator took 350.97 ms. Allocated memory is still 96.5 MB. Free memory was 54.2 MB in the beginning and 44.7 MB in the end (delta: 9.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 16.1 GB. [2020-12-09 05:39:09,087 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.89 ms. Allocated memory is still 96.5 MB. Free memory was 44.7 MB in the beginning and 72.0 MB in the end (delta: -27.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-09 05:39:09,087 INFO L168 Benchmark]: Boogie Preprocessor took 33.16 ms. Allocated memory is still 96.5 MB. Free memory was 72.0 MB in the beginning and 69.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 05:39:09,088 INFO L168 Benchmark]: RCFGBuilder took 1236.88 ms. Allocated memory was 96.5 MB in the beginning and 119.5 MB in the end (delta: 23.1 MB). Free memory was 69.9 MB in the beginning and 45.7 MB in the end (delta: 24.2 MB). Peak memory consumption was 64.0 MB. Max. memory is 16.1 GB. [2020-12-09 05:39:09,088 INFO L168 Benchmark]: TraceAbstraction took 9701.83 ms. Allocated memory was 119.5 MB in the beginning and 209.7 MB in the end (delta: 90.2 MB). Free memory was 44.7 MB in the beginning and 114.8 MB in the end (delta: -70.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 16.1 GB. [2020-12-09 05:39:09,089 INFO L168 Benchmark]: Witness Printer took 72.09 ms. Allocated memory is still 209.7 MB. Free memory was 114.8 MB in the beginning and 106.4 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-12-09 05:39:09,091 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 96.5 MB. Free memory is still 72.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 350.97 ms. Allocated memory is still 96.5 MB. Free memory was 54.2 MB in the beginning and 44.7 MB in the end (delta: 9.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 49.89 ms. Allocated memory is still 96.5 MB. Free memory was 44.7 MB in the beginning and 72.0 MB in the end (delta: -27.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 33.16 ms. Allocated memory is still 96.5 MB. Free memory was 72.0 MB in the beginning and 69.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1236.88 ms. Allocated memory was 96.5 MB in the beginning and 119.5 MB in the end (delta: 23.1 MB). Free memory was 69.9 MB in the beginning and 45.7 MB in the end (delta: 24.2 MB). Peak memory consumption was 64.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 9701.83 ms. Allocated memory was 119.5 MB in the beginning and 209.7 MB in the end (delta: 90.2 MB). Free memory was 44.7 MB in the beginning and 114.8 MB in the end (delta: -70.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 16.1 GB. * Witness Printer took 72.09 ms. Allocated memory is still 209.7 MB. Free memory was 114.8 MB in the beginning and 106.4 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 577 VarBasedMoverChecksPositive, 42 VarBasedMoverChecksNegative, 12 SemBasedMoverChecksPositive, 30 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.1s, 61 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.1s, 85 PlacesBefore, 27 PlacesAfterwards, 80 TransitionsBefore, 21 TransitionsAfterwards, 926 CoEnabledTransitionPairs, 6 FixpointIterations, 32 TrivialSequentialCompositions, 31 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 73 TotalNumberOfCompositions, 2423 MoverChecksTotal - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L716] 0 int y = 0; [L717] 0 _Bool y$flush_delayed; [L718] 0 int y$mem_tmp; [L719] 0 _Bool y$r_buff0_thd0; [L720] 0 _Bool y$r_buff0_thd1; [L721] 0 _Bool y$r_buff0_thd2; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$read_delayed; [L726] 0 int *y$read_delayed_var; [L727] 0 int y$w_buff0; [L728] 0 _Bool y$w_buff0_used; [L729] 0 int y$w_buff1; [L730] 0 _Bool y$w_buff1_used; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L792] 0 pthread_t t2015; [L793] FCALL, FORK 0 pthread_create(&t2015, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y$w_buff1 = y$w_buff0 [L737] 1 y$w_buff0 = 2 [L738] 1 y$w_buff1_used = y$w_buff0_used [L739] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L741] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L742] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L743] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L744] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L794] 0 pthread_t t2016; [L795] FCALL, FORK 0 pthread_create(&t2016, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L747] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L767] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L750] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L751] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L752] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L753] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L753] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L754] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L754] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L759] 1 return 0; [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L774] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L3] COND FALSE 0 !(!cond) [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L802] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L803] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L804] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L804] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L805] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L805] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 y$flush_delayed = weak$$choice2 [L811] 0 y$mem_tmp = y [L812] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L812] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L813] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L813] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L814] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L814] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L815] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L815] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L816] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L817] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L818] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L818] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L819] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) [L820] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L820] 0 y = y$flush_delayed ? y$mem_tmp : y [L821] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 79 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 9.5s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.1s, HoareTripleCheckerStatistics: 123 SDtfs, 136 SDslu, 223 SDs, 0 SdLazy, 158 SolverSat, 41 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=194occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 88 NumberOfCodeBlocks, 88 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 65 ConstructedInterpolants, 0 QuantifiedInterpolants, 5425 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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...