./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi009_rmo.oepc.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_9f8b7935-07e5-4ba9-8a8a-c9ae10e8514f/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_9f8b7935-07e5-4ba9-8a8a-c9ae10e8514f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9f8b7935-07e5-4ba9-8a8a-c9ae10e8514f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9f8b7935-07e5-4ba9-8a8a-c9ae10e8514f/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi009_rmo.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_9f8b7935-07e5-4ba9-8a8a-c9ae10e8514f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9f8b7935-07e5-4ba9-8a8a-c9ae10e8514f/bin/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 59776cddfeb2e08853eeec1404e900eb4d3f1a59 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 03:01:25,326 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-28 03:01:25,330 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-28 03:01:25,413 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-28 03:01:25,414 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-28 03:01:25,416 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-28 03:01:25,418 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-28 03:01:25,421 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-28 03:01:25,424 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-28 03:01:25,426 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-28 03:01:25,428 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-28 03:01:25,430 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-28 03:01:25,431 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-28 03:01:25,433 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-28 03:01:25,435 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-28 03:01:25,437 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-28 03:01:25,439 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-28 03:01:25,441 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-28 03:01:25,444 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-28 03:01:25,448 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-28 03:01:25,450 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-28 03:01:25,452 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-28 03:01:25,455 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-28 03:01:25,456 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-28 03:01:25,461 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-28 03:01:25,462 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-28 03:01:25,462 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-28 03:01:25,464 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-28 03:01:25,465 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-28 03:01:25,467 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-28 03:01:25,467 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-28 03:01:25,469 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-28 03:01:25,470 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-28 03:01:25,472 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-28 03:01:25,474 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-28 03:01:25,475 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-28 03:01:25,477 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-28 03:01:25,478 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-28 03:01:25,479 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-28 03:01:25,480 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-28 03:01:25,480 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-28 03:01:25,486 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9f8b7935-07e5-4ba9-8a8a-c9ae10e8514f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-28 03:01:25,516 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-28 03:01:25,516 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-28 03:01:25,518 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-28 03:01:25,518 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-28 03:01:25,518 INFO L138 SettingsManager]: * Use SBE=true [2020-11-28 03:01:25,519 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-28 03:01:25,519 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-28 03:01:25,519 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-28 03:01:25,519 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-28 03:01:25,520 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-28 03:01:25,520 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-28 03:01:25,520 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-28 03:01:25,520 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-28 03:01:25,521 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-28 03:01:25,521 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-28 03:01:25,521 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-28 03:01:25,521 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-28 03:01:25,522 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-28 03:01:25,522 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-28 03:01:25,522 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-28 03:01:25,523 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-28 03:01:25,523 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-28 03:01:25,523 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-28 03:01:25,523 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-28 03:01:25,524 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-28 03:01:25,524 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-28 03:01:25,524 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-28 03:01:25,524 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-28 03:01:25,525 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-28 03:01:25,525 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_9f8b7935-07e5-4ba9-8a8a-c9ae10e8514f/bin/uautomizer/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_9f8b7935-07e5-4ba9-8a8a-c9ae10e8514f/bin/uautomizer 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 -> Automizer 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 -> 59776cddfeb2e08853eeec1404e900eb4d3f1a59 [2020-11-28 03:01:25,838 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-28 03:01:25,882 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-28 03:01:25,888 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-28 03:01:25,889 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-28 03:01:25,892 INFO L275 PluginConnector]: CDTParser initialized [2020-11-28 03:01:25,894 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9f8b7935-07e5-4ba9-8a8a-c9ae10e8514f/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/rfi009_rmo.oepc.i [2020-11-28 03:01:26,014 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9f8b7935-07e5-4ba9-8a8a-c9ae10e8514f/bin/uautomizer/data/991bfd493/d7b1c63b752742ecb7f79b9090a0760d/FLAG7e51020a5 [2020-11-28 03:01:26,777 INFO L306 CDTParser]: Found 1 translation units. [2020-11-28 03:01:26,778 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9f8b7935-07e5-4ba9-8a8a-c9ae10e8514f/sv-benchmarks/c/pthread-wmm/rfi009_rmo.oepc.i [2020-11-28 03:01:26,800 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9f8b7935-07e5-4ba9-8a8a-c9ae10e8514f/bin/uautomizer/data/991bfd493/d7b1c63b752742ecb7f79b9090a0760d/FLAG7e51020a5 [2020-11-28 03:01:27,080 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9f8b7935-07e5-4ba9-8a8a-c9ae10e8514f/bin/uautomizer/data/991bfd493/d7b1c63b752742ecb7f79b9090a0760d [2020-11-28 03:01:27,092 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-28 03:01:27,093 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-28 03:01:27,097 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-28 03:01:27,098 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-28 03:01:27,102 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-28 03:01:27,103 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:01:27" (1/1) ... [2020-11-28 03:01:27,106 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31c0c5c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:27, skipping insertion in model container [2020-11-28 03:01:27,107 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:01:27" (1/1) ... [2020-11-28 03:01:27,116 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-28 03:01:27,168 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-28 03:01:27,642 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:01:27,654 INFO L203 MainTranslator]: Completed pre-run [2020-11-28 03:01:27,729 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:01:27,822 INFO L208 MainTranslator]: Completed translation [2020-11-28 03:01:27,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:27 WrapperNode [2020-11-28 03:01:27,823 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-28 03:01:27,824 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-28 03:01:27,825 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-28 03:01:27,825 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-28 03:01:27,835 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:27" (1/1) ... [2020-11-28 03:01:27,860 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:27" (1/1) ... [2020-11-28 03:01:27,893 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-28 03:01:27,895 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-28 03:01:27,895 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-28 03:01:27,895 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-28 03:01:27,906 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:27" (1/1) ... [2020-11-28 03:01:27,907 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:27" (1/1) ... [2020-11-28 03:01:27,915 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:27" (1/1) ... [2020-11-28 03:01:27,916 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:27" (1/1) ... [2020-11-28 03:01:27,948 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:27" (1/1) ... [2020-11-28 03:01:27,974 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:27" (1/1) ... [2020-11-28 03:01:27,980 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:27" (1/1) ... [2020-11-28 03:01:27,987 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-28 03:01:27,988 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-28 03:01:27,989 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-28 03:01:27,989 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-28 03:01:27,990 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9f8b7935-07e5-4ba9-8a8a-c9ae10e8514f/bin/uautomizer/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 03:01:28,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-28 03:01:28,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-28 03:01:28,084 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-28 03:01:28,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-28 03:01:28,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-28 03:01:28,085 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-28 03:01:28,085 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-28 03:01:28,085 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-28 03:01:28,085 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-28 03:01:28,096 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-28 03:01:28,096 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-28 03:01:28,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-28 03:01:28,097 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-28 03:01:28,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-28 03:01:28,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-28 03:01:28,099 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-28 03:01:31,782 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-28 03:01:31,783 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-11-28 03:01:31,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:01:31 BoogieIcfgContainer [2020-11-28 03:01:31,786 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-28 03:01:31,787 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-28 03:01:31,788 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-28 03:01:31,791 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-28 03:01:31,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:01:27" (1/3) ... [2020-11-28 03:01:31,793 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e37ea11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:01:31, skipping insertion in model container [2020-11-28 03:01:31,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:27" (2/3) ... [2020-11-28 03:01:31,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e37ea11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:01:31, skipping insertion in model container [2020-11-28 03:01:31,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:01:31" (3/3) ... [2020-11-28 03:01:31,797 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi009_rmo.oepc.i [2020-11-28 03:01:31,808 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-28 03:01:31,809 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-28 03:01:31,814 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-28 03:01:31,815 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-28 03:01:31,872 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,872 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,872 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,873 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,873 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,873 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,873 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,874 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,874 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,874 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,874 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,874 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,874 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,875 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,875 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,875 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,875 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,876 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,876 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,876 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,876 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,877 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,877 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,877 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,877 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,878 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,878 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,879 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,879 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,879 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,879 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,880 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,880 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,881 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,881 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,881 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,881 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,881 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,882 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,882 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,882 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,882 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,882 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,882 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,883 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,883 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,883 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,883 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,886 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,886 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,886 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,886 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,887 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,887 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,887 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,887 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,888 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,888 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,888 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,888 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,888 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,888 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,889 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,889 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,889 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,890 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,890 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,890 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,890 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,890 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,891 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,891 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,891 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,891 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,891 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,891 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,892 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,892 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,893 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,893 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,894 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,894 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,894 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,895 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,895 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,895 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,895 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,896 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,896 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,896 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,897 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,898 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,901 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,901 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,901 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,901 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,902 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,902 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,904 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,905 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,907 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,907 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,908 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,909 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,916 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,918 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,919 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,919 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,919 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,919 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,919 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,920 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,920 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,921 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,921 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,924 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,924 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,924 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,924 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,925 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,925 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,925 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,925 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,925 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,926 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,926 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,926 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,926 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,926 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,927 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,927 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,927 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,927 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,927 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,927 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,928 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,928 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,928 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,928 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,928 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,929 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,929 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,929 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,929 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,929 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,930 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,935 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,935 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,935 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,935 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,935 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,935 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,935 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,936 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,936 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,936 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,936 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,936 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,936 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,936 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,936 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,937 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,937 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,937 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,937 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,937 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,937 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,937 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,938 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,938 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,938 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,938 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,938 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,938 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,938 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,938 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,939 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,942 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,942 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,942 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,943 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,943 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,943 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,943 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,943 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,943 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,943 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,944 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:31,945 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-28 03:01:31,957 INFO L253 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2020-11-28 03:01:31,990 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-28 03:01:31,990 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-28 03:01:31,991 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-28 03:01:31,991 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-28 03:01:31,991 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-28 03:01:31,991 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-28 03:01:31,991 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-28 03:01:31,991 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-28 03:01:32,008 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-28 03:01:32,011 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 118 transitions, 251 flow [2020-11-28 03:01:32,015 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 118 transitions, 251 flow [2020-11-28 03:01:32,017 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 125 places, 118 transitions, 251 flow [2020-11-28 03:01:32,103 INFO L129 PetriNetUnfolder]: 3/115 cut-off events. [2020-11-28 03:01:32,103 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-28 03:01:32,107 INFO L80 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 115 events. 3/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2020-11-28 03:01:32,111 INFO L116 LiptonReduction]: Number of co-enabled transitions 1570 [2020-11-28 03:01:32,808 WARN L193 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 70 [2020-11-28 03:01:32,841 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-11-28 03:01:32,841 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:32,843 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-11-28 03:01:32,843 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:33,001 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-11-28 03:01:33,181 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-11-28 03:01:33,182 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:33,388 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 3, 5, 3, 3, 2, 1] term [2020-11-28 03:01:33,388 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:01:33,391 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:01:33,391 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:01:33,392 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:01:33,393 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:01:33,412 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:01:33,413 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:01:33,415 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:01:33,415 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:01:33,423 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:01:33,423 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:01:33,428 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:01:33,429 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-28 03:01:33,433 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:01:33,433 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-28 03:01:33,445 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:01:33,446 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-28 03:01:33,450 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 3, 5, 3, 3, 2, 1] term [2020-11-28 03:01:33,451 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:33,455 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:01:33,455 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:33,458 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:01:33,458 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:33,509 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-11-28 03:01:33,510 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:33,652 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 3, 2, 1] term [2020-11-28 03:01:33,653 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:01:33,654 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:01:33,655 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:01:33,656 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:01:33,656 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:01:33,672 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:01:33,673 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:01:33,675 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:01:33,675 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:01:33,684 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:01:33,685 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:01:33,688 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:01:33,689 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-28 03:01:33,692 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:01:33,693 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-28 03:01:33,696 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:01:33,696 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-28 03:01:33,701 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 3, 5, 3, 3, 2, 1] term [2020-11-28 03:01:33,701 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:33,706 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:01:33,706 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:33,708 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:01:33,709 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:33,812 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 3, 1] term [2020-11-28 03:01:33,813 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:33,814 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-11-28 03:01:33,814 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:33,829 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-11-28 03:01:33,829 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:33,879 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-11-28 03:01:33,880 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:01:33,881 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 2, 1] term [2020-11-28 03:01:33,881 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:01:33,883 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 6, 3, 3, 2, 1] term [2020-11-28 03:01:33,883 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:33,884 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-11-28 03:01:33,884 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:33,886 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 2, 2, 2, 1] term [2020-11-28 03:01:33,886 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:33,887 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-11-28 03:01:33,888 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:33,889 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-11-28 03:01:33,889 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:34,122 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2020-11-28 03:01:35,720 WARN L193 SmtUtils]: Spent 1.54 s on a formula simplification. DAG size of input: 238 DAG size of output: 197 [2020-11-28 03:01:35,750 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-11-28 03:01:35,751 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:36,670 WARN L193 SmtUtils]: Spent 889.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 110 [2020-11-28 03:01:36,915 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-11-28 03:01:36,916 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:36,917 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-11-28 03:01:36,917 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:36,943 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-11-28 03:01:36,944 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:36,945 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-11-28 03:01:36,945 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:37,185 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-11-28 03:01:37,186 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:37,231 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-11-28 03:01:37,231 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:37,329 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-11-28 03:01:37,329 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:37,371 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-11-28 03:01:37,371 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:37,434 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-11-28 03:01:37,435 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:37,471 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-11-28 03:01:37,472 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:37,763 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-11-28 03:01:37,763 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:37,864 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-11-28 03:01:37,864 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:37,874 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:01:37,875 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:37,876 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:01:37,876 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:37,877 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-11-28 03:01:37,877 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:37,879 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:01:37,879 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:37,880 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-11-28 03:01:37,880 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:37,882 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 03:01:37,883 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:01:37,885 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:01:37,886 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:01:37,887 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 03:01:37,888 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:01:37,890 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 2, 5, 3, 3, 2, 1] term [2020-11-28 03:01:37,890 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:01:37,893 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:01:37,893 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:01:37,895 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:01:37,895 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:01:37,932 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-11-28 03:01:37,932 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:37,959 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:01:37,960 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-28 03:01:37,963 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 6, 3, 5, 3, 3, 2, 1] term [2020-11-28 03:01:37,963 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:01:38,145 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-11-28 03:01:38,146 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:38,185 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-11-28 03:01:38,185 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:38,304 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-11-28 03:01:38,304 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:38,306 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:01:38,307 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:01:38,308 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:01:38,311 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:01:38,312 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:01:38,318 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:01:38,320 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:01:38,325 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 5, 3, 4, 3, 4, 2, 1] term [2020-11-28 03:01:38,325 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-28 03:01:38,328 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 5, 3, 4, 3, 4, 2, 1] term [2020-11-28 03:01:38,328 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-28 03:01:38,332 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 3, 5, 3, 3, 2, 1] term [2020-11-28 03:01:38,332 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:38,334 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 8, 3, 5, 3, 4, 3, 4, 2, 1] term [2020-11-28 03:01:38,335 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:38,336 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 8, 3, 5, 3, 4, 3, 4, 2, 1] term [2020-11-28 03:01:38,337 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:38,393 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:01:38,393 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-28 03:01:38,396 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:01:38,396 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-28 03:01:38,397 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:01:38,398 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-28 03:01:38,400 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 3, 3, 2, 1] term [2020-11-28 03:01:38,400 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:38,402 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:01:38,402 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:38,405 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:01:38,405 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:38,444 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:38,445 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:38,764 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-11-28 03:01:38,901 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-11-28 03:01:39,025 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:01:39,026 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-28 03:01:39,029 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 6, 3, 5, 3, 3, 2, 1] term [2020-11-28 03:01:39,029 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:01:39,033 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-11-28 03:01:39,034 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:39,083 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-11-28 03:01:39,083 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:39,093 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:01:39,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:39,094 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:01:39,095 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:39,096 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-11-28 03:01:39,096 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:39,097 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:01:39,098 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:39,099 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-11-28 03:01:39,099 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:39,101 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 03:01:39,101 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:01:39,103 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:01:39,103 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:01:39,104 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 03:01:39,105 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 03:01:39,108 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 2, 5, 3, 3, 2, 1] term [2020-11-28 03:01:39,108 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:01:39,114 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:01:39,115 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:01:39,116 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 03:01:39,117 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:01:39,450 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-11-28 03:01:39,450 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:39,487 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-11-28 03:01:39,488 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:39,537 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:39,930 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:39,931 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:39,942 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:39,942 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:40,194 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2020-11-28 03:01:40,885 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2020-11-28 03:01:41,148 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-11-28 03:01:41,148 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:41,149 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-11-28 03:01:41,149 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:41,174 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-11-28 03:01:41,174 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:41,175 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-11-28 03:01:41,175 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:41,477 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2020-11-28 03:01:41,609 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2020-11-28 03:01:41,637 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-11-28 03:01:41,637 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:41,660 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-11-28 03:01:41,661 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:41,711 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-11-28 03:01:41,712 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:01:41,713 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-11-28 03:01:41,713 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:01:41,728 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 4, 2, 2, 2, 1] term [2020-11-28 03:01:41,729 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:41,729 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 4, 2, 1] term [2020-11-28 03:01:41,730 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:41,813 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-11-28 03:01:41,813 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:41,858 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-11-28 03:01:41,859 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:42,084 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-11-28 03:01:42,085 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:42,086 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-11-28 03:01:42,086 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:42,118 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-11-28 03:01:42,118 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:42,119 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-11-28 03:01:42,119 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:42,203 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-11-28 03:01:42,203 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:42,204 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-11-28 03:01:42,204 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:42,223 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-11-28 03:01:42,223 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:42,224 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-11-28 03:01:42,224 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:42,376 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-11-28 03:01:42,501 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-11-28 03:01:42,513 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-11-28 03:01:42,513 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:42,551 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-11-28 03:01:42,551 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:42,586 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-11-28 03:01:42,587 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:01:42,587 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-11-28 03:01:42,588 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:01:43,152 WARN L193 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 106 [2020-11-28 03:01:43,339 WARN L193 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-11-28 03:01:43,346 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-11-28 03:01:43,346 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:43,411 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-11-28 03:01:43,412 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:43,455 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-11-28 03:01:43,455 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:43,456 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-11-28 03:01:43,456 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:43,478 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-11-28 03:01:43,479 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:43,479 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-11-28 03:01:43,480 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:44,565 WARN L193 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 163 DAG size of output: 161 [2020-11-28 03:01:45,002 WARN L193 SmtUtils]: Spent 434.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2020-11-28 03:01:45,006 INFO L131 LiptonReduction]: Checked pairs total: 3765 [2020-11-28 03:01:45,006 INFO L133 LiptonReduction]: Total number of compositions: 107 [2020-11-28 03:01:45,018 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 33 places, 23 transitions, 61 flow [2020-11-28 03:01:45,057 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 450 states. [2020-11-28 03:01:45,059 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states. [2020-11-28 03:01:45,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-28 03:01:45,068 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:01:45,068 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:01:45,068 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:01:45,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:01:45,075 INFO L82 PathProgramCache]: Analyzing trace with hash 185376070, now seen corresponding path program 1 times [2020-11-28 03:01:45,086 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:01:45,087 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935092993] [2020-11-28 03:01:45,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:01:45,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:01:45,456 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 03:01:45,456 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935092993] [2020-11-28 03:01:45,457 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:01:45,458 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-28 03:01:45,458 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605285554] [2020-11-28 03:01:45,466 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:01:45,466 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:01:45,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:01:45,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:01:45,489 INFO L87 Difference]: Start difference. First operand 450 states. Second operand 3 states. [2020-11-28 03:01:45,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:01:45,579 INFO L93 Difference]: Finished difference Result 418 states and 1246 transitions. [2020-11-28 03:01:45,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:01:45,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-11-28 03:01:45,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:01:45,615 INFO L225 Difference]: With dead ends: 418 [2020-11-28 03:01:45,615 INFO L226 Difference]: Without dead ends: 338 [2020-11-28 03:01:45,617 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 03:01:45,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2020-11-28 03:01:45,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2020-11-28 03:01:45,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2020-11-28 03:01:45,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 982 transitions. [2020-11-28 03:01:45,759 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 982 transitions. Word has length 9 [2020-11-28 03:01:45,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:01:45,761 INFO L481 AbstractCegarLoop]: Abstraction has 338 states and 982 transitions. [2020-11-28 03:01:45,761 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:01:45,761 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 982 transitions. [2020-11-28 03:01:45,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-28 03:01:45,767 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:01:45,767 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:01:45,768 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-28 03:01:45,768 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:01:45,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:01:45,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1368951191, now seen corresponding path program 1 times [2020-11-28 03:01:45,772 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:01:45,773 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523027245] [2020-11-28 03:01:45,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:01:45,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:01:46,023 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 03:01:46,024 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523027245] [2020-11-28 03:01:46,024 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:01:46,024 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-28 03:01:46,024 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083115366] [2020-11-28 03:01:46,025 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:01:46,026 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:01:46,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:01:46,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:01:46,027 INFO L87 Difference]: Start difference. First operand 338 states and 982 transitions. Second operand 3 states. [2020-11-28 03:01:46,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:01:46,050 INFO L93 Difference]: Finished difference Result 326 states and 941 transitions. [2020-11-28 03:01:46,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:01:46,053 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-11-28 03:01:46,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:01:46,057 INFO L225 Difference]: With dead ends: 326 [2020-11-28 03:01:46,058 INFO L226 Difference]: Without dead ends: 326 [2020-11-28 03:01:46,059 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 03:01:46,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2020-11-28 03:01:46,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2020-11-28 03:01:46,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2020-11-28 03:01:46,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 941 transitions. [2020-11-28 03:01:46,099 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 941 transitions. Word has length 11 [2020-11-28 03:01:46,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:01:46,099 INFO L481 AbstractCegarLoop]: Abstraction has 326 states and 941 transitions. [2020-11-28 03:01:46,099 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:01:46,099 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 941 transitions. [2020-11-28 03:01:46,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-28 03:01:46,109 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:01:46,109 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:01:46,110 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-28 03:01:46,110 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:01:46,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:01:46,117 INFO L82 PathProgramCache]: Analyzing trace with hash 443386570, now seen corresponding path program 1 times [2020-11-28 03:01:46,117 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:01:46,118 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363201352] [2020-11-28 03:01:46,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:01:46,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:01:46,623 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 03:01:46,623 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363201352] [2020-11-28 03:01:46,624 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:01:46,624 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:01:46,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906981652] [2020-11-28 03:01:46,624 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-28 03:01:46,625 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:01:46,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-28 03:01:46,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-28 03:01:46,626 INFO L87 Difference]: Start difference. First operand 326 states and 941 transitions. Second operand 7 states. [2020-11-28 03:01:46,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:01:46,982 INFO L93 Difference]: Finished difference Result 358 states and 1005 transitions. [2020-11-28 03:01:46,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:01:46,983 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2020-11-28 03:01:46,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:01:46,987 INFO L225 Difference]: With dead ends: 358 [2020-11-28 03:01:46,988 INFO L226 Difference]: Without dead ends: 358 [2020-11-28 03:01:46,988 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-11-28 03:01:46,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2020-11-28 03:01:47,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 358. [2020-11-28 03:01:47,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2020-11-28 03:01:47,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 1005 transitions. [2020-11-28 03:01:47,007 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 1005 transitions. Word has length 12 [2020-11-28 03:01:47,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:01:47,007 INFO L481 AbstractCegarLoop]: Abstraction has 358 states and 1005 transitions. [2020-11-28 03:01:47,007 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-28 03:01:47,008 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 1005 transitions. [2020-11-28 03:01:47,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-28 03:01:47,010 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:01:47,010 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:01:47,011 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-28 03:01:47,011 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:01:47,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:01:47,012 INFO L82 PathProgramCache]: Analyzing trace with hash 859363584, now seen corresponding path program 1 times [2020-11-28 03:01:47,012 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:01:47,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716563402] [2020-11-28 03:01:47,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:01:47,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:01:47,281 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 03:01:47,282 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716563402] [2020-11-28 03:01:47,282 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:01:47,282 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:01:47,282 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935426650] [2020-11-28 03:01:47,283 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:01:47,283 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:01:47,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:01:47,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:01:47,284 INFO L87 Difference]: Start difference. First operand 358 states and 1005 transitions. Second operand 4 states. [2020-11-28 03:01:47,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:01:47,374 INFO L93 Difference]: Finished difference Result 362 states and 912 transitions. [2020-11-28 03:01:47,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:01:47,375 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-11-28 03:01:47,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:01:47,378 INFO L225 Difference]: With dead ends: 362 [2020-11-28 03:01:47,378 INFO L226 Difference]: Without dead ends: 278 [2020-11-28 03:01:47,378 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 03:01:47,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2020-11-28 03:01:47,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2020-11-28 03:01:47,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2020-11-28 03:01:47,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 685 transitions. [2020-11-28 03:01:47,390 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 685 transitions. Word has length 13 [2020-11-28 03:01:47,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:01:47,391 INFO L481 AbstractCegarLoop]: Abstraction has 278 states and 685 transitions. [2020-11-28 03:01:47,391 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:01:47,391 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 685 transitions. [2020-11-28 03:01:47,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-28 03:01:47,392 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:01:47,393 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:01:47,393 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-28 03:01:47,393 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:01:47,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:01:47,394 INFO L82 PathProgramCache]: Analyzing trace with hash 374454945, now seen corresponding path program 1 times [2020-11-28 03:01:47,394 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:01:47,395 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98847955] [2020-11-28 03:01:47,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:01:47,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:01:47,980 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 03:01:47,981 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98847955] [2020-11-28 03:01:47,981 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:01:47,981 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:01:47,981 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029893138] [2020-11-28 03:01:47,981 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-28 03:01:47,982 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:01:47,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-28 03:01:47,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-11-28 03:01:47,983 INFO L87 Difference]: Start difference. First operand 278 states and 685 transitions. Second operand 7 states. [2020-11-28 03:01:48,437 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2020-11-28 03:01:48,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:01:48,563 INFO L93 Difference]: Finished difference Result 505 states and 1208 transitions. [2020-11-28 03:01:48,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-28 03:01:48,565 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-11-28 03:01:48,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:01:48,568 INFO L225 Difference]: With dead ends: 505 [2020-11-28 03:01:48,569 INFO L226 Difference]: Without dead ends: 463 [2020-11-28 03:01:48,569 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-11-28 03:01:48,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2020-11-28 03:01:48,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 296. [2020-11-28 03:01:48,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2020-11-28 03:01:48,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 727 transitions. [2020-11-28 03:01:48,590 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 727 transitions. Word has length 14 [2020-11-28 03:01:48,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:01:48,591 INFO L481 AbstractCegarLoop]: Abstraction has 296 states and 727 transitions. [2020-11-28 03:01:48,591 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-28 03:01:48,591 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 727 transitions. [2020-11-28 03:01:48,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-28 03:01:48,592 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:01:48,593 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:01:48,593 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-28 03:01:48,593 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:01:48,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:01:48,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1642953377, now seen corresponding path program 2 times [2020-11-28 03:01:48,594 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:01:48,595 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248335540] [2020-11-28 03:01:48,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:01:48,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:01:49,154 WARN L193 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 36 [2020-11-28 03:01:49,217 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 03:01:49,217 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248335540] [2020-11-28 03:01:49,217 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:01:49,217 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:01:49,218 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713576436] [2020-11-28 03:01:49,218 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-28 03:01:49,218 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:01:49,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-28 03:01:49,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-28 03:01:49,219 INFO L87 Difference]: Start difference. First operand 296 states and 727 transitions. Second operand 7 states. [2020-11-28 03:01:49,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:01:49,622 INFO L93 Difference]: Finished difference Result 463 states and 1104 transitions. [2020-11-28 03:01:49,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 03:01:49,623 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-11-28 03:01:49,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:01:49,627 INFO L225 Difference]: With dead ends: 463 [2020-11-28 03:01:49,627 INFO L226 Difference]: Without dead ends: 417 [2020-11-28 03:01:49,627 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-11-28 03:01:49,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2020-11-28 03:01:49,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 273. [2020-11-28 03:01:49,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2020-11-28 03:01:49,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 664 transitions. [2020-11-28 03:01:49,658 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 664 transitions. Word has length 14 [2020-11-28 03:01:49,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:01:49,659 INFO L481 AbstractCegarLoop]: Abstraction has 273 states and 664 transitions. [2020-11-28 03:01:49,659 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-28 03:01:49,659 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 664 transitions. [2020-11-28 03:01:49,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-28 03:01:49,660 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:01:49,660 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:01:49,661 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-28 03:01:49,661 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:01:49,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:01:49,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1855161395, now seen corresponding path program 1 times [2020-11-28 03:01:49,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:01:49,662 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798464142] [2020-11-28 03:01:49,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:01:49,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:01:49,899 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 03:01:49,899 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798464142] [2020-11-28 03:01:49,900 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:01:49,900 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:01:49,900 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031342918] [2020-11-28 03:01:49,900 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 03:01:49,900 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:01:49,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 03:01:49,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-28 03:01:49,901 INFO L87 Difference]: Start difference. First operand 273 states and 664 transitions. Second operand 6 states. [2020-11-28 03:01:50,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:01:50,046 INFO L93 Difference]: Finished difference Result 272 states and 661 transitions. [2020-11-28 03:01:50,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 03:01:50,057 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-11-28 03:01:50,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:01:50,059 INFO L225 Difference]: With dead ends: 272 [2020-11-28 03:01:50,060 INFO L226 Difference]: Without dead ends: 272 [2020-11-28 03:01:50,060 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-11-28 03:01:50,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2020-11-28 03:01:50,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 256. [2020-11-28 03:01:50,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2020-11-28 03:01:50,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 624 transitions. [2020-11-28 03:01:50,071 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 624 transitions. Word has length 14 [2020-11-28 03:01:50,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:01:50,071 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 624 transitions. [2020-11-28 03:01:50,071 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 03:01:50,071 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 624 transitions. [2020-11-28 03:01:50,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-28 03:01:50,072 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:01:50,072 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:01:50,073 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-28 03:01:50,073 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:01:50,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:01:50,073 INFO L82 PathProgramCache]: Analyzing trace with hash -924265576, now seen corresponding path program 1 times [2020-11-28 03:01:50,074 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:01:50,074 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596804171] [2020-11-28 03:01:50,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:01:50,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:01:50,342 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 28 [2020-11-28 03:01:50,516 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 03:01:50,517 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596804171] [2020-11-28 03:01:50,517 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:01:50,517 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-28 03:01:50,517 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815715234] [2020-11-28 03:01:50,517 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-28 03:01:50,517 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:01:50,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-28 03:01:50,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-11-28 03:01:50,518 INFO L87 Difference]: Start difference. First operand 256 states and 624 transitions. Second operand 9 states. [2020-11-28 03:01:51,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:01:51,192 INFO L93 Difference]: Finished difference Result 513 states and 1265 transitions. [2020-11-28 03:01:51,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-28 03:01:51,192 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-11-28 03:01:51,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:01:51,197 INFO L225 Difference]: With dead ends: 513 [2020-11-28 03:01:51,197 INFO L226 Difference]: Without dead ends: 481 [2020-11-28 03:01:51,198 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2020-11-28 03:01:51,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2020-11-28 03:01:51,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 351. [2020-11-28 03:01:51,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2020-11-28 03:01:51,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 874 transitions. [2020-11-28 03:01:51,222 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 874 transitions. Word has length 15 [2020-11-28 03:01:51,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:01:51,222 INFO L481 AbstractCegarLoop]: Abstraction has 351 states and 874 transitions. [2020-11-28 03:01:51,222 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-28 03:01:51,223 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 874 transitions. [2020-11-28 03:01:51,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-28 03:01:51,224 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:01:51,224 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:01:51,224 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-28 03:01:51,224 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:01:51,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:01:51,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1418290127, now seen corresponding path program 1 times [2020-11-28 03:01:51,226 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:01:51,226 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054106943] [2020-11-28 03:01:51,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:01:51,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:01:51,341 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 03:01:51,341 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054106943] [2020-11-28 03:01:51,341 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:01:51,341 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:01:51,341 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476290287] [2020-11-28 03:01:51,342 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 03:01:51,342 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:01:51,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:01:51,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:01:51,343 INFO L87 Difference]: Start difference. First operand 351 states and 874 transitions. Second operand 5 states. [2020-11-28 03:01:51,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:01:51,415 INFO L93 Difference]: Finished difference Result 298 states and 688 transitions. [2020-11-28 03:01:51,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 03:01:51,416 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-11-28 03:01:51,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:01:51,419 INFO L225 Difference]: With dead ends: 298 [2020-11-28 03:01:51,419 INFO L226 Difference]: Without dead ends: 232 [2020-11-28 03:01:51,419 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 03:01:51,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2020-11-28 03:01:51,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2020-11-28 03:01:51,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2020-11-28 03:01:51,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 522 transitions. [2020-11-28 03:01:51,428 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 522 transitions. Word has length 15 [2020-11-28 03:01:51,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:01:51,429 INFO L481 AbstractCegarLoop]: Abstraction has 232 states and 522 transitions. [2020-11-28 03:01:51,429 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 03:01:51,429 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 522 transitions. [2020-11-28 03:01:51,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-28 03:01:51,430 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:01:51,430 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:01:51,430 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-28 03:01:51,430 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:01:51,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:01:51,431 INFO L82 PathProgramCache]: Analyzing trace with hash 958778448, now seen corresponding path program 1 times [2020-11-28 03:01:51,431 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:01:51,431 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3167791] [2020-11-28 03:01:51,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:01:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:01:51,693 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 03:01:51,694 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3167791] [2020-11-28 03:01:51,694 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:01:51,694 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:01:51,694 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308623726] [2020-11-28 03:01:51,694 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-28 03:01:51,694 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:01:51,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-28 03:01:51,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-11-28 03:01:51,695 INFO L87 Difference]: Start difference. First operand 232 states and 522 transitions. Second operand 7 states. [2020-11-28 03:01:52,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:01:52,003 INFO L93 Difference]: Finished difference Result 336 states and 721 transitions. [2020-11-28 03:01:52,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:01:52,004 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-11-28 03:01:52,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:01:52,007 INFO L225 Difference]: With dead ends: 336 [2020-11-28 03:01:52,007 INFO L226 Difference]: Without dead ends: 306 [2020-11-28 03:01:52,007 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2020-11-28 03:01:52,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2020-11-28 03:01:52,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 194. [2020-11-28 03:01:52,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2020-11-28 03:01:52,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 423 transitions. [2020-11-28 03:01:52,018 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 423 transitions. Word has length 16 [2020-11-28 03:01:52,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:01:52,021 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 423 transitions. [2020-11-28 03:01:52,021 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-28 03:01:52,021 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 423 transitions. [2020-11-28 03:01:52,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-28 03:01:52,022 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:01:52,022 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:01:52,023 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-28 03:01:52,023 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:01:52,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:01:52,024 INFO L82 PathProgramCache]: Analyzing trace with hash 816386892, now seen corresponding path program 1 times [2020-11-28 03:01:52,024 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:01:52,024 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086688863] [2020-11-28 03:01:52,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:01:52,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:01:52,168 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 03:01:52,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086688863] [2020-11-28 03:01:52,168 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:01:52,168 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:01:52,169 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675595744] [2020-11-28 03:01:52,169 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 03:01:52,169 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:01:52,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 03:01:52,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-28 03:01:52,170 INFO L87 Difference]: Start difference. First operand 194 states and 423 transitions. Second operand 6 states. [2020-11-28 03:01:52,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:01:52,261 INFO L93 Difference]: Finished difference Result 176 states and 385 transitions. [2020-11-28 03:01:52,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-28 03:01:52,262 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-11-28 03:01:52,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:01:52,266 INFO L225 Difference]: With dead ends: 176 [2020-11-28 03:01:52,266 INFO L226 Difference]: Without dead ends: 129 [2020-11-28 03:01:52,266 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 03:01:52,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2020-11-28 03:01:52,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2020-11-28 03:01:52,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2020-11-28 03:01:52,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 287 transitions. [2020-11-28 03:01:52,273 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 287 transitions. Word has length 17 [2020-11-28 03:01:52,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:01:52,273 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 287 transitions. [2020-11-28 03:01:52,273 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 03:01:52,273 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 287 transitions. [2020-11-28 03:01:52,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-28 03:01:52,274 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:01:52,274 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:01:52,275 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-28 03:01:52,275 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:01:52,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:01:52,276 INFO L82 PathProgramCache]: Analyzing trace with hash 890654144, now seen corresponding path program 1 times [2020-11-28 03:01:52,276 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:01:52,276 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610624031] [2020-11-28 03:01:52,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:01:52,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:01:52,369 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:01:52,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:01:52,463 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:01:52,526 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:01:52,526 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-28 03:01:52,527 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-28 03:01:52,528 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-11-28 03:01:52,551 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1260] [1260] L3-->L865: Formula: (let ((.cse7 (= (mod ~x$w_buff0_used~0_In1954723863 256) 0)) (.cse8 (= (mod ~x$r_buff0_thd0~0_In1954723863 256) 0)) (.cse10 (= (mod ~x$r_buff1_thd0~0_In1954723863 256) 0)) (.cse9 (= (mod ~x$w_buff1_used~0_In1954723863 256) 0))) (let ((.cse4 (or .cse10 .cse9)) (.cse5 (not .cse10)) (.cse6 (not .cse9)) (.cse3 (or .cse7 .cse8)) (.cse1 (not .cse8)) (.cse2 (not .cse7))) (and (= ~x$r_buff0_thd0~0_In1954723863 ~x$r_buff0_thd0~0_Out1954723863) (= ~x$r_buff1_thd0~0_Out1954723863 ~x$r_buff1_thd0~0_In1954723863) (let ((.cse0 (select |#memory_int_In1954723863| |~#x~0.base_In1954723863|))) (or (and (= (store |#memory_int_In1954723863| |~#x~0.base_In1954723863| (store .cse0 |~#x~0.offset_In1954723863| ~x$w_buff0~0_In1954723863)) |#memory_int_Out1954723863|) .cse1 .cse2) (and .cse3 (or (and .cse4 (= (store |#memory_int_In1954723863| |~#x~0.base_In1954723863| (store .cse0 |~#x~0.offset_In1954723863| (select .cse0 |~#x~0.offset_In1954723863|))) |#memory_int_Out1954723863|)) (and .cse5 .cse6 (= |#memory_int_Out1954723863| (store |#memory_int_In1954723863| |~#x~0.base_In1954723863| (store .cse0 |~#x~0.offset_In1954723863| ~x$w_buff1~0_In1954723863)))))))) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out1954723863 0)) (or (and .cse4 (= ~x$w_buff1_used~0_In1954723863 ~x$w_buff1_used~0_Out1954723863)) (and .cse5 .cse6 (= ~x$w_buff1_used~0_Out1954723863 0))) (= ULTIMATE.start_assume_abort_if_not_~cond_Out1954723863 |ULTIMATE.start_assume_abort_if_not_#in~cond_In1954723863|) (or (and .cse3 (= ~x$w_buff0_used~0_Out1954723863 ~x$w_buff0_used~0_In1954723863)) (and .cse1 .cse2 (= ~x$w_buff0_used~0_Out1954723863 0)))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In1954723863, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1954723863, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1954723863|, ~#x~0.offset=|~#x~0.offset_In1954723863|, ~x$w_buff1~0=~x$w_buff1~0_In1954723863, #memory_int=|#memory_int_In1954723863|, ~#x~0.base=|~#x~0.base_In1954723863|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1954723863, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1954723863, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1954723863} OutVars{~x$w_buff0~0=~x$w_buff0~0_In1954723863, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out1954723863, ~#x~0.offset=|~#x~0.offset_In1954723863|, ~x$w_buff1~0=~x$w_buff1~0_In1954723863, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out1954723863, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out1954723863, ULTIMATE.start_main_#t~ite75=|ULTIMATE.start_main_#t~ite75_Out1954723863|, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out1954723863, ULTIMATE.start_main_#t~ite73=|ULTIMATE.start_main_#t~ite73_Out1954723863|, ULTIMATE.start_main_#t~ite74=|ULTIMATE.start_main_#t~ite74_Out1954723863|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1954723863|, ULTIMATE.start_main_#t~ite71=|ULTIMATE.start_main_#t~ite71_Out1954723863|, ULTIMATE.start_main_#t~ite72=|ULTIMATE.start_main_#t~ite72_Out1954723863|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out1954723863, ULTIMATE.start_main_#t~ite70=|ULTIMATE.start_main_#t~ite70_Out1954723863|, #memory_int=|#memory_int_Out1954723863|, ~#x~0.base=|~#x~0.base_In1954723863|, ULTIMATE.start_main_#t~mem69=|ULTIMATE.start_main_#t~mem69_Out1954723863|} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite75, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite73, ULTIMATE.start_main_#t~ite74, ULTIMATE.start_main_#t~ite71, ULTIMATE.start_main_#t~ite72, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite70, #memory_int, ULTIMATE.start_main_#t~mem69] because there is no mapped edge [2020-11-28 03:01:52,556 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 03:01:52,556 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:01:52,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 03:01:52,557 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:01:52,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 03:01:52,557 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:01:52,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 03:01:52,558 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:01:52,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 03:01:52,558 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:01:52,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 03:01:52,558 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:01:52,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 03:01:52,559 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:01:52,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 03:01:52,559 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:01:52,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 03:01:52,560 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:01:52,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 03:01:52,560 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:01:52,562 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 03:01:52,562 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:01:52,562 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 03:01:52,562 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:01:52,563 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 03:01:52,563 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:01:52,563 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 03:01:52,563 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:01:52,563 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 03:01:52,564 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:01:52,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 03:01:52,564 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:01:52,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 03:01:52,564 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:01:52,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 03:01:52,565 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:01:52,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 03:01:52,565 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:01:52,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 03:01:52,565 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:01:52,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 03:01:52,566 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:01:52,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 03:01:52,566 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:01:52,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 03:01:52,566 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:01:52,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 03:01:52,567 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:01:52,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 03:01:52,568 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:01:52,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 03:01:52,568 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:01:52,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 03:01:52,569 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:01:52,569 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 03:01:52,569 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:01:52,569 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 03:01:52,569 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:01:52,569 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 03:01:52,570 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:01:52,601 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 03:01:52,601 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:01:52,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:01:52 BasicIcfg [2020-11-28 03:01:52,759 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-28 03:01:52,759 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-28 03:01:52,760 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-28 03:01:52,760 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-28 03:01:52,761 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:01:31" (3/4) ... [2020-11-28 03:01:52,770 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-28 03:01:52,790 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1260] [1260] L3-->L865: Formula: (let ((.cse7 (= (mod ~x$w_buff0_used~0_In1954723863 256) 0)) (.cse8 (= (mod ~x$r_buff0_thd0~0_In1954723863 256) 0)) (.cse10 (= (mod ~x$r_buff1_thd0~0_In1954723863 256) 0)) (.cse9 (= (mod ~x$w_buff1_used~0_In1954723863 256) 0))) (let ((.cse4 (or .cse10 .cse9)) (.cse5 (not .cse10)) (.cse6 (not .cse9)) (.cse3 (or .cse7 .cse8)) (.cse1 (not .cse8)) (.cse2 (not .cse7))) (and (= ~x$r_buff0_thd0~0_In1954723863 ~x$r_buff0_thd0~0_Out1954723863) (= ~x$r_buff1_thd0~0_Out1954723863 ~x$r_buff1_thd0~0_In1954723863) (let ((.cse0 (select |#memory_int_In1954723863| |~#x~0.base_In1954723863|))) (or (and (= (store |#memory_int_In1954723863| |~#x~0.base_In1954723863| (store .cse0 |~#x~0.offset_In1954723863| ~x$w_buff0~0_In1954723863)) |#memory_int_Out1954723863|) .cse1 .cse2) (and .cse3 (or (and .cse4 (= (store |#memory_int_In1954723863| |~#x~0.base_In1954723863| (store .cse0 |~#x~0.offset_In1954723863| (select .cse0 |~#x~0.offset_In1954723863|))) |#memory_int_Out1954723863|)) (and .cse5 .cse6 (= |#memory_int_Out1954723863| (store |#memory_int_In1954723863| |~#x~0.base_In1954723863| (store .cse0 |~#x~0.offset_In1954723863| ~x$w_buff1~0_In1954723863)))))))) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out1954723863 0)) (or (and .cse4 (= ~x$w_buff1_used~0_In1954723863 ~x$w_buff1_used~0_Out1954723863)) (and .cse5 .cse6 (= ~x$w_buff1_used~0_Out1954723863 0))) (= ULTIMATE.start_assume_abort_if_not_~cond_Out1954723863 |ULTIMATE.start_assume_abort_if_not_#in~cond_In1954723863|) (or (and .cse3 (= ~x$w_buff0_used~0_Out1954723863 ~x$w_buff0_used~0_In1954723863)) (and .cse1 .cse2 (= ~x$w_buff0_used~0_Out1954723863 0)))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In1954723863, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1954723863, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1954723863|, ~#x~0.offset=|~#x~0.offset_In1954723863|, ~x$w_buff1~0=~x$w_buff1~0_In1954723863, #memory_int=|#memory_int_In1954723863|, ~#x~0.base=|~#x~0.base_In1954723863|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1954723863, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1954723863, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1954723863} OutVars{~x$w_buff0~0=~x$w_buff0~0_In1954723863, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out1954723863, ~#x~0.offset=|~#x~0.offset_In1954723863|, ~x$w_buff1~0=~x$w_buff1~0_In1954723863, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out1954723863, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out1954723863, ULTIMATE.start_main_#t~ite75=|ULTIMATE.start_main_#t~ite75_Out1954723863|, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out1954723863, ULTIMATE.start_main_#t~ite73=|ULTIMATE.start_main_#t~ite73_Out1954723863|, ULTIMATE.start_main_#t~ite74=|ULTIMATE.start_main_#t~ite74_Out1954723863|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1954723863|, ULTIMATE.start_main_#t~ite71=|ULTIMATE.start_main_#t~ite71_Out1954723863|, ULTIMATE.start_main_#t~ite72=|ULTIMATE.start_main_#t~ite72_Out1954723863|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out1954723863, ULTIMATE.start_main_#t~ite70=|ULTIMATE.start_main_#t~ite70_Out1954723863|, #memory_int=|#memory_int_Out1954723863|, ~#x~0.base=|~#x~0.base_In1954723863|, ULTIMATE.start_main_#t~mem69=|ULTIMATE.start_main_#t~mem69_Out1954723863|} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite75, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite73, ULTIMATE.start_main_#t~ite74, ULTIMATE.start_main_#t~ite71, ULTIMATE.start_main_#t~ite72, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite70, #memory_int, ULTIMATE.start_main_#t~mem69] because there is no mapped edge [2020-11-28 03:01:52,794 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 03:01:52,794 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:01:52,795 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 03:01:52,795 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:01:52,795 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 03:01:52,795 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:01:52,795 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 03:01:52,795 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:01:52,795 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 03:01:52,796 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:01:52,796 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 03:01:52,796 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:01:52,796 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 03:01:52,796 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:01:52,796 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 03:01:52,797 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:01:52,797 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 03:01:52,797 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:01:52,797 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 03:01:52,797 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:01:52,798 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 03:01:52,798 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:01:52,798 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 03:01:52,798 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:01:52,798 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 03:01:52,799 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:01:52,799 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 03:01:52,799 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:01:52,799 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 03:01:52,799 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:01:52,799 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 03:01:52,799 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:01:52,800 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 03:01:52,800 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:01:52,800 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 03:01:52,800 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:01:52,800 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 03:01:52,800 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:01:52,801 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 03:01:52,801 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:01:52,801 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 03:01:52,801 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:01:52,801 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 03:01:52,801 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:01:52,801 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 03:01:52,802 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:01:52,802 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 03:01:52,802 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:01:52,803 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 03:01:52,803 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:01:52,803 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 03:01:52,804 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:01:52,804 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 03:01:52,804 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:01:52,804 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 03:01:52,804 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:01:52,804 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 03:01:52,804 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:01:52,805 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 03:01:52,805 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:01:52,805 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 03:01:52,805 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:01:52,955 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_9f8b7935-07e5-4ba9-8a8a-c9ae10e8514f/bin/uautomizer/witness.graphml [2020-11-28 03:01:52,955 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-28 03:01:52,957 INFO L168 Benchmark]: Toolchain (without parser) took 25863.32 ms. Allocated memory was 107.0 MB in the beginning and 369.1 MB in the end (delta: 262.1 MB). Free memory was 78.5 MB in the beginning and 206.0 MB in the end (delta: -127.5 MB). Peak memory consumption was 134.2 MB. Max. memory is 16.1 GB. [2020-11-28 03:01:52,957 INFO L168 Benchmark]: CDTParser took 0.38 ms. Allocated memory is still 107.0 MB. Free memory is still 64.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 03:01:52,957 INFO L168 Benchmark]: CACSL2BoogieTranslator took 725.91 ms. Allocated memory is still 107.0 MB. Free memory was 78.3 MB in the beginning and 58.6 MB in the end (delta: 19.7 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2020-11-28 03:01:52,958 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.56 ms. Allocated memory is still 107.0 MB. Free memory was 58.6 MB in the beginning and 56.3 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:01:52,958 INFO L168 Benchmark]: Boogie Preprocessor took 92.64 ms. Allocated memory is still 107.0 MB. Free memory was 56.3 MB in the beginning and 53.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:01:52,959 INFO L168 Benchmark]: RCFGBuilder took 3797.39 ms. Allocated memory was 107.0 MB in the beginning and 163.6 MB in the end (delta: 56.6 MB). Free memory was 53.5 MB in the beginning and 122.4 MB in the end (delta: -69.0 MB). Peak memory consumption was 52.3 MB. Max. memory is 16.1 GB. [2020-11-28 03:01:52,959 INFO L168 Benchmark]: TraceAbstraction took 20971.80 ms. Allocated memory was 163.6 MB in the beginning and 369.1 MB in the end (delta: 205.5 MB). Free memory was 122.4 MB in the beginning and 229.1 MB in the end (delta: -106.7 MB). Peak memory consumption was 98.9 MB. Max. memory is 16.1 GB. [2020-11-28 03:01:52,960 INFO L168 Benchmark]: Witness Printer took 196.04 ms. Allocated memory is still 369.1 MB. Free memory was 229.1 MB in the beginning and 206.0 MB in the end (delta: 23.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:01:52,962 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.38 ms. Allocated memory is still 107.0 MB. Free memory is still 64.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 725.91 ms. Allocated memory is still 107.0 MB. Free memory was 78.3 MB in the beginning and 58.6 MB in the end (delta: 19.7 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 69.56 ms. Allocated memory is still 107.0 MB. Free memory was 58.6 MB in the beginning and 56.3 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 92.64 ms. Allocated memory is still 107.0 MB. Free memory was 56.3 MB in the beginning and 53.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3797.39 ms. Allocated memory was 107.0 MB in the beginning and 163.6 MB in the end (delta: 56.6 MB). Free memory was 53.5 MB in the beginning and 122.4 MB in the end (delta: -69.0 MB). Peak memory consumption was 52.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 20971.80 ms. Allocated memory was 163.6 MB in the beginning and 369.1 MB in the end (delta: 205.5 MB). Free memory was 122.4 MB in the beginning and 229.1 MB in the end (delta: -106.7 MB). Peak memory consumption was 98.9 MB. Max. memory is 16.1 GB. * Witness Printer took 196.04 ms. Allocated memory is still 369.1 MB. Free memory was 229.1 MB in the beginning and 206.0 MB in the end (delta: 23.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1003 VarBasedMoverChecksPositive, 71 VarBasedMoverChecksNegative, 12 SemBasedMoverChecksPositive, 59 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 3.2s, 94 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 12.9s, 125 PlacesBefore, 33 PlacesAfterwards, 118 TransitionsBefore, 23 TransitionsAfterwards, 1570 CoEnabledTransitionPairs, 7 FixpointIterations, 55 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 3 ChoiceCompositions, 107 TotalNumberOfCompositions, 3765 MoverChecksTotal - CounterExampleResult [Line: 18]: 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_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p1_EAX = 0; [L734] 0 int __unbuffered_p1_EBX = 0; [L735] 0 _Bool main$tmp_guard0; [L736] 0 _Bool main$tmp_guard1; [L738] 0 int x = 0; [L739] 0 _Bool x$flush_delayed; [L740] 0 int x$mem_tmp; [L741] 0 _Bool x$r_buff0_thd0; [L742] 0 _Bool x$r_buff0_thd1; [L743] 0 _Bool x$r_buff0_thd2; [L744] 0 _Bool x$r_buff0_thd3; [L745] 0 _Bool x$r_buff1_thd0; [L746] 0 _Bool x$r_buff1_thd1; [L747] 0 _Bool x$r_buff1_thd2; [L748] 0 _Bool x$r_buff1_thd3; [L749] 0 _Bool x$read_delayed; [L750] 0 int *x$read_delayed_var; [L751] 0 int x$w_buff0; [L752] 0 _Bool x$w_buff0_used; [L753] 0 int x$w_buff1; [L754] 0 _Bool x$w_buff1_used; [L756] 0 int y = 0; [L757] 0 _Bool weak$$choice0; [L758] 0 _Bool weak$$choice1; [L759] 0 _Bool weak$$choice2; [L849] 0 pthread_t t1749; [L850] FCALL, FORK 0 pthread_create(&t1749, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={7:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L851] 0 pthread_t t1750; [L763] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 1 x$flush_delayed = weak$$choice2 [L766] EXPR 1 \read(x) [L766] 1 x$mem_tmp = x [L767] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L767] EXPR 1 \read(x) [L767] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L767] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L768] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L769] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L769] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L769] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L769] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L770] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L770] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L771] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L771] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L771] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L771] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L772] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L773] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L774] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L775] 1 __unbuffered_p0_EAX$read_delayed_var = &x [L776] EXPR 1 \read(x) [L776] 1 __unbuffered_p0_EAX = x [L777] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L777] 1 x = x$flush_delayed ? x$mem_tmp : x [L778] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=0, weak$$choice2=0, x={7:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L781] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=0, weak$$choice2=0, x={7:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L786] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L788] 1 return 0; [L852] FCALL, FORK 0 pthread_create(&t1750, ((void *)0), P1, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=0, weak$$choice2=0, x={7:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L793] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=0, weak$$choice2=0, x={7:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L796] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=0, weak$$choice2=0, x={7:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L800] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L801] 2 x$flush_delayed = weak$$choice2 [L802] EXPR 2 \read(x) [L802] 2 x$mem_tmp = x [L803] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L803] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1 [L803] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L803] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L804] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L804] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L805] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L805] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1) [L805] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L805] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L806] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L806] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L807] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L807] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L808] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2) [L808] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L808] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2) [L808] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L808] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L809] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L809] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L809] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0 [L809] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L809] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L809] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L810] EXPR 2 \read(x) [L810] 2 __unbuffered_p1_EBX = x [L811] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L811] 2 x = x$flush_delayed ? x$mem_tmp : x [L812] 2 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=0, x={7:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L853] 0 pthread_t t1751; [L854] FCALL, FORK 0 pthread_create(&t1751, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=0, x={7:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L824] 3 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=0, x={7:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L836] 3 return 0; [L817] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L819] 2 return 0; [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L867] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L868] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L868] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L869] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L19] COND TRUE 0 !expression [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "rfi009_rmo.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=255, weak$$choice2=0, x={7:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 116 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 20.5s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 13.0s, HoareTripleCheckerStatistics: 226 SDtfs, 273 SDslu, 506 SDs, 0 SdLazy, 719 SolverSat, 108 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=450occurred 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.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 569 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 169 NumberOfCodeBlocks, 169 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 139 ConstructedInterpolants, 0 QuantifiedInterpolants, 36626 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...