./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/thin002_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_8fab8206-e2d6-4d00-9928-bf03667dcb7f/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_8fab8206-e2d6-4d00-9928-bf03667dcb7f/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8fab8206-e2d6-4d00-9928-bf03667dcb7f/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8fab8206-e2d6-4d00-9928-bf03667dcb7f/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/thin002_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_8fab8206-e2d6-4d00-9928-bf03667dcb7f/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8fab8206-e2d6-4d00-9928-bf03667dcb7f/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 42dcdc2e11851acf1d91dc1dde71231093bcb7e1 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-a4ecdab [2020-11-30 02:02:05,416 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 02:02:05,419 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 02:02:05,532 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 02:02:05,535 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 02:02:05,540 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 02:02:05,544 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 02:02:05,549 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 02:02:05,552 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 02:02:05,558 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 02:02:05,560 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 02:02:05,562 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 02:02:05,563 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 02:02:05,566 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 02:02:05,568 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 02:02:05,570 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 02:02:05,572 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 02:02:05,573 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 02:02:05,579 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 02:02:05,588 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 02:02:05,590 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 02:02:05,592 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 02:02:05,595 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 02:02:05,596 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 02:02:05,606 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 02:02:05,606 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 02:02:05,607 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 02:02:05,609 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 02:02:05,610 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 02:02:05,611 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 02:02:05,611 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 02:02:05,613 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 02:02:05,615 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 02:02:05,616 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 02:02:05,617 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 02:02:05,618 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 02:02:05,619 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 02:02:05,619 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 02:02:05,619 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 02:02:05,620 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 02:02:05,621 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 02:02:05,627 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8fab8206-e2d6-4d00-9928-bf03667dcb7f/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-11-30 02:02:05,670 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 02:02:05,670 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 02:02:05,672 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-11-30 02:02:05,672 INFO L138 SettingsManager]: * User list type=DISABLED [2020-11-30 02:02:05,672 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-11-30 02:02:05,672 INFO L138 SettingsManager]: * Explicit value domain=true [2020-11-30 02:02:05,673 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-11-30 02:02:05,673 INFO L138 SettingsManager]: * Octagon Domain=false [2020-11-30 02:02:05,673 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-11-30 02:02:05,673 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-11-30 02:02:05,675 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-11-30 02:02:05,675 INFO L138 SettingsManager]: * Interval Domain=false [2020-11-30 02:02:05,675 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-11-30 02:02:05,675 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-11-30 02:02:05,676 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-11-30 02:02:05,677 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 02:02:05,677 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 02:02:05,677 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 02:02:05,677 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 02:02:05,678 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 02:02:05,678 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-30 02:02:05,678 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 02:02:05,678 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-30 02:02:05,679 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-30 02:02:05,679 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 02:02:05,679 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 02:02:05,679 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 02:02:05,680 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-30 02:02:05,680 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 02:02:05,681 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 02:02:05,682 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 02:02:05,682 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 02:02:05,683 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 02:02:05,683 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 02:02:05,683 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-30 02:02:05,683 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-11-30 02:02:05,684 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-30 02:02:05,684 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-30 02:02:05,684 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 02:02:05,684 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-30 02:02:05,684 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_8fab8206-e2d6-4d00-9928-bf03667dcb7f/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_8fab8206-e2d6-4d00-9928-bf03667dcb7f/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 -> 42dcdc2e11851acf1d91dc1dde71231093bcb7e1 [2020-11-30 02:02:05,971 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 02:02:06,016 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 02:02:06,019 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 02:02:06,021 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 02:02:06,022 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 02:02:06,023 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8fab8206-e2d6-4d00-9928-bf03667dcb7f/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/thin002_rmo.opt.i [2020-11-30 02:02:06,111 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8fab8206-e2d6-4d00-9928-bf03667dcb7f/bin/utaipan/data/fe1aef02c/9d42596f73c14e769cc20ef0b6239d76/FLAGecf0a55fa [2020-11-30 02:02:06,715 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 02:02:06,716 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8fab8206-e2d6-4d00-9928-bf03667dcb7f/sv-benchmarks/c/pthread-wmm/thin002_rmo.opt.i [2020-11-30 02:02:06,737 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8fab8206-e2d6-4d00-9928-bf03667dcb7f/bin/utaipan/data/fe1aef02c/9d42596f73c14e769cc20ef0b6239d76/FLAGecf0a55fa [2020-11-30 02:02:06,998 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8fab8206-e2d6-4d00-9928-bf03667dcb7f/bin/utaipan/data/fe1aef02c/9d42596f73c14e769cc20ef0b6239d76 [2020-11-30 02:02:07,001 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 02:02:07,003 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 02:02:07,004 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 02:02:07,005 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 02:02:07,008 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 02:02:07,009 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 02:02:06" (1/1) ... [2020-11-30 02:02:07,011 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@375d049f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:02:07, skipping insertion in model container [2020-11-30 02:02:07,011 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 02:02:06" (1/1) ... [2020-11-30 02:02:07,019 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 02:02:07,066 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 02:02:07,536 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 02:02:07,556 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 02:02:07,663 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 02:02:07,778 INFO L208 MainTranslator]: Completed translation [2020-11-30 02:02:07,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:02:07 WrapperNode [2020-11-30 02:02:07,780 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 02:02:07,782 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 02:02:07,782 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 02:02:07,782 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 02:02:07,791 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:02:07" (1/1) ... [2020-11-30 02:02:07,830 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:02:07" (1/1) ... [2020-11-30 02:02:07,865 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 02:02:07,865 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 02:02:07,866 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 02:02:07,866 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 02:02:07,878 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:02:07" (1/1) ... [2020-11-30 02:02:07,879 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:02:07" (1/1) ... [2020-11-30 02:02:07,901 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:02:07" (1/1) ... [2020-11-30 02:02:07,902 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:02:07" (1/1) ... [2020-11-30 02:02:07,920 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:02:07" (1/1) ... [2020-11-30 02:02:07,925 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:02:07" (1/1) ... [2020-11-30 02:02:07,929 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:02:07" (1/1) ... [2020-11-30 02:02:07,935 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 02:02:07,936 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 02:02:07,936 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 02:02:07,936 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 02:02:07,950 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:02:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fab8206-e2d6-4d00-9928-bf03667dcb7f/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-11-30 02:02:08,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-30 02:02:08,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-30 02:02:08,021 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-30 02:02:08,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 02:02:08,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-30 02:02:08,021 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-30 02:02:08,021 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-30 02:02:08,022 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-30 02:02:08,022 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-30 02:02:08,022 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-30 02:02:08,022 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-30 02:02:08,022 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-11-30 02:02:08,022 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-11-30 02:02:08,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-30 02:02:08,022 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-30 02:02:08,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 02:02:08,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 02:02:08,024 WARN L208 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-30 02:02:10,606 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 02:02:10,607 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-11-30 02:02:10,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 02:02:10 BoogieIcfgContainer [2020-11-30 02:02:10,609 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 02:02:10,611 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 02:02:10,611 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 02:02:10,617 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 02:02:10,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 02:02:06" (1/3) ... [2020-11-30 02:02:10,618 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29007a53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 02:02:10, skipping insertion in model container [2020-11-30 02:02:10,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:02:07" (2/3) ... [2020-11-30 02:02:10,618 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29007a53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 02:02:10, skipping insertion in model container [2020-11-30 02:02:10,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 02:02:10" (3/3) ... [2020-11-30 02:02:10,620 INFO L111 eAbstractionObserver]: Analyzing ICFG thin002_rmo.opt.i [2020-11-30 02:02:10,631 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-30 02:02:10,631 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 02:02:10,636 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-30 02:02:10,637 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-30 02:02:10,699 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,700 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,700 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,700 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,701 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,701 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,701 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,701 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,701 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,701 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,702 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,702 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,703 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,703 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,703 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,703 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,704 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,704 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,704 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,705 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,705 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,706 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,706 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,706 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,706 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,706 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,710 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,710 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,710 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,736 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,736 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,737 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,737 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,737 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,737 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,738 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,738 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,738 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,738 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,738 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,738 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,739 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,739 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,739 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,739 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,739 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,740 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,741 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,741 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,741 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,741 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,741 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,742 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,742 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,742 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,742 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,743 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,743 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,745 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,745 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,746 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,746 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,748 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,748 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,748 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,749 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,749 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,749 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,749 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,749 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,749 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,750 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,750 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,752 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,752 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,752 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,753 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,753 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,753 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,753 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,753 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,754 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,754 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,754 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,754 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,754 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,754 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,755 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,755 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,755 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,755 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,755 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,755 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,756 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,756 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,756 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,756 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,756 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,756 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,756 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,757 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,757 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,757 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,757 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,759 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,759 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,759 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,760 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 02:02:10,763 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-30 02:02:10,775 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-11-30 02:02:10,795 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 02:02:10,796 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-30 02:02:10,796 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 02:02:10,796 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 02:02:10,796 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 02:02:10,796 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 02:02:10,796 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 02:02:10,796 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 02:02:10,811 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-30 02:02:10,813 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 137 transitions, 294 flow [2020-11-30 02:02:10,816 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 137 transitions, 294 flow [2020-11-30 02:02:10,818 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 147 places, 137 transitions, 294 flow [2020-11-30 02:02:10,882 INFO L129 PetriNetUnfolder]: 3/133 cut-off events. [2020-11-30 02:02:10,882 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-30 02:02:10,886 INFO L80 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 133 events. 3/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 80 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2020-11-30 02:02:10,891 INFO L116 LiptonReduction]: Number of co-enabled transitions 2406 [2020-11-30 02:02:11,051 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-11-30 02:02:11,052 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:02:11,104 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-11-30 02:02:11,105 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:02:11,274 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-11-30 02:02:11,274 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:02:11,276 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-11-30 02:02:11,276 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:02:11,377 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 02:02:11,378 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:02:11,379 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 02:02:11,380 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:02:11,384 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 02:02:11,385 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:02:11,386 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 02:02:11,387 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:02:11,388 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 02:02:11,388 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:02:11,390 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-11-30 02:02:11,390 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:02:11,392 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 02:02:11,392 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:02:11,393 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-11-30 02:02:11,394 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:02:11,395 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 02:02:11,396 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:02:11,396 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-11-30 02:02:11,397 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:02:11,403 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 02:02:11,407 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 02:02:11,413 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 2, 4, 2, 1] term [2020-11-30 02:02:11,415 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 02:02:11,470 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-11-30 02:02:11,471 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:02:11,472 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 02:02:11,472 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:02:11,479 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 02:02:11,479 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:02:11,480 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 02:02:11,481 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:02:11,481 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 02:02:11,482 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:02:11,483 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-11-30 02:02:11,483 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:02:11,485 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 02:02:11,485 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:02:11,487 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-11-30 02:02:11,487 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:02:11,492 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 02:02:11,493 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:02:11,493 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-11-30 02:02:11,494 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:02:11,497 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 02:02:11,497 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 02:02:11,500 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 2, 4, 2, 1] term [2020-11-30 02:02:11,501 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 02:02:13,009 WARN L193 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 238 DAG size of output: 198 [2020-11-30 02:02:13,048 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-11-30 02:02:13,049 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:02:13,680 WARN L193 SmtUtils]: Spent 616.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 111 [2020-11-30 02:02:13,821 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-11-30 02:02:13,822 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:02:13,851 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 3, 1] term [2020-11-30 02:02:13,851 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:02:13,852 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-11-30 02:02:13,853 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:02:13,931 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-11-30 02:02:13,932 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 02:02:13,932 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 2, 1] term [2020-11-30 02:02:13,933 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 02:02:13,934 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 6, 3, 3, 2, 1] term [2020-11-30 02:02:13,935 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:02:13,935 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-11-30 02:02:13,936 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:02:13,946 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 2, 2, 2, 1] term [2020-11-30 02:02:13,947 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:02:13,947 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-11-30 02:02:13,948 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:02:13,949 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-11-30 02:02:13,951 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:02:14,168 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-11-30 02:02:14,168 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:02:14,195 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-11-30 02:02:14,195 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:02:14,392 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-11-30 02:02:14,392 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:02:14,393 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-11-30 02:02:14,393 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:02:14,717 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:02:14,920 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:02:14,945 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 02:02:14,946 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:02:14,946 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-11-30 02:02:14,947 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:02:14,949 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 2, 1] term [2020-11-30 02:02:14,949 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 02:02:14,950 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-11-30 02:02:14,951 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 02:02:14,953 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 3, 2, 3, 2, 1] term [2020-11-30 02:02:14,953 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 02:02:14,959 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 1] term [2020-11-30 02:02:14,960 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 02:02:14,962 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 3, 2, 3, 2, 1] term [2020-11-30 02:02:14,963 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 02:02:14,965 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:02:15,009 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 2, 2, 1] term [2020-11-30 02:02:15,009 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 02:02:15,011 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 2, 1] term [2020-11-30 02:02:15,012 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 02:02:15,075 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 2, 2, 1] term [2020-11-30 02:02:15,079 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 02:02:15,081 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 2, 1] term [2020-11-30 02:02:15,084 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 02:02:15,112 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 02:02:15,113 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:02:15,113 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-11-30 02:02:15,113 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:02:15,117 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 2, 1] term [2020-11-30 02:02:15,118 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 02:02:15,119 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-11-30 02:02:15,119 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 02:02:15,123 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 1] term [2020-11-30 02:02:15,123 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 02:02:15,124 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 1] term [2020-11-30 02:02:15,124 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 02:02:15,126 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 1] term [2020-11-30 02:02:15,126 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 02:02:15,128 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:02:15,129 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:02:15,132 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:02:15,511 WARN L193 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 72 [2020-11-30 02:02:15,513 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-11-30 02:02:15,514 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:02:15,514 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-11-30 02:02:15,514 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:02:15,633 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-11-30 02:02:15,849 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:02:15,875 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:02:16,146 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:02:16,147 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:02:16,350 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:02:16,575 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:02:16,678 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:02:16,679 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:02:16,793 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:02:16,812 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 2, 1] term [2020-11-30 02:02:16,813 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 02:02:16,814 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-11-30 02:02:16,814 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 02:02:16,828 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 2, 1] term [2020-11-30 02:02:16,829 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:02:16,829 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-11-30 02:02:16,829 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 02:02:17,202 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2020-11-30 02:02:17,722 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-11-30 02:02:17,840 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-11-30 02:02:18,093 WARN L193 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2020-11-30 02:02:18,386 WARN L193 SmtUtils]: Spent 291.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-11-30 02:02:19,363 WARN L193 SmtUtils]: Spent 971.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 173 [2020-11-30 02:02:19,815 WARN L193 SmtUtils]: Spent 449.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2020-11-30 02:02:19,821 INFO L131 LiptonReduction]: Checked pairs total: 6587 [2020-11-30 02:02:19,821 INFO L133 LiptonReduction]: Total number of compositions: 119 [2020-11-30 02:02:19,834 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 43 places, 31 transitions, 82 flow [2020-11-30 02:02:20,017 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2090 states. [2020-11-30 02:02:20,019 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states. [2020-11-30 02:02:20,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-30 02:02:20,034 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:02:20,035 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:02:20,036 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:02:20,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:02:20,042 INFO L82 PathProgramCache]: Analyzing trace with hash 42727999, now seen corresponding path program 1 times [2020-11-30 02:02:20,053 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:02:20,055 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358107217] [2020-11-30 02:02:20,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:02:20,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:02:20,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:02:20,347 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358107217] [2020-11-30 02:02:20,348 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:02:20,348 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 02:02:20,348 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526892547] [2020-11-30 02:02:20,360 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-11-30 02:02:20,360 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:02:20,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-11-30 02:02:20,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-11-30 02:02:20,383 INFO L87 Difference]: Start difference. First operand 2090 states. Second operand 2 states. [2020-11-30 02:02:20,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:02:20,477 INFO L93 Difference]: Finished difference Result 2090 states and 7968 transitions. [2020-11-30 02:02:20,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-11-30 02:02:20,479 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-11-30 02:02:20,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:02:20,533 INFO L225 Difference]: With dead ends: 2090 [2020-11-30 02:02:20,534 INFO L226 Difference]: Without dead ends: 1770 [2020-11-30 02:02:20,536 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-11-30 02:02:20,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1770 states. [2020-11-30 02:02:20,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1770 to 1770. [2020-11-30 02:02:20,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1770 states. [2020-11-30 02:02:20,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1770 states to 1770 states and 6672 transitions. [2020-11-30 02:02:20,729 INFO L78 Accepts]: Start accepts. Automaton has 1770 states and 6672 transitions. Word has length 10 [2020-11-30 02:02:20,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:02:20,730 INFO L481 AbstractCegarLoop]: Abstraction has 1770 states and 6672 transitions. [2020-11-30 02:02:20,730 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-11-30 02:02:20,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1770 states and 6672 transitions. [2020-11-30 02:02:20,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-30 02:02:20,742 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:02:20,742 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:02:20,743 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-30 02:02:20,743 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:02:20,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:02:20,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1889269151, now seen corresponding path program 1 times [2020-11-30 02:02:20,747 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:02:20,747 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851039230] [2020-11-30 02:02:20,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:02:20,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:02:21,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:02:21,064 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851039230] [2020-11-30 02:02:21,064 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:02:21,065 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 02:02:21,065 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777610972] [2020-11-30 02:02:21,066 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 02:02:21,066 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:02:21,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 02:02:21,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 02:02:21,067 INFO L87 Difference]: Start difference. First operand 1770 states and 6672 transitions. Second operand 4 states. [2020-11-30 02:02:21,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:02:21,176 INFO L93 Difference]: Finished difference Result 1930 states and 7040 transitions. [2020-11-30 02:02:21,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 02:02:21,177 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-11-30 02:02:21,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:02:21,195 INFO L225 Difference]: With dead ends: 1930 [2020-11-30 02:02:21,195 INFO L226 Difference]: Without dead ends: 1610 [2020-11-30 02:02:21,196 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-11-30 02:02:21,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1610 states. [2020-11-30 02:02:21,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1610 to 1610. [2020-11-30 02:02:21,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1610 states. [2020-11-30 02:02:21,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 5984 transitions. [2020-11-30 02:02:21,276 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 5984 transitions. Word has length 12 [2020-11-30 02:02:21,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:02:21,276 INFO L481 AbstractCegarLoop]: Abstraction has 1610 states and 5984 transitions. [2020-11-30 02:02:21,276 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 02:02:21,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 5984 transitions. [2020-11-30 02:02:21,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-30 02:02:21,280 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:02:21,280 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:02:21,280 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-30 02:02:21,280 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:02:21,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:02:21,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1038641959, now seen corresponding path program 1 times [2020-11-30 02:02:21,292 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:02:21,292 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888445970] [2020-11-30 02:02:21,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:02:21,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:02:21,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:02:21,490 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888445970] [2020-11-30 02:02:21,490 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:02:21,490 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 02:02:21,490 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218850489] [2020-11-30 02:02:21,491 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 02:02:21,491 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:02:21,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 02:02:21,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 02:02:21,492 INFO L87 Difference]: Start difference. First operand 1610 states and 5984 transitions. Second operand 4 states. [2020-11-30 02:02:21,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:02:21,572 INFO L93 Difference]: Finished difference Result 1754 states and 6344 transitions. [2020-11-30 02:02:21,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 02:02:21,573 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-11-30 02:02:21,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:02:21,591 INFO L225 Difference]: With dead ends: 1754 [2020-11-30 02:02:21,591 INFO L226 Difference]: Without dead ends: 1514 [2020-11-30 02:02:21,591 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-11-30 02:02:21,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2020-11-30 02:02:21,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1514. [2020-11-30 02:02:21,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1514 states. [2020-11-30 02:02:21,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 5584 transitions. [2020-11-30 02:02:21,708 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 5584 transitions. Word has length 13 [2020-11-30 02:02:21,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:02:21,708 INFO L481 AbstractCegarLoop]: Abstraction has 1514 states and 5584 transitions. [2020-11-30 02:02:21,708 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 02:02:21,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 5584 transitions. [2020-11-30 02:02:21,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-30 02:02:21,711 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:02:21,712 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:02:21,712 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-30 02:02:21,712 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:02:21,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:02:21,713 INFO L82 PathProgramCache]: Analyzing trace with hash 2117572807, now seen corresponding path program 1 times [2020-11-30 02:02:21,713 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:02:21,714 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613539159] [2020-11-30 02:02:21,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:02:21,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:02:21,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:02:21,865 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613539159] [2020-11-30 02:02:21,865 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:02:21,865 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 02:02:21,865 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877020866] [2020-11-30 02:02:21,866 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 02:02:21,866 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:02:21,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 02:02:21,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 02:02:21,867 INFO L87 Difference]: Start difference. First operand 1514 states and 5584 transitions. Second operand 5 states. [2020-11-30 02:02:21,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:02:21,956 INFO L93 Difference]: Finished difference Result 1962 states and 7104 transitions. [2020-11-30 02:02:21,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 02:02:21,956 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-11-30 02:02:21,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:02:21,967 INFO L225 Difference]: With dead ends: 1962 [2020-11-30 02:02:21,967 INFO L226 Difference]: Without dead ends: 1002 [2020-11-30 02:02:21,968 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-11-30 02:02:21,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2020-11-30 02:02:22,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 1002. [2020-11-30 02:02:22,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1002 states. [2020-11-30 02:02:22,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 3440 transitions. [2020-11-30 02:02:22,012 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 3440 transitions. Word has length 14 [2020-11-30 02:02:22,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:02:22,012 INFO L481 AbstractCegarLoop]: Abstraction has 1002 states and 3440 transitions. [2020-11-30 02:02:22,013 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 02:02:22,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 3440 transitions. [2020-11-30 02:02:22,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-30 02:02:22,015 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:02:22,015 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:02:22,015 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-30 02:02:22,015 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:02:22,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:02:22,016 INFO L82 PathProgramCache]: Analyzing trace with hash -799349843, now seen corresponding path program 1 times [2020-11-30 02:02:22,016 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:02:22,016 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424183719] [2020-11-30 02:02:22,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:02:22,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:02:22,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:02:22,094 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424183719] [2020-11-30 02:02:22,094 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:02:22,094 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 02:02:22,094 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201362851] [2020-11-30 02:02:22,094 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 02:02:22,095 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:02:22,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 02:02:22,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 02:02:22,095 INFO L87 Difference]: Start difference. First operand 1002 states and 3440 transitions. Second operand 4 states. [2020-11-30 02:02:22,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:02:22,134 INFO L93 Difference]: Finished difference Result 1066 states and 3568 transitions. [2020-11-30 02:02:22,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 02:02:22,134 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-11-30 02:02:22,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:02:22,144 INFO L225 Difference]: With dead ends: 1066 [2020-11-30 02:02:22,144 INFO L226 Difference]: Without dead ends: 938 [2020-11-30 02:02:22,144 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-11-30 02:02:22,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2020-11-30 02:02:22,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 938. [2020-11-30 02:02:22,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 938 states. [2020-11-30 02:02:22,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 3184 transitions. [2020-11-30 02:02:22,211 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 3184 transitions. Word has length 15 [2020-11-30 02:02:22,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:02:22,211 INFO L481 AbstractCegarLoop]: Abstraction has 938 states and 3184 transitions. [2020-11-30 02:02:22,211 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 02:02:22,211 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 3184 transitions. [2020-11-30 02:02:22,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-30 02:02:22,214 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:02:22,214 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:02:22,214 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-30 02:02:22,214 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:02:22,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:02:22,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1155878876, now seen corresponding path program 1 times [2020-11-30 02:02:22,215 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:02:22,215 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449009559] [2020-11-30 02:02:22,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:02:22,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:02:22,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:02:22,331 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449009559] [2020-11-30 02:02:22,332 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:02:22,332 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 02:02:22,332 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883974382] [2020-11-30 02:02:22,332 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 02:02:22,332 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:02:22,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 02:02:22,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 02:02:22,333 INFO L87 Difference]: Start difference. First operand 938 states and 3184 transitions. Second operand 4 states. [2020-11-30 02:02:22,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:02:22,385 INFO L93 Difference]: Finished difference Result 986 states and 3276 transitions. [2020-11-30 02:02:22,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 02:02:22,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-11-30 02:02:22,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:02:22,394 INFO L225 Difference]: With dead ends: 986 [2020-11-30 02:02:22,395 INFO L226 Difference]: Without dead ends: 890 [2020-11-30 02:02:22,395 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-11-30 02:02:22,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2020-11-30 02:02:22,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 890. [2020-11-30 02:02:22,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2020-11-30 02:02:22,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 2996 transitions. [2020-11-30 02:02:22,430 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 2996 transitions. Word has length 16 [2020-11-30 02:02:22,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:02:22,431 INFO L481 AbstractCegarLoop]: Abstraction has 890 states and 2996 transitions. [2020-11-30 02:02:22,431 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 02:02:22,431 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 2996 transitions. [2020-11-30 02:02:22,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-30 02:02:22,433 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:02:22,433 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:02:22,434 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-30 02:02:22,434 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:02:22,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:02:22,434 INFO L82 PathProgramCache]: Analyzing trace with hash 2078444611, now seen corresponding path program 1 times [2020-11-30 02:02:22,435 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:02:22,435 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446584490] [2020-11-30 02:02:22,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:02:22,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:02:22,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:02:22,580 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446584490] [2020-11-30 02:02:22,580 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:02:22,581 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 02:02:22,581 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292404867] [2020-11-30 02:02:22,581 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 02:02:22,581 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:02:22,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 02:02:22,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 02:02:22,582 INFO L87 Difference]: Start difference. First operand 890 states and 2996 transitions. Second operand 5 states. [2020-11-30 02:02:22,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:02:22,674 INFO L93 Difference]: Finished difference Result 1190 states and 3898 transitions. [2020-11-30 02:02:22,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 02:02:22,675 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-11-30 02:02:22,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:02:22,681 INFO L225 Difference]: With dead ends: 1190 [2020-11-30 02:02:22,681 INFO L226 Difference]: Without dead ends: 566 [2020-11-30 02:02:22,682 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-11-30 02:02:22,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2020-11-30 02:02:22,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 566. [2020-11-30 02:02:22,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2020-11-30 02:02:22,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 1746 transitions. [2020-11-30 02:02:22,704 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 1746 transitions. Word has length 17 [2020-11-30 02:02:22,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:02:22,704 INFO L481 AbstractCegarLoop]: Abstraction has 566 states and 1746 transitions. [2020-11-30 02:02:22,704 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 02:02:22,704 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 1746 transitions. [2020-11-30 02:02:22,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-30 02:02:22,706 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:02:22,706 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:02:22,706 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-30 02:02:22,707 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:02:22,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:02:22,707 INFO L82 PathProgramCache]: Analyzing trace with hash -682184867, now seen corresponding path program 1 times [2020-11-30 02:02:22,707 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:02:22,708 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981241777] [2020-11-30 02:02:22,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:02:22,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:02:22,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:02:22,845 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981241777] [2020-11-30 02:02:22,845 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:02:22,845 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 02:02:22,846 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012303823] [2020-11-30 02:02:22,846 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 02:02:22,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:02:22,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 02:02:22,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-30 02:02:22,847 INFO L87 Difference]: Start difference. First operand 566 states and 1746 transitions. Second operand 6 states. [2020-11-30 02:02:22,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:02:22,928 INFO L93 Difference]: Finished difference Result 738 states and 2242 transitions. [2020-11-30 02:02:22,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 02:02:22,929 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-11-30 02:02:22,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:02:22,931 INFO L225 Difference]: With dead ends: 738 [2020-11-30 02:02:22,932 INFO L226 Difference]: Without dead ends: 300 [2020-11-30 02:02:22,932 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-11-30 02:02:22,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2020-11-30 02:02:22,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2020-11-30 02:02:22,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2020-11-30 02:02:22,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 840 transitions. [2020-11-30 02:02:22,944 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 840 transitions. Word has length 18 [2020-11-30 02:02:22,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:02:22,944 INFO L481 AbstractCegarLoop]: Abstraction has 300 states and 840 transitions. [2020-11-30 02:02:22,944 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 02:02:22,944 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 840 transitions. [2020-11-30 02:02:22,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-30 02:02:22,945 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:02:22,945 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:02:22,946 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-30 02:02:22,946 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:02:22,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:02:22,946 INFO L82 PathProgramCache]: Analyzing trace with hash 270097967, now seen corresponding path program 1 times [2020-11-30 02:02:22,947 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:02:22,949 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504646906] [2020-11-30 02:02:22,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:02:23,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:02:23,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:02:23,620 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504646906] [2020-11-30 02:02:23,620 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:02:23,620 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-30 02:02:23,620 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062142863] [2020-11-30 02:02:23,621 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-30 02:02:23,621 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:02:23,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-30 02:02:23,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-11-30 02:02:23,622 INFO L87 Difference]: Start difference. First operand 300 states and 840 transitions. Second operand 9 states. [2020-11-30 02:02:24,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:02:24,106 INFO L93 Difference]: Finished difference Result 395 states and 1047 transitions. [2020-11-30 02:02:24,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 02:02:24,107 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2020-11-30 02:02:24,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:02:24,110 INFO L225 Difference]: With dead ends: 395 [2020-11-30 02:02:24,111 INFO L226 Difference]: Without dead ends: 363 [2020-11-30 02:02:24,111 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-11-30 02:02:24,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2020-11-30 02:02:24,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2020-11-30 02:02:24,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2020-11-30 02:02:24,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 967 transitions. [2020-11-30 02:02:24,127 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 967 transitions. Word has length 19 [2020-11-30 02:02:24,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:02:24,129 INFO L481 AbstractCegarLoop]: Abstraction has 363 states and 967 transitions. [2020-11-30 02:02:24,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-30 02:02:24,129 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 967 transitions. [2020-11-30 02:02:24,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-30 02:02:24,130 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:02:24,130 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:02:24,131 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-30 02:02:24,131 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:02:24,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:02:24,131 INFO L82 PathProgramCache]: Analyzing trace with hash -291559809, now seen corresponding path program 1 times [2020-11-30 02:02:24,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:02:24,132 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449918165] [2020-11-30 02:02:24,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:02:24,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:02:24,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:02:24,234 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449918165] [2020-11-30 02:02:24,235 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:02:24,235 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 02:02:24,235 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182375147] [2020-11-30 02:02:24,235 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 02:02:24,235 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:02:24,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 02:02:24,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 02:02:24,236 INFO L87 Difference]: Start difference. First operand 363 states and 967 transitions. Second operand 4 states. [2020-11-30 02:02:24,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:02:24,295 INFO L93 Difference]: Finished difference Result 393 states and 997 transitions. [2020-11-30 02:02:24,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 02:02:24,296 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-11-30 02:02:24,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:02:24,298 INFO L225 Difference]: With dead ends: 393 [2020-11-30 02:02:24,299 INFO L226 Difference]: Without dead ends: 339 [2020-11-30 02:02:24,299 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-11-30 02:02:24,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2020-11-30 02:02:24,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2020-11-30 02:02:24,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2020-11-30 02:02:24,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 871 transitions. [2020-11-30 02:02:24,312 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 871 transitions. Word has length 20 [2020-11-30 02:02:24,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:02:24,314 INFO L481 AbstractCegarLoop]: Abstraction has 339 states and 871 transitions. [2020-11-30 02:02:24,314 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 02:02:24,314 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 871 transitions. [2020-11-30 02:02:24,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-30 02:02:24,315 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:02:24,315 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:02:24,316 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-30 02:02:24,316 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:02:24,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:02:24,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1780362443, now seen corresponding path program 1 times [2020-11-30 02:02:24,316 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:02:24,317 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160893854] [2020-11-30 02:02:24,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:02:24,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:02:24,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:02:24,604 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160893854] [2020-11-30 02:02:24,605 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:02:24,605 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-30 02:02:24,605 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021276652] [2020-11-30 02:02:24,606 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-30 02:02:24,606 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:02:24,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-30 02:02:24,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-11-30 02:02:24,608 INFO L87 Difference]: Start difference. First operand 339 states and 871 transitions. Second operand 8 states. [2020-11-30 02:02:24,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:02:24,831 INFO L93 Difference]: Finished difference Result 347 states and 879 transitions. [2020-11-30 02:02:24,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 02:02:24,832 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2020-11-30 02:02:24,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:02:24,835 INFO L225 Difference]: With dead ends: 347 [2020-11-30 02:02:24,836 INFO L226 Difference]: Without dead ends: 331 [2020-11-30 02:02:24,836 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2020-11-30 02:02:24,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2020-11-30 02:02:24,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 260. [2020-11-30 02:02:24,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2020-11-30 02:02:24,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 688 transitions. [2020-11-30 02:02:24,849 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 688 transitions. Word has length 20 [2020-11-30 02:02:24,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:02:24,849 INFO L481 AbstractCegarLoop]: Abstraction has 260 states and 688 transitions. [2020-11-30 02:02:24,849 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-30 02:02:24,849 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 688 transitions. [2020-11-30 02:02:24,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-30 02:02:24,851 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:02:24,851 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:02:24,851 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-30 02:02:24,851 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:02:24,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:02:24,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1148160805, now seen corresponding path program 1 times [2020-11-30 02:02:24,852 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:02:24,853 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398733718] [2020-11-30 02:02:24,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:02:24,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:02:24,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:02:24,957 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398733718] [2020-11-30 02:02:24,957 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:02:24,958 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 02:02:24,958 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364221411] [2020-11-30 02:02:24,958 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 02:02:24,958 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:02:24,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 02:02:24,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-30 02:02:24,959 INFO L87 Difference]: Start difference. First operand 260 states and 688 transitions. Second operand 5 states. [2020-11-30 02:02:25,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:02:25,034 INFO L93 Difference]: Finished difference Result 252 states and 603 transitions. [2020-11-30 02:02:25,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 02:02:25,035 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-11-30 02:02:25,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:02:25,038 INFO L225 Difference]: With dead ends: 252 [2020-11-30 02:02:25,038 INFO L226 Difference]: Without dead ends: 208 [2020-11-30 02:02:25,038 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-11-30 02:02:25,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2020-11-30 02:02:25,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2020-11-30 02:02:25,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2020-11-30 02:02:25,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 496 transitions. [2020-11-30 02:02:25,048 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 496 transitions. Word has length 21 [2020-11-30 02:02:25,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:02:25,048 INFO L481 AbstractCegarLoop]: Abstraction has 208 states and 496 transitions. [2020-11-30 02:02:25,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 02:02:25,048 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 496 transitions. [2020-11-30 02:02:25,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-30 02:02:25,050 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:02:25,050 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:02:25,050 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-30 02:02:25,050 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:02:25,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:02:25,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1656214851, now seen corresponding path program 1 times [2020-11-30 02:02:25,051 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:02:25,051 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690851101] [2020-11-30 02:02:25,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:02:25,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:02:25,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:02:25,173 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690851101] [2020-11-30 02:02:25,173 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:02:25,173 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 02:02:25,173 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503782772] [2020-11-30 02:02:25,174 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 02:02:25,174 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:02:25,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 02:02:25,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-30 02:02:25,174 INFO L87 Difference]: Start difference. First operand 208 states and 496 transitions. Second operand 6 states. [2020-11-30 02:02:25,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:02:25,255 INFO L93 Difference]: Finished difference Result 181 states and 400 transitions. [2020-11-30 02:02:25,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 02:02:25,256 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-11-30 02:02:25,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:02:25,257 INFO L225 Difference]: With dead ends: 181 [2020-11-30 02:02:25,257 INFO L226 Difference]: Without dead ends: 156 [2020-11-30 02:02:25,257 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-11-30 02:02:25,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2020-11-30 02:02:25,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2020-11-30 02:02:25,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2020-11-30 02:02:25,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 344 transitions. [2020-11-30 02:02:25,263 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 344 transitions. Word has length 22 [2020-11-30 02:02:25,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:02:25,264 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 344 transitions. [2020-11-30 02:02:25,264 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 02:02:25,264 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 344 transitions. [2020-11-30 02:02:25,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-30 02:02:25,265 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:02:25,265 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:02:25,265 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-30 02:02:25,265 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:02:25,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:02:25,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1879004343, now seen corresponding path program 1 times [2020-11-30 02:02:25,266 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:02:25,266 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858071249] [2020-11-30 02:02:25,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:02:25,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:02:25,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:02:25,371 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858071249] [2020-11-30 02:02:25,372 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:02:25,372 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-30 02:02:25,372 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293913606] [2020-11-30 02:02:25,372 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 02:02:25,372 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:02:25,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 02:02:25,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-30 02:02:25,373 INFO L87 Difference]: Start difference. First operand 156 states and 344 transitions. Second operand 7 states. [2020-11-30 02:02:25,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:02:25,484 INFO L93 Difference]: Finished difference Result 140 states and 310 transitions. [2020-11-30 02:02:25,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 02:02:25,484 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-11-30 02:02:25,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:02:25,486 INFO L225 Difference]: With dead ends: 140 [2020-11-30 02:02:25,486 INFO L226 Difference]: Without dead ends: 132 [2020-11-30 02:02:25,486 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-11-30 02:02:25,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-11-30 02:02:25,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2020-11-30 02:02:25,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-11-30 02:02:25,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 296 transitions. [2020-11-30 02:02:25,491 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 296 transitions. Word has length 23 [2020-11-30 02:02:25,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:02:25,492 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 296 transitions. [2020-11-30 02:02:25,492 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 02:02:25,492 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 296 transitions. [2020-11-30 02:02:25,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-30 02:02:25,493 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:02:25,493 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:02:25,493 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-30 02:02:25,493 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:02:25,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:02:25,494 INFO L82 PathProgramCache]: Analyzing trace with hash 186154952, now seen corresponding path program 1 times [2020-11-30 02:02:25,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:02:25,494 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165610071] [2020-11-30 02:02:25,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:02:25,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 02:02:25,544 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 02:02:25,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 02:02:25,591 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 02:02:25,636 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-11-30 02:02:25,636 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-30 02:02:25,637 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-30 02:02:25,673 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 02:02:25,674 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 02:02:25,674 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 02:02:25,674 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 02:02:25,674 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 02:02:25,674 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 02:02:25,675 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 02:02:25,675 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 02:02:25,675 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 02:02:25,675 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 02:02:25,675 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 02:02:25,675 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 02:02:25,676 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 02:02:25,676 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 02:02:25,676 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 02:02:25,676 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 02:02:25,676 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 02:02:25,676 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 02:02:25,677 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 02:02:25,677 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 02:02:25,680 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 02:02:25,680 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 02:02:25,681 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 02:02:25,681 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 02:02:25,681 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 02:02:25,681 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 02:02:25,681 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 02:02:25,681 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 02:02:25,682 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 02:02:25,682 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 02:02:25,683 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 02:02:25,683 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 02:02:25,683 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 02:02:25,683 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 02:02:25,683 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 02:02:25,683 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 02:02:25,684 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 02:02:25,684 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 02:02:25,684 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 02:02:25,684 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 02:02:25,685 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 02:02:25,685 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 02:02:25,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 02:02:25 BasicIcfg [2020-11-30 02:02:25,817 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-30 02:02:25,818 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 02:02:25,818 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 02:02:25,818 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 02:02:25,819 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 02:02:10" (3/4) ... [2020-11-30 02:02:25,822 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-30 02:02:25,845 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 02:02:25,845 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 02:02:25,845 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 02:02:25,845 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 02:02:25,845 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 02:02:25,845 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 02:02:25,845 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 02:02:25,846 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 02:02:25,846 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 02:02:25,846 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 02:02:25,846 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 02:02:25,846 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 02:02:25,846 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 02:02:25,846 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 02:02:25,846 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 02:02:25,847 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 02:02:25,847 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 02:02:25,847 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 02:02:25,847 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 02:02:25,847 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 02:02:25,848 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 02:02:25,848 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 02:02:25,849 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 02:02:25,849 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 02:02:25,849 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 02:02:25,849 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 02:02:25,849 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 02:02:25,849 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 02:02:25,849 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 02:02:25,849 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 02:02:25,850 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 02:02:25,850 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 02:02:25,850 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 02:02:25,850 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 02:02:25,850 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 02:02:25,850 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 02:02:25,851 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 02:02:25,851 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 02:02:25,851 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 02:02:25,851 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 02:02:25,851 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-30 02:02:25,851 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 02:02:25,999 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_8fab8206-e2d6-4d00-9928-bf03667dcb7f/bin/utaipan/witness.graphml [2020-11-30 02:02:25,999 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 02:02:26,001 INFO L168 Benchmark]: Toolchain (without parser) took 18997.61 ms. Allocated memory was 83.9 MB in the beginning and 310.4 MB in the end (delta: 226.5 MB). Free memory was 52.2 MB in the beginning and 101.3 MB in the end (delta: -49.1 MB). Peak memory consumption was 177.7 MB. Max. memory is 16.1 GB. [2020-11-30 02:02:26,001 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 83.9 MB. Free memory was 55.8 MB in the beginning and 55.8 MB in the end (delta: 29.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 02:02:26,002 INFO L168 Benchmark]: CACSL2BoogieTranslator took 775.81 ms. Allocated memory was 83.9 MB in the beginning and 104.9 MB in the end (delta: 21.0 MB). Free memory was 51.9 MB in the beginning and 57.8 MB in the end (delta: -6.0 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2020-11-30 02:02:26,002 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.08 ms. Allocated memory is still 104.9 MB. Free memory was 57.3 MB in the beginning and 55.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 02:02:26,003 INFO L168 Benchmark]: Boogie Preprocessor took 69.33 ms. Allocated memory is still 104.9 MB. Free memory was 55.2 MB in the beginning and 53.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 02:02:26,003 INFO L168 Benchmark]: RCFGBuilder took 2673.91 ms. Allocated memory was 104.9 MB in the beginning and 134.2 MB in the end (delta: 29.4 MB). Free memory was 53.1 MB in the beginning and 56.4 MB in the end (delta: -3.3 MB). Peak memory consumption was 28.7 MB. Max. memory is 16.1 GB. [2020-11-30 02:02:26,004 INFO L168 Benchmark]: TraceAbstraction took 15206.42 ms. Allocated memory was 134.2 MB in the beginning and 310.4 MB in the end (delta: 176.2 MB). Free memory was 55.3 MB in the beginning and 130.7 MB in the end (delta: -75.3 MB). Peak memory consumption was 100.8 MB. Max. memory is 16.1 GB. [2020-11-30 02:02:26,004 INFO L168 Benchmark]: Witness Printer took 181.41 ms. Allocated memory is still 310.4 MB. Free memory was 130.7 MB in the beginning and 101.3 MB in the end (delta: 29.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.1 GB. [2020-11-30 02:02:26,007 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.25 ms. Allocated memory is still 83.9 MB. Free memory was 55.8 MB in the beginning and 55.8 MB in the end (delta: 29.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 775.81 ms. Allocated memory was 83.9 MB in the beginning and 104.9 MB in the end (delta: 21.0 MB). Free memory was 51.9 MB in the beginning and 57.8 MB in the end (delta: -6.0 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 83.08 ms. Allocated memory is still 104.9 MB. Free memory was 57.3 MB in the beginning and 55.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 69.33 ms. Allocated memory is still 104.9 MB. Free memory was 55.2 MB in the beginning and 53.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2673.91 ms. Allocated memory was 104.9 MB in the beginning and 134.2 MB in the end (delta: 29.4 MB). Free memory was 53.1 MB in the beginning and 56.4 MB in the end (delta: -3.3 MB). Peak memory consumption was 28.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 15206.42 ms. Allocated memory was 134.2 MB in the beginning and 310.4 MB in the end (delta: 176.2 MB). Free memory was 55.3 MB in the beginning and 130.7 MB in the end (delta: -75.3 MB). Peak memory consumption was 100.8 MB. Max. memory is 16.1 GB. * Witness Printer took 181.41 ms. Allocated memory is still 310.4 MB. Free memory was 130.7 MB in the beginning and 101.3 MB in the end (delta: 29.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1719 VarBasedMoverChecksPositive, 72 VarBasedMoverChecksNegative, 20 SemBasedMoverChecksPositive, 52 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 184 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 9.0s, 147 PlacesBefore, 43 PlacesAfterwards, 137 TransitionsBefore, 31 TransitionsAfterwards, 2406 CoEnabledTransitionPairs, 8 FixpointIterations, 61 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 119 TotalNumberOfCompositions, 6587 MoverChecksTotal - CounterExampleResult [Line: 18]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L733] 0 int __unbuffered_p1_EAX = 0; [L735] 0 int __unbuffered_p2_EAX = 0; [L737] 0 int __unbuffered_p3_EAX = 0; [L739] 0 int a = 0; [L740] 0 _Bool a$flush_delayed; [L741] 0 int a$mem_tmp; [L742] 0 _Bool a$r_buff0_thd0; [L743] 0 _Bool a$r_buff0_thd1; [L744] 0 _Bool a$r_buff0_thd2; [L745] 0 _Bool a$r_buff0_thd3; [L746] 0 _Bool a$r_buff0_thd4; [L747] 0 _Bool a$r_buff1_thd0; [L748] 0 _Bool a$r_buff1_thd1; [L749] 0 _Bool a$r_buff1_thd2; [L750] 0 _Bool a$r_buff1_thd3; [L751] 0 _Bool a$r_buff1_thd4; [L752] 0 _Bool a$read_delayed; [L753] 0 int *a$read_delayed_var; [L754] 0 int a$w_buff0; [L755] 0 _Bool a$w_buff0_used; [L756] 0 int a$w_buff1; [L757] 0 _Bool a$w_buff1_used; [L758] 0 _Bool main$tmp_guard0; [L759] 0 _Bool main$tmp_guard1; [L761] 0 int x = 0; [L763] 0 int y = 0; [L765] 0 int z = 0; [L766] 0 _Bool weak$$choice0; [L767] 0 _Bool weak$$choice1; [L768] 0 _Bool weak$$choice2; [L860] 0 pthread_t t2725; [L861] FCALL, FORK 0 pthread_create(&t2725, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={7:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z=0] [L862] 0 pthread_t t2726; [L772] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 1 a$flush_delayed = weak$$choice2 [L775] EXPR 1 \read(a) [L775] 1 a$mem_tmp = a [L776] EXPR 1 !a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff1) [L776] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff1 [L776] EXPR 1 !a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff1) [L776] 1 a = !a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff1) [L777] EXPR 1 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff0)) [L777] 1 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff0)) [L778] EXPR 1 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff1 : a$w_buff1)) [L778] 1 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff1 : a$w_buff1)) [L779] EXPR 1 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used)) [L779] 1 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used)) [L780] EXPR 1 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L780] 1 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L781] EXPR 1 weak$$choice2 ? a$r_buff0_thd1 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$r_buff0_thd1 : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1)) [L781] EXPR 1 !a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$r_buff0_thd1 : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1) [L781] EXPR 1 weak$$choice2 ? a$r_buff0_thd1 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$r_buff0_thd1 : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1)) [L781] 1 a$r_buff0_thd1 = weak$$choice2 ? a$r_buff0_thd1 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$r_buff0_thd1 : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1)) [L782] EXPR 1 weak$$choice2 ? a$r_buff1_thd1 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$r_buff1_thd1 : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L782] 1 a$r_buff1_thd1 = weak$$choice2 ? a$r_buff1_thd1 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$r_buff1_thd1 : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L783] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L784] 1 __unbuffered_p0_EAX$read_delayed_var = &a [L785] EXPR 1 \read(a) [L785] 1 __unbuffered_p0_EAX = a [L786] EXPR 1 a$flush_delayed ? a$mem_tmp : a [L786] EXPR 1 \read(a) [L786] EXPR 1 a$flush_delayed ? a$mem_tmp : a [L786] 1 a = a$flush_delayed ? a$mem_tmp : a [L787] 1 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={7:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z=0] [L863] FCALL, FORK 0 pthread_create(&t2726, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={7:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z=0] [L790] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={7:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=0, x=1, y=0, z=0] [L802] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={7:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=0, x=1, y=0, z=0] [L805] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={7:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z=0] [L810] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 2 return 0; [L795] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 1 return 0; [L864] 0 pthread_t t2727; [L865] FCALL, FORK 0 pthread_create(&t2727, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={7:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z=0] [L817] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=0, a={7:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z=0] [L866] 0 pthread_t t2728; [L867] FCALL, FORK 0 pthread_create(&t2728, ((void *)0), P3, ((void *)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=0, a={7:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z=0] [L820] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=0, a={7:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z=1] [L825] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L827] 3 return 0; [L832] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a={7:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z=1] [L835] 4 a = 1 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a={7:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z=1] [L838] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L838] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L839] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L839] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L840] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L840] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L841] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L841] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L842] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L842] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L845] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L847] 4 return 0; [L869] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L4] COND FALSE 0 !(!cond) [L873] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L873] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L874] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L874] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L875] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L875] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L876] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L876] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L877] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L877] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L880] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L881] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L881] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p3_EAX == 1) [L19] COND TRUE 0 !expression [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "thin002_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a={7:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=255, weak$$choice2=0, x=1, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 135 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 14.8s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.2s, HoareTripleCheckerStatistics: 409 SDtfs, 523 SDslu, 807 SDs, 0 SdLazy, 405 SolverSat, 90 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2090occurred 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.6s AutomataMinimizationTime, 14 MinimizatonAttempts, 71 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 265 NumberOfCodeBlocks, 265 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 226 ConstructedInterpolants, 0 QuantifiedInterpolants, 32092 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...