./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix055_pso.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_4bad10db-1854-4c2f-b88a-dd3c8f02e234/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_4bad10db-1854-4c2f-b88a-dd3c8f02e234/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4bad10db-1854-4c2f-b88a-dd3c8f02e234/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4bad10db-1854-4c2f-b88a-dd3c8f02e234/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix055_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_4bad10db-1854-4c2f-b88a-dd3c8f02e234/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4bad10db-1854-4c2f-b88a-dd3c8f02e234/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 5122a8d22cb1f4fb0c3acef9abe3b4cd7e56d6bb ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-28 07:25:11,756 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-28 07:25:11,783 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-28 07:25:11,836 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-28 07:25:11,837 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-28 07:25:11,842 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-28 07:25:11,844 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-28 07:25:11,846 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-28 07:25:11,849 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-28 07:25:11,857 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-28 07:25:11,858 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-28 07:25:11,861 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-28 07:25:11,862 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-28 07:25:11,865 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-28 07:25:11,867 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-28 07:25:11,869 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-28 07:25:11,870 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-28 07:25:11,871 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-28 07:25:11,878 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-28 07:25:11,884 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-28 07:25:11,890 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-28 07:25:11,892 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-28 07:25:11,893 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-28 07:25:11,895 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-28 07:25:11,898 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-28 07:25:11,899 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-28 07:25:11,900 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-28 07:25:11,902 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-28 07:25:11,902 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-28 07:25:11,904 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-28 07:25:11,904 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-28 07:25:11,905 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-28 07:25:11,907 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-28 07:25:11,908 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-28 07:25:11,909 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-28 07:25:11,910 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-28 07:25:11,911 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-28 07:25:11,911 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-28 07:25:11,911 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-28 07:25:11,912 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-28 07:25:11,912 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-28 07:25:11,915 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4bad10db-1854-4c2f-b88a-dd3c8f02e234/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-11-28 07:25:11,957 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-28 07:25:11,957 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-28 07:25:11,958 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-11-28 07:25:11,958 INFO L138 SettingsManager]: * User list type=DISABLED [2020-11-28 07:25:11,959 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-11-28 07:25:11,959 INFO L138 SettingsManager]: * Explicit value domain=true [2020-11-28 07:25:11,959 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-11-28 07:25:11,959 INFO L138 SettingsManager]: * Octagon Domain=false [2020-11-28 07:25:11,959 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-11-28 07:25:11,960 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-11-28 07:25:11,960 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-11-28 07:25:11,960 INFO L138 SettingsManager]: * Interval Domain=false [2020-11-28 07:25:11,960 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-11-28 07:25:11,961 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-11-28 07:25:11,961 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-11-28 07:25:11,962 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-28 07:25:11,962 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-28 07:25:11,962 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-28 07:25:11,962 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-28 07:25:11,962 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-28 07:25:11,963 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-28 07:25:11,963 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-28 07:25:11,963 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-28 07:25:11,963 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-28 07:25:11,963 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-28 07:25:11,964 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-28 07:25:11,964 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-28 07:25:11,964 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-28 07:25:11,964 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-28 07:25:11,965 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-28 07:25:11,965 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-28 07:25:11,965 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-28 07:25:11,965 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-28 07:25:11,966 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-28 07:25:11,966 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-28 07:25:11,966 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-11-28 07:25:11,966 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-28 07:25:11,967 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-28 07:25:11,967 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-28 07:25:11,967 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-28 07:25:11,967 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_4bad10db-1854-4c2f-b88a-dd3c8f02e234/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_4bad10db-1854-4c2f-b88a-dd3c8f02e234/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 -> 5122a8d22cb1f4fb0c3acef9abe3b4cd7e56d6bb [2020-11-28 07:25:12,239 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-28 07:25:12,280 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-28 07:25:12,283 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-28 07:25:12,287 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-28 07:25:12,288 INFO L275 PluginConnector]: CDTParser initialized [2020-11-28 07:25:12,289 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4bad10db-1854-4c2f-b88a-dd3c8f02e234/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix055_pso.opt.i [2020-11-28 07:25:12,370 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4bad10db-1854-4c2f-b88a-dd3c8f02e234/bin/utaipan/data/2910f2141/da4798ca26634e45b0538b69d610b080/FLAG62d195b14 [2020-11-28 07:25:12,829 INFO L306 CDTParser]: Found 1 translation units. [2020-11-28 07:25:12,829 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4bad10db-1854-4c2f-b88a-dd3c8f02e234/sv-benchmarks/c/pthread-wmm/mix055_pso.opt.i [2020-11-28 07:25:12,847 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4bad10db-1854-4c2f-b88a-dd3c8f02e234/bin/utaipan/data/2910f2141/da4798ca26634e45b0538b69d610b080/FLAG62d195b14 [2020-11-28 07:25:12,861 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4bad10db-1854-4c2f-b88a-dd3c8f02e234/bin/utaipan/data/2910f2141/da4798ca26634e45b0538b69d610b080 [2020-11-28 07:25:12,863 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-28 07:25:12,865 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-28 07:25:12,866 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-28 07:25:12,867 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-28 07:25:12,879 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-28 07:25:12,880 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 07:25:12" (1/1) ... [2020-11-28 07:25:12,882 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42f96046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:25:12, skipping insertion in model container [2020-11-28 07:25:12,883 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 07:25:12" (1/1) ... [2020-11-28 07:25:12,890 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-28 07:25:12,936 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-28 07:25:13,413 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 07:25:13,434 INFO L203 MainTranslator]: Completed pre-run [2020-11-28 07:25:13,528 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 07:25:13,618 INFO L208 MainTranslator]: Completed translation [2020-11-28 07:25:13,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:25:13 WrapperNode [2020-11-28 07:25:13,619 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-28 07:25:13,620 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-28 07:25:13,620 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-28 07:25:13,621 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-28 07:25:13,629 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:25:13" (1/1) ... [2020-11-28 07:25:13,647 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:25:13" (1/1) ... [2020-11-28 07:25:13,682 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-28 07:25:13,683 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-28 07:25:13,683 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-28 07:25:13,684 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-28 07:25:13,693 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:25:13" (1/1) ... [2020-11-28 07:25:13,694 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:25:13" (1/1) ... [2020-11-28 07:25:13,701 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:25:13" (1/1) ... [2020-11-28 07:25:13,701 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:25:13" (1/1) ... [2020-11-28 07:25:13,716 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:25:13" (1/1) ... [2020-11-28 07:25:13,721 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:25:13" (1/1) ... [2020-11-28 07:25:13,726 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:25:13" (1/1) ... [2020-11-28 07:25:13,731 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-28 07:25:13,732 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-28 07:25:13,732 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-28 07:25:13,732 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-28 07:25:13,733 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:25:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4bad10db-1854-4c2f-b88a-dd3c8f02e234/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-28 07:25:13,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-28 07:25:13,847 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-28 07:25:13,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-28 07:25:13,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-28 07:25:13,848 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-28 07:25:13,848 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-28 07:25:13,849 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-28 07:25:13,849 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-28 07:25:13,849 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-28 07:25:13,849 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-28 07:25:13,849 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-11-28 07:25:13,850 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-11-28 07:25:13,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-28 07:25:13,850 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-28 07:25:13,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-28 07:25:13,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-28 07:25:13,852 WARN L208 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-28 07:25:16,057 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-28 07:25:16,057 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-28 07:25:16,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 07:25:16 BoogieIcfgContainer [2020-11-28 07:25:16,059 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-28 07:25:16,061 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-28 07:25:16,061 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-28 07:25:16,064 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-28 07:25:16,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 07:25:12" (1/3) ... [2020-11-28 07:25:16,065 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cff56d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 07:25:16, skipping insertion in model container [2020-11-28 07:25:16,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:25:13" (2/3) ... [2020-11-28 07:25:16,066 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cff56d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 07:25:16, skipping insertion in model container [2020-11-28 07:25:16,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 07:25:16" (3/3) ... [2020-11-28 07:25:16,067 INFO L111 eAbstractionObserver]: Analyzing ICFG mix055_pso.opt.i [2020-11-28 07:25:16,078 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-28 07:25:16,078 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-28 07:25:16,084 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-28 07:25:16,085 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-28 07:25:16,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,130 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,130 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,131 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,131 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,131 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,131 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,132 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,132 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,132 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,132 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,133 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,134 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,134 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,134 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,135 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,135 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,135 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,135 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,136 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,136 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,137 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,138 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,138 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,139 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,139 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,139 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,140 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,140 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,140 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,141 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,141 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,141 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,141 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,141 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,142 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,142 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,142 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,142 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,142 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,143 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,143 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,143 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,143 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,143 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,144 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,144 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,146 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,146 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,147 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,147 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,147 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,148 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,148 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,148 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,148 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,148 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,149 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,149 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,149 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,149 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,154 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,154 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,154 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,154 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,156 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,156 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,157 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,157 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,159 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,159 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,159 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,159 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,159 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,159 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,160 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,160 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,160 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,160 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:25:16,162 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-28 07:25:16,174 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-11-28 07:25:16,205 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-28 07:25:16,205 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-28 07:25:16,206 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-28 07:25:16,206 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-28 07:25:16,206 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-28 07:25:16,207 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-28 07:25:16,207 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-28 07:25:16,207 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-28 07:25:16,223 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-28 07:25:16,225 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 117 transitions, 254 flow [2020-11-28 07:25:16,233 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 117 transitions, 254 flow [2020-11-28 07:25:16,235 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 127 places, 117 transitions, 254 flow [2020-11-28 07:25:16,305 INFO L129 PetriNetUnfolder]: 3/113 cut-off events. [2020-11-28 07:25:16,306 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-28 07:25:16,312 INFO L80 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 113 events. 3/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 87 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2020-11-28 07:25:16,318 INFO L116 LiptonReduction]: Number of co-enabled transitions 2622 [2020-11-28 07:25:16,611 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-28 07:25:16,611 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:25:16,717 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-28 07:25:16,717 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:25:16,974 WARN L193 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2020-11-28 07:25:17,130 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-28 07:25:17,131 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:25:17,132 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-28 07:25:17,133 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:25:17,150 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-28 07:25:17,150 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:25:17,152 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-28 07:25:17,152 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:25:18,270 WARN L193 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-11-28 07:25:18,306 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-11-28 07:25:18,306 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:25:18,307 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-28 07:25:18,307 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:25:19,537 WARN L193 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 145 DAG size of output: 124 [2020-11-28 07:25:19,603 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-28 07:25:19,604 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:25:20,317 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:25:20,318 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:25:20,319 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:25:20,319 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:25:20,322 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:25:20,323 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:25:20,325 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:25:20,326 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:25:20,371 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:25:20,371 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:25:20,372 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:25:20,372 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:25:20,375 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:25:20,375 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:25:20,377 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:25:20,378 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:25:20,819 WARN L193 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-11-28 07:25:20,953 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:25:20,954 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:25:20,954 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:25:20,955 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:25:20,956 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:25:20,956 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:25:20,958 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:25:20,958 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:25:21,005 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:25:21,006 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:25:21,006 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:25:21,007 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:25:21,009 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:25:21,009 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:25:21,011 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:25:21,012 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:25:21,134 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-28 07:25:21,134 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:25:21,654 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-28 07:25:22,863 WARN L193 SmtUtils]: Spent 569.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 109 [2020-11-28 07:25:23,170 WARN L193 SmtUtils]: Spent 303.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-11-28 07:25:23,867 WARN L193 SmtUtils]: Spent 696.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 109 [2020-11-28 07:25:24,167 WARN L193 SmtUtils]: Spent 297.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-11-28 07:25:24,403 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 7, 2, 2, 1] term [2020-11-28 07:25:24,403 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:25:24,404 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 3, 2, 1] term [2020-11-28 07:25:24,404 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:25:24,405 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:25:24,405 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:25:24,406 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:25:24,406 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:25:24,408 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 7, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:25:24,409 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:25:24,411 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:25:24,411 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:25:24,419 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 7, 3, 7, 3, 2, 1] term [2020-11-28 07:25:24,420 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:25:24,421 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 7, 3, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:25:24,422 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:25:24,423 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 7, 3, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:25:24,424 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:25:24,451 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 7, 3, 7, 3, 2, 1] term [2020-11-28 07:25:24,451 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 07:25:24,453 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 7, 3, 7, 3, 2, 1] term [2020-11-28 07:25:24,454 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:25:24,582 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 7, 2, 2, 1] term [2020-11-28 07:25:24,583 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:25:24,584 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 3, 2, 1] term [2020-11-28 07:25:24,584 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:25:24,585 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:25:24,585 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:25:24,586 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:25:24,586 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:25:24,588 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 7, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:25:24,588 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:25:24,589 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:25:24,589 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:25:24,592 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 7, 3, 7, 3, 2, 1] term [2020-11-28 07:25:24,592 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:25:24,594 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 7, 3, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:25:24,594 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:25:24,596 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 7, 3, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:25:24,596 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:25:24,622 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 7, 3, 7, 3, 2, 1] term [2020-11-28 07:25:24,622 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 07:25:24,624 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 7, 3, 7, 3, 2, 1] term [2020-11-28 07:25:24,624 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:25:24,653 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 7, 3, 7, 3, 2, 1] term [2020-11-28 07:25:24,653 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 07:25:24,655 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 7, 3, 7, 3, 2, 1] term [2020-11-28 07:25:24,655 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:25:24,678 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 7, 2, 2, 1] term [2020-11-28 07:25:24,678 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:25:24,679 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 3, 2, 1] term [2020-11-28 07:25:24,680 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:25:24,680 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:25:24,680 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:25:24,681 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:25:24,682 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:25:24,683 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 7, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:25:24,684 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:25:24,685 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:25:24,685 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:25:24,687 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 7, 3, 7, 3, 2, 1] term [2020-11-28 07:25:24,687 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:25:24,691 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 7, 3, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:25:24,691 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:25:24,693 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 7, 3, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:25:24,693 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:25:25,667 WARN L193 SmtUtils]: Spent 932.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 134 [2020-11-28 07:25:25,925 WARN L193 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2020-11-28 07:25:25,929 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 7, 3, 7, 3, 2, 1] term [2020-11-28 07:25:25,929 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 07:25:25,931 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 7, 3, 7, 3, 2, 1] term [2020-11-28 07:25:25,931 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:25:25,971 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 7, 2, 2, 1] term [2020-11-28 07:25:25,972 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:25:25,972 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 3, 2, 1] term [2020-11-28 07:25:25,973 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:25:25,973 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:25:25,973 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:25:25,974 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:25:25,974 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:25:25,976 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 7, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:25:25,976 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:25:25,978 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:25:25,978 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:25:25,979 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 7, 3, 7, 3, 2, 1] term [2020-11-28 07:25:25,980 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:25:25,981 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 7, 3, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:25:25,981 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:25:25,983 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 7, 3, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:25:25,983 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:25:26,436 WARN L193 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2020-11-28 07:25:26,658 WARN L193 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2020-11-28 07:25:26,864 INFO L131 LiptonReduction]: Checked pairs total: 6769 [2020-11-28 07:25:26,864 INFO L133 LiptonReduction]: Total number of compositions: 105 [2020-11-28 07:25:26,869 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 31 transitions, 82 flow [2020-11-28 07:25:27,033 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2602 states. [2020-11-28 07:25:27,035 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states. [2020-11-28 07:25:27,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-28 07:25:27,041 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:25:27,042 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:25:27,042 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:25:27,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:25:27,047 INFO L82 PathProgramCache]: Analyzing trace with hash 172921797, now seen corresponding path program 1 times [2020-11-28 07:25:27,056 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:25:27,057 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201050166] [2020-11-28 07:25:27,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:25:27,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:25:27,352 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-28 07:25:27,353 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201050166] [2020-11-28 07:25:27,353 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:25:27,353 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-28 07:25:27,354 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332322144] [2020-11-28 07:25:27,358 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 07:25:27,358 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:25:27,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 07:25:27,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 07:25:27,377 INFO L87 Difference]: Start difference. First operand 2602 states. Second operand 3 states. [2020-11-28 07:25:27,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:25:27,552 INFO L93 Difference]: Finished difference Result 2202 states and 8424 transitions. [2020-11-28 07:25:27,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 07:25:27,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-11-28 07:25:27,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:25:27,604 INFO L225 Difference]: With dead ends: 2202 [2020-11-28 07:25:27,605 INFO L226 Difference]: Without dead ends: 1802 [2020-11-28 07:25:27,606 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 07:25:27,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2020-11-28 07:25:27,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1802. [2020-11-28 07:25:27,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1802 states. [2020-11-28 07:25:27,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 6784 transitions. [2020-11-28 07:25:27,744 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 6784 transitions. Word has length 9 [2020-11-28 07:25:27,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:25:27,745 INFO L481 AbstractCegarLoop]: Abstraction has 1802 states and 6784 transitions. [2020-11-28 07:25:27,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 07:25:27,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 6784 transitions. [2020-11-28 07:25:27,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-28 07:25:27,748 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:25:27,749 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:25:27,749 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-28 07:25:27,749 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:25:27,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:25:27,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1325818042, now seen corresponding path program 1 times [2020-11-28 07:25:27,750 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:25:27,750 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145860651] [2020-11-28 07:25:27,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:25:27,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:25:27,832 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-28 07:25:27,833 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145860651] [2020-11-28 07:25:27,833 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:25:27,833 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-28 07:25:27,833 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642840409] [2020-11-28 07:25:27,834 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 07:25:27,834 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:25:27,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 07:25:27,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 07:25:27,835 INFO L87 Difference]: Start difference. First operand 1802 states and 6784 transitions. Second operand 3 states. [2020-11-28 07:25:27,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:25:27,872 INFO L93 Difference]: Finished difference Result 1752 states and 6554 transitions. [2020-11-28 07:25:27,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 07:25:27,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-11-28 07:25:27,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:25:27,893 INFO L225 Difference]: With dead ends: 1752 [2020-11-28 07:25:27,893 INFO L226 Difference]: Without dead ends: 1752 [2020-11-28 07:25:27,894 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 07:25:27,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2020-11-28 07:25:27,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1752. [2020-11-28 07:25:27,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1752 states. [2020-11-28 07:25:27,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1752 states to 1752 states and 6554 transitions. [2020-11-28 07:25:27,967 INFO L78 Accepts]: Start accepts. Automaton has 1752 states and 6554 transitions. Word has length 11 [2020-11-28 07:25:27,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:25:27,967 INFO L481 AbstractCegarLoop]: Abstraction has 1752 states and 6554 transitions. [2020-11-28 07:25:27,967 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 07:25:27,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1752 states and 6554 transitions. [2020-11-28 07:25:27,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-28 07:25:27,970 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:25:27,970 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:25:27,970 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-28 07:25:27,971 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:25:27,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:25:27,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1861488477, now seen corresponding path program 1 times [2020-11-28 07:25:27,971 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:25:27,972 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942794004] [2020-11-28 07:25:27,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:25:28,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:25:28,115 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-28 07:25:28,115 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942794004] [2020-11-28 07:25:28,115 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:25:28,115 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-28 07:25:28,115 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520514557] [2020-11-28 07:25:28,116 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 07:25:28,116 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:25:28,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 07:25:28,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 07:25:28,117 INFO L87 Difference]: Start difference. First operand 1752 states and 6554 transitions. Second operand 3 states. [2020-11-28 07:25:28,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:25:28,211 INFO L93 Difference]: Finished difference Result 1682 states and 6258 transitions. [2020-11-28 07:25:28,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 07:25:28,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-11-28 07:25:28,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:25:28,231 INFO L225 Difference]: With dead ends: 1682 [2020-11-28 07:25:28,231 INFO L226 Difference]: Without dead ends: 1682 [2020-11-28 07:25:28,231 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 07:25:28,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1682 states. [2020-11-28 07:25:28,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1682 to 1682. [2020-11-28 07:25:28,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1682 states. [2020-11-28 07:25:28,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 6258 transitions. [2020-11-28 07:25:28,316 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 6258 transitions. Word has length 12 [2020-11-28 07:25:28,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:25:28,316 INFO L481 AbstractCegarLoop]: Abstraction has 1682 states and 6258 transitions. [2020-11-28 07:25:28,317 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 07:25:28,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 6258 transitions. [2020-11-28 07:25:28,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-28 07:25:28,321 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:25:28,321 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:25:28,321 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-28 07:25:28,321 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:25:28,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:25:28,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1871500579, now seen corresponding path program 1 times [2020-11-28 07:25:28,322 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:25:28,323 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323720423] [2020-11-28 07:25:28,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:25:28,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:25:28,485 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-28 07:25:28,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323720423] [2020-11-28 07:25:28,486 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:25:28,486 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 07:25:28,486 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112973608] [2020-11-28 07:25:28,486 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 07:25:28,486 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:25:28,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 07:25:28,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-28 07:25:28,487 INFO L87 Difference]: Start difference. First operand 1682 states and 6258 transitions. Second operand 5 states. [2020-11-28 07:25:28,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:25:28,578 INFO L93 Difference]: Finished difference Result 1626 states and 6010 transitions. [2020-11-28 07:25:28,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 07:25:28,579 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-11-28 07:25:28,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:25:28,596 INFO L225 Difference]: With dead ends: 1626 [2020-11-28 07:25:28,596 INFO L226 Difference]: Without dead ends: 1626 [2020-11-28 07:25:28,596 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-11-28 07:25:28,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2020-11-28 07:25:28,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 1626. [2020-11-28 07:25:28,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1626 states. [2020-11-28 07:25:28,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1626 states to 1626 states and 6010 transitions. [2020-11-28 07:25:28,699 INFO L78 Accepts]: Start accepts. Automaton has 1626 states and 6010 transitions. Word has length 13 [2020-11-28 07:25:28,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:25:28,699 INFO L481 AbstractCegarLoop]: Abstraction has 1626 states and 6010 transitions. [2020-11-28 07:25:28,699 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 07:25:28,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1626 states and 6010 transitions. [2020-11-28 07:25:28,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-28 07:25:28,703 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:25:28,703 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:25:28,703 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-28 07:25:28,703 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:25:28,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:25:28,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1082379228, now seen corresponding path program 1 times [2020-11-28 07:25:28,704 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:25:28,704 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240342167] [2020-11-28 07:25:28,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:25:28,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:25:28,837 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-28 07:25:28,837 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240342167] [2020-11-28 07:25:28,838 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:25:28,838 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 07:25:28,838 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932057193] [2020-11-28 07:25:28,838 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 07:25:28,838 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:25:28,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 07:25:28,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 07:25:28,839 INFO L87 Difference]: Start difference. First operand 1626 states and 6010 transitions. Second operand 4 states. [2020-11-28 07:25:28,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:25:28,905 INFO L93 Difference]: Finished difference Result 1682 states and 5674 transitions. [2020-11-28 07:25:28,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 07:25:28,905 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-11-28 07:25:28,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:25:28,917 INFO L225 Difference]: With dead ends: 1682 [2020-11-28 07:25:28,917 INFO L226 Difference]: Without dead ends: 1282 [2020-11-28 07:25:28,917 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-28 07:25:28,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states. [2020-11-28 07:25:28,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 1282. [2020-11-28 07:25:28,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1282 states. [2020-11-28 07:25:28,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 4290 transitions. [2020-11-28 07:25:28,967 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 4290 transitions. Word has length 15 [2020-11-28 07:25:28,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:25:28,967 INFO L481 AbstractCegarLoop]: Abstraction has 1282 states and 4290 transitions. [2020-11-28 07:25:28,968 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 07:25:28,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 4290 transitions. [2020-11-28 07:25:28,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-28 07:25:28,970 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:25:28,971 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:25:28,971 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-28 07:25:28,971 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:25:28,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:25:28,971 INFO L82 PathProgramCache]: Analyzing trace with hash -75162851, now seen corresponding path program 1 times [2020-11-28 07:25:28,972 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:25:28,972 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003698385] [2020-11-28 07:25:28,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:25:29,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:25:29,106 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-28 07:25:29,106 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003698385] [2020-11-28 07:25:29,106 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:25:29,106 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 07:25:29,106 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699960803] [2020-11-28 07:25:29,107 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 07:25:29,107 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:25:29,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 07:25:29,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-28 07:25:29,107 INFO L87 Difference]: Start difference. First operand 1282 states and 4290 transitions. Second operand 5 states. [2020-11-28 07:25:29,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:25:29,186 INFO L93 Difference]: Finished difference Result 1105 states and 3390 transitions. [2020-11-28 07:25:29,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 07:25:29,187 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-11-28 07:25:29,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:25:29,194 INFO L225 Difference]: With dead ends: 1105 [2020-11-28 07:25:29,195 INFO L226 Difference]: Without dead ends: 849 [2020-11-28 07:25:29,195 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-28 07:25:29,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2020-11-28 07:25:29,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 849. [2020-11-28 07:25:29,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2020-11-28 07:25:29,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 2558 transitions. [2020-11-28 07:25:29,225 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 2558 transitions. Word has length 16 [2020-11-28 07:25:29,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:25:29,226 INFO L481 AbstractCegarLoop]: Abstraction has 849 states and 2558 transitions. [2020-11-28 07:25:29,226 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 07:25:29,226 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 2558 transitions. [2020-11-28 07:25:29,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-28 07:25:29,228 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:25:29,228 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-28 07:25:29,229 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-28 07:25:29,229 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:25:29,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:25:29,229 INFO L82 PathProgramCache]: Analyzing trace with hash 679643642, now seen corresponding path program 1 times [2020-11-28 07:25:29,230 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:25:29,230 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126733924] [2020-11-28 07:25:29,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:25:29,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:25:29,303 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-28 07:25:29,303 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126733924] [2020-11-28 07:25:29,304 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:25:29,304 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 07:25:29,304 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058261687] [2020-11-28 07:25:29,304 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 07:25:29,304 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:25:29,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 07:25:29,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 07:25:29,305 INFO L87 Difference]: Start difference. First operand 849 states and 2558 transitions. Second operand 4 states. [2020-11-28 07:25:29,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:25:29,340 INFO L93 Difference]: Finished difference Result 1165 states and 3424 transitions. [2020-11-28 07:25:29,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 07:25:29,341 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-11-28 07:25:29,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:25:29,348 INFO L225 Difference]: With dead ends: 1165 [2020-11-28 07:25:29,348 INFO L226 Difference]: Without dead ends: 873 [2020-11-28 07:25:29,349 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-28 07:25:29,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2020-11-28 07:25:29,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 849. [2020-11-28 07:25:29,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2020-11-28 07:25:29,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 2478 transitions. [2020-11-28 07:25:29,382 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 2478 transitions. Word has length 18 [2020-11-28 07:25:29,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:25:29,383 INFO L481 AbstractCegarLoop]: Abstraction has 849 states and 2478 transitions. [2020-11-28 07:25:29,383 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 07:25:29,383 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 2478 transitions. [2020-11-28 07:25:29,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-28 07:25:29,385 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:25:29,385 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-28 07:25:29,385 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-28 07:25:29,386 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:25:29,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:25:29,386 INFO L82 PathProgramCache]: Analyzing trace with hash -555388612, now seen corresponding path program 1 times [2020-11-28 07:25:29,386 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:25:29,387 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038529250] [2020-11-28 07:25:29,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:25:29,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:25:29,511 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-28 07:25:29,512 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038529250] [2020-11-28 07:25:29,512 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:25:29,512 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 07:25:29,512 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094160836] [2020-11-28 07:25:29,512 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 07:25:29,512 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:25:29,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 07:25:29,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-28 07:25:29,513 INFO L87 Difference]: Start difference. First operand 849 states and 2478 transitions. Second operand 6 states. [2020-11-28 07:25:29,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:25:29,584 INFO L93 Difference]: Finished difference Result 734 states and 2110 transitions. [2020-11-28 07:25:29,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-28 07:25:29,585 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-11-28 07:25:29,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:25:29,590 INFO L225 Difference]: With dead ends: 734 [2020-11-28 07:25:29,591 INFO L226 Difference]: Without dead ends: 646 [2020-11-28 07:25:29,591 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-28 07:25:29,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2020-11-28 07:25:29,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 646. [2020-11-28 07:25:29,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2020-11-28 07:25:29,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 1887 transitions. [2020-11-28 07:25:29,638 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 1887 transitions. Word has length 18 [2020-11-28 07:25:29,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:25:29,638 INFO L481 AbstractCegarLoop]: Abstraction has 646 states and 1887 transitions. [2020-11-28 07:25:29,638 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 07:25:29,638 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 1887 transitions. [2020-11-28 07:25:29,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-28 07:25:29,640 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:25:29,640 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-28 07:25:29,640 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-28 07:25:29,640 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:25:29,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:25:29,641 INFO L82 PathProgramCache]: Analyzing trace with hash 934914416, now seen corresponding path program 1 times [2020-11-28 07:25:29,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:25:29,641 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716026499] [2020-11-28 07:25:29,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:25:29,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:25:29,719 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-28 07:25:29,719 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716026499] [2020-11-28 07:25:29,719 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:25:29,719 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 07:25:29,720 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564217498] [2020-11-28 07:25:29,720 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 07:25:29,720 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:25:29,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 07:25:29,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-28 07:25:29,721 INFO L87 Difference]: Start difference. First operand 646 states and 1887 transitions. Second operand 5 states. [2020-11-28 07:25:29,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:25:29,820 INFO L93 Difference]: Finished difference Result 893 states and 2519 transitions. [2020-11-28 07:25:29,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 07:25:29,821 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-11-28 07:25:29,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:25:29,825 INFO L225 Difference]: With dead ends: 893 [2020-11-28 07:25:29,825 INFO L226 Difference]: Without dead ends: 581 [2020-11-28 07:25:29,825 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-11-28 07:25:29,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2020-11-28 07:25:29,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 579. [2020-11-28 07:25:29,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2020-11-28 07:25:29,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 1541 transitions. [2020-11-28 07:25:29,842 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 1541 transitions. Word has length 21 [2020-11-28 07:25:29,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:25:29,842 INFO L481 AbstractCegarLoop]: Abstraction has 579 states and 1541 transitions. [2020-11-28 07:25:29,842 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 07:25:29,843 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 1541 transitions. [2020-11-28 07:25:29,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-28 07:25:29,844 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:25:29,844 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-28 07:25:29,844 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-28 07:25:29,845 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:25:29,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:25:29,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1821973568, now seen corresponding path program 2 times [2020-11-28 07:25:29,845 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:25:29,846 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156058599] [2020-11-28 07:25:29,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:25:29,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:25:29,956 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-28 07:25:29,956 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156058599] [2020-11-28 07:25:29,956 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:25:29,956 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-28 07:25:29,956 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391604979] [2020-11-28 07:25:29,957 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-28 07:25:29,957 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:25:29,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-28 07:25:29,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-28 07:25:29,957 INFO L87 Difference]: Start difference. First operand 579 states and 1541 transitions. Second operand 7 states. [2020-11-28 07:25:30,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:25:30,044 INFO L93 Difference]: Finished difference Result 554 states and 1491 transitions. [2020-11-28 07:25:30,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-28 07:25:30,045 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-11-28 07:25:30,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:25:30,047 INFO L225 Difference]: With dead ends: 554 [2020-11-28 07:25:30,047 INFO L226 Difference]: Without dead ends: 179 [2020-11-28 07:25:30,047 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-28 07:25:30,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2020-11-28 07:25:30,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2020-11-28 07:25:30,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2020-11-28 07:25:30,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 445 transitions. [2020-11-28 07:25:30,052 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 445 transitions. Word has length 21 [2020-11-28 07:25:30,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:25:30,053 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 445 transitions. [2020-11-28 07:25:30,053 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-28 07:25:30,054 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 445 transitions. [2020-11-28 07:25:30,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-28 07:25:30,054 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:25:30,055 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-28 07:25:30,055 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-28 07:25:30,055 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:25:30,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:25:30,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1627508946, now seen corresponding path program 1 times [2020-11-28 07:25:30,056 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:25:30,056 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978618022] [2020-11-28 07:25:30,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:25:30,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:25:30,237 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-28 07:25:30,237 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978618022] [2020-11-28 07:25:30,238 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:25:30,238 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 07:25:30,238 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980579207] [2020-11-28 07:25:30,238 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 07:25:30,238 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:25:30,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 07:25:30,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-28 07:25:30,240 INFO L87 Difference]: Start difference. First operand 179 states and 445 transitions. Second operand 6 states. [2020-11-28 07:25:30,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:25:30,371 INFO L93 Difference]: Finished difference Result 241 states and 589 transitions. [2020-11-28 07:25:30,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-28 07:25:30,372 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-11-28 07:25:30,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:25:30,373 INFO L225 Difference]: With dead ends: 241 [2020-11-28 07:25:30,373 INFO L226 Difference]: Without dead ends: 139 [2020-11-28 07:25:30,373 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-11-28 07:25:30,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-11-28 07:25:30,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2020-11-28 07:25:30,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2020-11-28 07:25:30,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 317 transitions. [2020-11-28 07:25:30,378 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 317 transitions. Word has length 25 [2020-11-28 07:25:30,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:25:30,378 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 317 transitions. [2020-11-28 07:25:30,378 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 07:25:30,378 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 317 transitions. [2020-11-28 07:25:30,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-28 07:25:30,379 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:25:30,379 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-28 07:25:30,379 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-28 07:25:30,379 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:25:30,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:25:30,379 INFO L82 PathProgramCache]: Analyzing trace with hash 91777140, now seen corresponding path program 2 times [2020-11-28 07:25:30,380 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:25:30,380 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644726888] [2020-11-28 07:25:30,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:25:30,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 07:25:30,437 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 07:25:30,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 07:25:30,475 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 07:25:30,525 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-11-28 07:25:30,525 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-28 07:25:30,526 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-28 07:25:30,527 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-11-28 07:25:30,543 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1021] [1021] L847-->L854: Formula: (let ((.cse6 (= (mod ~z$r_buff0_thd0~0_In-554177253 256) 0)) (.cse7 (= (mod ~z$w_buff0_used~0_In-554177253 256) 0)) (.cse9 (= (mod ~z$r_buff1_thd0~0_In-554177253 256) 0)) (.cse8 (= (mod ~z$w_buff1_used~0_In-554177253 256) 0))) (let ((.cse3 (or .cse9 .cse8)) (.cse1 (not .cse9)) (.cse2 (not .cse8)) (.cse4 (not .cse7)) (.cse5 (not .cse6)) (.cse0 (or .cse6 .cse7))) (and (= ~z$r_buff1_thd0~0_In-554177253 ~z$r_buff1_thd0~0_Out-554177253) (or (and .cse0 (or (and (= ~z$w_buff1~0_In-554177253 ~z~0_Out-554177253) .cse1 .cse2) (and (= ~z~0_In-554177253 ~z~0_Out-554177253) .cse3))) (and (= ~z~0_Out-554177253 ~z$w_buff0~0_In-554177253) .cse4 .cse5)) (= ~z$r_buff0_thd0~0_In-554177253 ~z$r_buff0_thd0~0_Out-554177253) (or (and (= ~z$w_buff1_used~0_Out-554177253 ~z$w_buff1_used~0_In-554177253) .cse3) (and .cse1 (= ~z$w_buff1_used~0_Out-554177253 0) .cse2)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-554177253 0)) (or (and (= ~z$w_buff0_used~0_Out-554177253 0) .cse4 .cse5) (and .cse0 (= ~z$w_buff0_used~0_In-554177253 ~z$w_buff0_used~0_Out-554177253))) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-554177253 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-554177253|)))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-554177253|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-554177253, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-554177253, ~z$w_buff0~0=~z$w_buff0~0_In-554177253, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-554177253, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-554177253, ~z$w_buff1~0=~z$w_buff1~0_In-554177253, ~z~0=~z~0_In-554177253} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out-554177253, ~z$w_buff0~0=~z$w_buff0~0_In-554177253, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-554177253, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-554177253|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-554177253|, ~z$w_buff1~0=~z$w_buff1~0_In-554177253, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-554177253|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-554177253|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-554177253|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-554177253|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-554177253|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out-554177253, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-554177253, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-554177253, ~z~0=~z~0_Out-554177253} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite26, ~z~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2020-11-28 07:25:30,552 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-28 07:25:30,552 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [797] [2020-11-28 07:25:30,554 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-28 07:25:30,554 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:25:30,554 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-28 07:25:30,554 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:25:30,555 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-28 07:25:30,555 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:25:30,555 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-28 07:25:30,555 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:25:30,555 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-28 07:25:30,555 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:25:30,557 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-28 07:25:30,557 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:25:30,557 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-28 07:25:30,557 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:25:30,557 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-28 07:25:30,558 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:25:30,558 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-28 07:25:30,558 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:25:30,558 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-28 07:25:30,558 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:25:30,559 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-28 07:25:30,559 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:25:30,559 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-28 07:25:30,559 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:25:30,559 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-28 07:25:30,560 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:25:30,560 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-28 07:25:30,560 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:25:30,560 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-28 07:25:30,560 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:25:30,564 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-28 07:25:30,565 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:25:30,565 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-28 07:25:30,565 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:25:30,566 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-28 07:25:30,566 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:25:30,566 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-28 07:25:30,566 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:25:30,567 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-28 07:25:30,567 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:25:30,567 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-28 07:25:30,567 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:25:30,567 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-28 07:25:30,567 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:25:30,567 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-28 07:25:30,568 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:25:30,568 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-28 07:25:30,568 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:25:30,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 07:25:30 BasicIcfg [2020-11-28 07:25:30,656 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-28 07:25:30,657 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-28 07:25:30,657 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-28 07:25:30,657 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-28 07:25:30,658 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 07:25:16" (3/4) ... [2020-11-28 07:25:30,660 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-28 07:25:30,670 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1021] [1021] L847-->L854: Formula: (let ((.cse6 (= (mod ~z$r_buff0_thd0~0_In-554177253 256) 0)) (.cse7 (= (mod ~z$w_buff0_used~0_In-554177253 256) 0)) (.cse9 (= (mod ~z$r_buff1_thd0~0_In-554177253 256) 0)) (.cse8 (= (mod ~z$w_buff1_used~0_In-554177253 256) 0))) (let ((.cse3 (or .cse9 .cse8)) (.cse1 (not .cse9)) (.cse2 (not .cse8)) (.cse4 (not .cse7)) (.cse5 (not .cse6)) (.cse0 (or .cse6 .cse7))) (and (= ~z$r_buff1_thd0~0_In-554177253 ~z$r_buff1_thd0~0_Out-554177253) (or (and .cse0 (or (and (= ~z$w_buff1~0_In-554177253 ~z~0_Out-554177253) .cse1 .cse2) (and (= ~z~0_In-554177253 ~z~0_Out-554177253) .cse3))) (and (= ~z~0_Out-554177253 ~z$w_buff0~0_In-554177253) .cse4 .cse5)) (= ~z$r_buff0_thd0~0_In-554177253 ~z$r_buff0_thd0~0_Out-554177253) (or (and (= ~z$w_buff1_used~0_Out-554177253 ~z$w_buff1_used~0_In-554177253) .cse3) (and .cse1 (= ~z$w_buff1_used~0_Out-554177253 0) .cse2)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-554177253 0)) (or (and (= ~z$w_buff0_used~0_Out-554177253 0) .cse4 .cse5) (and .cse0 (= ~z$w_buff0_used~0_In-554177253 ~z$w_buff0_used~0_Out-554177253))) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-554177253 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-554177253|)))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-554177253|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-554177253, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-554177253, ~z$w_buff0~0=~z$w_buff0~0_In-554177253, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-554177253, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-554177253, ~z$w_buff1~0=~z$w_buff1~0_In-554177253, ~z~0=~z~0_In-554177253} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out-554177253, ~z$w_buff0~0=~z$w_buff0~0_In-554177253, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-554177253, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-554177253|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-554177253|, ~z$w_buff1~0=~z$w_buff1~0_In-554177253, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-554177253|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-554177253|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-554177253|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-554177253|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-554177253|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out-554177253, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-554177253, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-554177253, ~z~0=~z~0_Out-554177253} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite26, ~z~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2020-11-28 07:25:30,672 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-28 07:25:30,672 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [797] [2020-11-28 07:25:30,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-28 07:25:30,673 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:25:30,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-28 07:25:30,673 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:25:30,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-28 07:25:30,674 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:25:30,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-28 07:25:30,674 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:25:30,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-28 07:25:30,674 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:25:30,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-28 07:25:30,675 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:25:30,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-28 07:25:30,675 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:25:30,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-28 07:25:30,675 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:25:30,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-28 07:25:30,675 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:25:30,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-28 07:25:30,676 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:25:30,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-28 07:25:30,676 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:25:30,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-28 07:25:30,677 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:25:30,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-28 07:25:30,677 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:25:30,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-28 07:25:30,677 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:25:30,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-28 07:25:30,677 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:25:30,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-28 07:25:30,678 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:25:30,678 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-28 07:25:30,678 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:25:30,678 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-28 07:25:30,678 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:25:30,678 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-28 07:25:30,678 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:25:30,679 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-28 07:25:30,679 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:25:30,679 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-28 07:25:30,679 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:25:30,679 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-28 07:25:30,679 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:25:30,679 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-28 07:25:30,680 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:25:30,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-28 07:25:30,680 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:25:30,757 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_4bad10db-1854-4c2f-b88a-dd3c8f02e234/bin/utaipan/witness.graphml [2020-11-28 07:25:30,757 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-28 07:25:30,758 INFO L168 Benchmark]: Toolchain (without parser) took 17893.27 ms. Allocated memory was 121.6 MB in the beginning and 293.6 MB in the end (delta: 172.0 MB). Free memory was 83.0 MB in the beginning and 97.6 MB in the end (delta: -14.5 MB). Peak memory consumption was 157.4 MB. Max. memory is 16.1 GB. [2020-11-28 07:25:30,758 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 121.6 MB. Free memory was 92.4 MB in the beginning and 92.3 MB in the end (delta: 23.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 07:25:30,759 INFO L168 Benchmark]: CACSL2BoogieTranslator took 753.05 ms. Allocated memory is still 121.6 MB. Free memory was 83.0 MB in the beginning and 71.0 MB in the end (delta: 12.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-28 07:25:30,759 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.54 ms. Allocated memory is still 121.6 MB. Free memory was 71.0 MB in the beginning and 68.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-28 07:25:30,760 INFO L168 Benchmark]: Boogie Preprocessor took 47.82 ms. Allocated memory is still 121.6 MB. Free memory was 68.3 MB in the beginning and 66.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 07:25:30,760 INFO L168 Benchmark]: RCFGBuilder took 2327.29 ms. Allocated memory was 121.6 MB in the beginning and 155.2 MB in the end (delta: 33.6 MB). Free memory was 66.2 MB in the beginning and 111.5 MB in the end (delta: -45.3 MB). Peak memory consumption was 66.2 MB. Max. memory is 16.1 GB. [2020-11-28 07:25:30,760 INFO L168 Benchmark]: TraceAbstraction took 14595.85 ms. Allocated memory was 155.2 MB in the beginning and 293.6 MB in the end (delta: 138.4 MB). Free memory was 110.4 MB in the beginning and 115.4 MB in the end (delta: -5.0 MB). Peak memory consumption was 133.5 MB. Max. memory is 16.1 GB. [2020-11-28 07:25:30,761 INFO L168 Benchmark]: Witness Printer took 100.00 ms. Allocated memory is still 293.6 MB. Free memory was 115.4 MB in the beginning and 97.6 MB in the end (delta: 17.8 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2020-11-28 07:25:30,763 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 121.6 MB. Free memory was 92.4 MB in the beginning and 92.3 MB in the end (delta: 23.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 753.05 ms. Allocated memory is still 121.6 MB. Free memory was 83.0 MB in the beginning and 71.0 MB in the end (delta: 12.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 62.54 ms. Allocated memory is still 121.6 MB. Free memory was 71.0 MB in the beginning and 68.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 47.82 ms. Allocated memory is still 121.6 MB. Free memory was 68.3 MB in the beginning and 66.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2327.29 ms. Allocated memory was 121.6 MB in the beginning and 155.2 MB in the end (delta: 33.6 MB). Free memory was 66.2 MB in the beginning and 111.5 MB in the end (delta: -45.3 MB). Peak memory consumption was 66.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 14595.85 ms. Allocated memory was 155.2 MB in the beginning and 293.6 MB in the end (delta: 138.4 MB). Free memory was 110.4 MB in the beginning and 115.4 MB in the end (delta: -5.0 MB). Peak memory consumption was 133.5 MB. Max. memory is 16.1 GB. * Witness Printer took 100.00 ms. Allocated memory is still 293.6 MB. Free memory was 115.4 MB in the beginning and 97.6 MB in the end (delta: 17.8 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1746 VarBasedMoverChecksPositive, 68 VarBasedMoverChecksNegative, 14 SemBasedMoverChecksPositive, 54 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 198 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 10.6s, 127 PlacesBefore, 44 PlacesAfterwards, 117 TransitionsBefore, 31 TransitionsAfterwards, 2622 CoEnabledTransitionPairs, 7 FixpointIterations, 39 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 3 ChoiceCompositions, 105 TotalNumberOfCompositions, 6769 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L724] 0 int z = 0; [L725] 0 _Bool z$flush_delayed; [L726] 0 int z$mem_tmp; [L727] 0 _Bool z$r_buff0_thd0; [L728] 0 _Bool z$r_buff0_thd1; [L729] 0 _Bool z$r_buff0_thd2; [L730] 0 _Bool z$r_buff0_thd3; [L731] 0 _Bool z$r_buff0_thd4; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$r_buff1_thd4; [L737] 0 _Bool z$read_delayed; [L738] 0 int *z$read_delayed_var; [L739] 0 int z$w_buff0; [L740] 0 _Bool z$w_buff0_used; [L741] 0 int z$w_buff1; [L742] 0 _Bool z$w_buff1_used; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L836] 0 pthread_t t1469; [L837] FCALL, FORK 0 pthread_create(&t1469, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 pthread_t t1470; [L839] FCALL, FORK 0 pthread_create(&t1470, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t1471; [L841] FCALL, FORK 0 pthread_create(&t1471, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] 0 pthread_t t1472; [L843] FCALL, FORK 0 pthread_create(&t1472, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 2 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L803] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L804] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L805] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L806] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L807] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L808] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L763] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, 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=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, 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=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L778] 3 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, 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=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, 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=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L814] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L814] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L815] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L816] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L816] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L817] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L817] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L818] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L818] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L821] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 4 return 0; [L784] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L784] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L785] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L785] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L786] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L787] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L787] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L788] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L791] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 3 return 0; [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L856] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L857] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L858] 0 z$flush_delayed = weak$$choice2 [L859] 0 z$mem_tmp = z [L860] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1 [L860] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L860] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L861] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L861] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0 [L861] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L861] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L861] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L862] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L862] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L863] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L863] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L864] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L865] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L865] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L865] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L866] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L866] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L866] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L866] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L866] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L866] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L868] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L868] 0 z = z$flush_delayed ? z$mem_tmp : z [L869] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix055_pso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, 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=3, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 115 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 14.3s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.8s, HoareTripleCheckerStatistics: 325 SDtfs, 411 SDslu, 538 SDs, 0 SdLazy, 252 SolverSat, 72 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2602occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 26 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 204 NumberOfCodeBlocks, 204 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 168 ConstructedInterpolants, 0 QuantifiedInterpolants, 16956 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...