./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix034_pso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 96f16385 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix034_pso.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 e8b567b15c21a96721610ad8ce722cad8c2b3af8 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-96f1638 [2020-12-02 11:55:14,741 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-02 11:55:14,744 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-02 11:55:14,783 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-02 11:55:14,783 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-02 11:55:14,785 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-02 11:55:14,787 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-02 11:55:14,789 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-02 11:55:14,791 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-02 11:55:14,793 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-02 11:55:14,795 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-02 11:55:14,796 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-02 11:55:14,797 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-02 11:55:14,798 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-02 11:55:14,799 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-02 11:55:14,801 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-02 11:55:14,802 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-02 11:55:14,804 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-02 11:55:14,806 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-02 11:55:14,808 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-02 11:55:14,810 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-02 11:55:14,814 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-02 11:55:14,816 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-02 11:55:14,818 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-02 11:55:14,822 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-02 11:55:14,829 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-02 11:55:14,829 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-02 11:55:14,834 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-02 11:55:14,834 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-02 11:55:14,836 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-02 11:55:14,836 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-02 11:55:14,837 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-02 11:55:14,839 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-02 11:55:14,840 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-02 11:55:14,842 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-02 11:55:14,846 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-02 11:55:14,847 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-02 11:55:14,849 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-02 11:55:14,849 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-02 11:55:14,851 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-02 11:55:14,852 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-02 11:55:14,853 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-12-02 11:55:14,903 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-02 11:55:14,904 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-02 11:55:14,908 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-02 11:55:14,908 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-02 11:55:14,909 INFO L138 SettingsManager]: * Use SBE=true [2020-12-02 11:55:14,909 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-02 11:55:14,909 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-02 11:55:14,909 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-02 11:55:14,910 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-02 11:55:14,910 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-02 11:55:14,911 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-02 11:55:14,912 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-02 11:55:14,912 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-02 11:55:14,912 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-02 11:55:14,912 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-02 11:55:14,913 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-02 11:55:14,913 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-02 11:55:14,913 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-02 11:55:14,914 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-02 11:55:14,914 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-02 11:55:14,914 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-02 11:55:14,914 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-02 11:55:14,915 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-02 11:55:14,915 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-02 11:55:14,915 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-02 11:55:14,916 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-02 11:55:14,916 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-02 11:55:14,916 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-02 11:55:14,916 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-02 11:55:14,917 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> e8b567b15c21a96721610ad8ce722cad8c2b3af8 [2020-12-02 11:55:15,429 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-02 11:55:15,470 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-02 11:55:15,474 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-02 11:55:15,476 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-02 11:55:15,477 INFO L275 PluginConnector]: CDTParser initialized [2020-12-02 11:55:15,479 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix034_pso.oepc.i [2020-12-02 11:55:15,569 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53345afd1/980c8ea19eba4c75985dcb4228596dcd/FLAG72932f299 [2020-12-02 11:55:16,292 INFO L306 CDTParser]: Found 1 translation units. [2020-12-02 11:55:16,293 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix034_pso.oepc.i [2020-12-02 11:55:16,311 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53345afd1/980c8ea19eba4c75985dcb4228596dcd/FLAG72932f299 [2020-12-02 11:55:16,533 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53345afd1/980c8ea19eba4c75985dcb4228596dcd [2020-12-02 11:55:16,536 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-02 11:55:16,539 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-02 11:55:16,540 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-02 11:55:16,541 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-02 11:55:16,546 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-02 11:55:16,547 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:55:16" (1/1) ... [2020-12-02 11:55:16,552 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dbd2dd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:55:16, skipping insertion in model container [2020-12-02 11:55:16,553 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:55:16" (1/1) ... [2020-12-02 11:55:16,562 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-02 11:55:16,655 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-02 11:55:16,830 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix034_pso.oepc.i[949,962] [2020-12-02 11:55:17,165 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-02 11:55:17,181 INFO L203 MainTranslator]: Completed pre-run [2020-12-02 11:55:17,209 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix034_pso.oepc.i[949,962] [2020-12-02 11:55:17,256 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-02 11:55:17,359 INFO L208 MainTranslator]: Completed translation [2020-12-02 11:55:17,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:55:17 WrapperNode [2020-12-02 11:55:17,361 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-02 11:55:17,364 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-02 11:55:17,365 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-02 11:55:17,365 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-02 11:55:17,375 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:55:17" (1/1) ... [2020-12-02 11:55:17,405 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:55:17" (1/1) ... [2020-12-02 11:55:17,436 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-02 11:55:17,437 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-02 11:55:17,437 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-02 11:55:17,437 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-02 11:55:17,449 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:55:17" (1/1) ... [2020-12-02 11:55:17,450 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:55:17" (1/1) ... [2020-12-02 11:55:17,455 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:55:17" (1/1) ... [2020-12-02 11:55:17,456 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:55:17" (1/1) ... [2020-12-02 11:55:17,469 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:55:17" (1/1) ... [2020-12-02 11:55:17,474 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:55:17" (1/1) ... [2020-12-02 11:55:17,479 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:55:17" (1/1) ... [2020-12-02 11:55:17,485 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-02 11:55:17,486 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-02 11:55:17,486 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-02 11:55:17,486 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-02 11:55:17,487 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:55:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-02 11:55:17,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-02 11:55:17,622 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-12-02 11:55:17,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-02 11:55:17,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-02 11:55:17,624 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-12-02 11:55:17,624 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-12-02 11:55:17,624 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-12-02 11:55:17,625 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-12-02 11:55:17,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-02 11:55:17,625 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-12-02 11:55:17,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-02 11:55:17,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-02 11:55:17,628 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-12-02 11:55:19,683 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-02 11:55:19,684 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-12-02 11:55:19,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:55:19 BoogieIcfgContainer [2020-12-02 11:55:19,688 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-02 11:55:19,691 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-02 11:55:19,692 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-02 11:55:19,696 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-02 11:55:19,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 11:55:16" (1/3) ... [2020-12-02 11:55:19,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@751bb9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:55:19, skipping insertion in model container [2020-12-02 11:55:19,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:55:17" (2/3) ... [2020-12-02 11:55:19,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@751bb9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:55:19, skipping insertion in model container [2020-12-02 11:55:19,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:55:19" (3/3) ... [2020-12-02 11:55:19,701 INFO L111 eAbstractionObserver]: Analyzing ICFG mix034_pso.oepc.i [2020-12-02 11:55:19,719 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-02 11:55:19,719 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-02 11:55:19,724 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-02 11:55:19,725 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-02 11:55:19,767 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,768 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,768 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,769 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,769 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,769 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,769 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,770 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,770 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,770 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,771 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,771 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,771 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,772 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,772 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,772 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,773 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,773 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,773 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,773 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,774 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,774 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,774 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,775 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,775 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,775 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,776 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,776 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,776 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,776 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,777 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,778 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,778 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,778 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,779 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,779 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,779 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,780 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,780 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,780 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,780 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,780 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,781 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,781 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,781 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,782 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,782 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,782 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,782 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,782 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,783 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,783 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,783 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,783 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,784 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,784 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,784 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,784 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,785 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,785 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,785 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,785 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,785 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,786 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,786 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,786 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,786 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,786 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,787 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,787 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,787 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,787 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,788 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,788 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,788 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,788 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,788 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,789 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,789 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,789 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,791 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,791 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,794 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,794 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,794 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,794 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,795 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,795 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,795 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,795 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,796 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,796 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,796 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,796 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,796 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,797 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,797 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,797 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,797 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,799 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,799 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,799 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,799 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,799 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,800 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,802 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,802 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,802 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,802 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,803 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,803 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,803 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,804 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,804 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,804 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,804 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,805 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,805 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,805 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,806 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,807 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,807 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,807 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,810 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,811 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,811 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,811 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,812 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,812 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,812 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,812 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,812 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,813 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,813 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,813 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,815 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,816 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,816 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,816 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,816 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,817 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,817 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,817 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,817 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,819 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,821 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,821 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,821 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,821 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,822 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,822 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,822 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,822 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,822 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,823 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,823 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 11:55:19,827 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-12-02 11:55:19,840 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-12-02 11:55:19,865 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-02 11:55:19,866 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-02 11:55:19,866 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-02 11:55:19,866 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-02 11:55:19,866 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-02 11:55:19,867 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-02 11:55:19,867 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-02 11:55:19,867 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-02 11:55:19,893 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-12-02 11:55:19,896 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 85 transitions, 180 flow [2020-12-02 11:55:19,900 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 85 transitions, 180 flow [2020-12-02 11:55:19,903 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 90 places, 85 transitions, 180 flow [2020-12-02 11:55:19,973 INFO L129 PetriNetUnfolder]: 2/83 cut-off events. [2020-12-02 11:55:19,974 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-12-02 11:55:19,982 INFO L84 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 83 events. 2/83 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2020-12-02 11:55:19,987 INFO L116 LiptonReduction]: Number of co-enabled transitions 1058 [2020-12-02 11:55:20,198 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:20,199 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:55:20,201 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:20,202 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:55:20,211 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:20,211 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:55:20,225 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:20,225 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:55:20,313 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:20,314 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:55:20,319 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:20,320 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:55:20,325 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:20,325 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:55:20,330 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:20,331 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:55:20,686 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2020-12-02 11:55:20,687 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:55:21,349 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:21,350 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:55:21,351 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:21,351 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:55:21,354 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:21,355 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:55:21,358 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:21,358 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:55:21,384 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:21,385 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:55:21,386 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:21,386 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:55:21,389 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:21,389 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:55:21,392 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:21,393 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:55:21,587 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:21,589 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:55:21,591 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:21,591 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:55:21,598 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:21,599 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:55:21,604 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:21,605 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:55:21,632 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:21,633 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:55:21,634 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:21,634 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:55:21,637 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:21,638 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:55:21,641 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:21,642 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:55:22,223 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2020-12-02 11:55:22,224 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:55:22,297 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:22,297 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:55:22,303 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-02 11:55:22,303 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 11:55:22,305 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-02 11:55:22,305 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 11:55:22,307 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-02 11:55:22,308 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 11:55:22,310 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-02 11:55:22,310 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:55:22,313 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-02 11:55:22,313 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:55:22,315 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-02 11:55:22,315 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:55:22,373 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-02 11:55:22,374 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-02 11:55:22,377 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2020-12-02 11:55:22,377 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:55:22,502 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-02 11:55:22,502 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-02 11:55:22,506 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2020-12-02 11:55:22,506 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:55:22,566 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:22,567 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:55:22,569 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-02 11:55:22,570 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 11:55:22,571 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-02 11:55:22,571 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 11:55:22,589 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-02 11:55:22,590 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 11:55:22,593 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-02 11:55:22,594 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:55:22,598 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-02 11:55:22,599 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:55:22,601 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-02 11:55:22,601 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:55:22,956 WARN L197 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-12-02 11:55:23,075 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2020-12-02 11:55:23,604 WARN L197 SmtUtils]: Spent 526.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83 [2020-12-02 11:55:23,812 WARN L197 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-12-02 11:55:23,952 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:23,953 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:55:23,954 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:23,955 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:55:23,956 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:23,957 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:55:23,959 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:23,959 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:55:23,979 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:23,980 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:55:23,980 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:23,981 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:55:23,983 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:23,983 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:55:23,986 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:23,986 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:55:24,327 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:24,328 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:55:24,329 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:24,329 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:55:24,331 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:24,332 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:55:24,334 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:24,334 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:55:24,366 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:24,367 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:55:24,368 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:24,368 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:55:24,370 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:24,371 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:55:24,373 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:24,373 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:55:24,414 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:24,414 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:55:24,415 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:24,416 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:55:24,417 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:24,418 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:55:24,420 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:24,420 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:55:24,440 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:24,440 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:55:24,441 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:24,442 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:55:24,443 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:24,444 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:55:24,446 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:24,446 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:55:24,674 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:24,675 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:55:24,676 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:24,676 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:55:24,678 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:24,679 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:55:24,680 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:24,681 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:55:24,701 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:24,702 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:55:24,703 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:24,703 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:55:24,705 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:24,706 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:55:24,708 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:24,708 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:55:24,959 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:24,960 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:55:24,964 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-02 11:55:24,964 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 11:55:24,966 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-02 11:55:24,966 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 11:55:24,971 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-02 11:55:24,972 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 11:55:24,975 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-02 11:55:24,975 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:55:24,977 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-02 11:55:24,978 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:55:24,979 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-02 11:55:24,979 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:55:25,042 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term [2020-12-02 11:55:25,042 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-02 11:55:25,047 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-02 11:55:25,047 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:55:25,076 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:25,076 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:55:25,077 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:25,078 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:55:25,079 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:25,080 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:55:25,081 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:25,082 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:55:25,102 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:25,102 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:55:25,103 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:25,103 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:55:25,105 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:25,106 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:55:25,108 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:25,108 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:55:25,245 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term [2020-12-02 11:55:25,246 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-02 11:55:25,248 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-02 11:55:25,249 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:55:25,303 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:25,303 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:55:25,305 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-02 11:55:25,306 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 11:55:25,307 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-02 11:55:25,308 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 11:55:25,309 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-02 11:55:25,310 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 11:55:25,330 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-02 11:55:25,331 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:55:25,333 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-02 11:55:25,333 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:55:25,335 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-02 11:55:25,335 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:55:25,371 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:25,372 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:55:25,373 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:25,374 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:55:25,375 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:25,376 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:55:25,378 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:25,379 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:55:25,402 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:25,403 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:55:25,404 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:25,404 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:55:25,406 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:25,407 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:55:25,409 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:25,410 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:55:25,442 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:25,443 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:55:25,444 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:25,444 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:55:25,446 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:25,447 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:55:25,450 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:25,450 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 11:55:25,471 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:25,472 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:55:25,473 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:25,474 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 11:55:25,476 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:25,477 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:55:25,479 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 11:55:25,479 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 11:55:25,701 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2020-12-02 11:55:25,808 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2020-12-02 11:55:26,699 WARN L197 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 107 [2020-12-02 11:55:26,899 WARN L197 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2020-12-02 11:55:27,345 WARN L197 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 107 [2020-12-02 11:55:27,551 WARN L197 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2020-12-02 11:55:27,783 WARN L197 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2020-12-02 11:55:28,004 WARN L197 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-12-02 11:55:28,221 WARN L197 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2020-12-02 11:55:28,424 WARN L197 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-12-02 11:55:28,427 INFO L131 LiptonReduction]: Checked pairs total: 2777 [2020-12-02 11:55:28,427 INFO L133 LiptonReduction]: Total number of compositions: 76 [2020-12-02 11:55:28,435 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 27 places, 20 transitions, 50 flow [2020-12-02 11:55:28,454 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 194 states. [2020-12-02 11:55:28,456 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states. [2020-12-02 11:55:28,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-12-02 11:55:28,462 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:55:28,463 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-12-02 11:55:28,464 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 11:55:28,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:55:28,470 INFO L82 PathProgramCache]: Analyzing trace with hash 930954, now seen corresponding path program 1 times [2020-12-02 11:55:28,480 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:55:28,481 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057215162] [2020-12-02 11:55:28,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:55:28,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:55:28,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:55:28,784 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057215162] [2020-12-02 11:55:28,785 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:55:28,787 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-02 11:55:28,788 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516780631] [2020-12-02 11:55:28,792 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-02 11:55:28,794 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:55:28,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-02 11:55:28,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-02 11:55:28,816 INFO L87 Difference]: Start difference. First operand 194 states. Second operand 3 states. [2020-12-02 11:55:28,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:55:28,896 INFO L93 Difference]: Finished difference Result 162 states and 385 transitions. [2020-12-02 11:55:28,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-02 11:55:28,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-12-02 11:55:28,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:55:28,919 INFO L225 Difference]: With dead ends: 162 [2020-12-02 11:55:28,919 INFO L226 Difference]: Without dead ends: 132 [2020-12-02 11:55:28,921 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-02 11:55:28,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-12-02 11:55:28,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2020-12-02 11:55:28,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-12-02 11:55:29,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 306 transitions. [2020-12-02 11:55:29,005 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 306 transitions. Word has length 3 [2020-12-02 11:55:29,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:55:29,006 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 306 transitions. [2020-12-02 11:55:29,006 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-02 11:55:29,007 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 306 transitions. [2020-12-02 11:55:29,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-12-02 11:55:29,007 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:55:29,008 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:55:29,008 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-02 11:55:29,008 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 11:55:29,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:55:29,012 INFO L82 PathProgramCache]: Analyzing trace with hash 803533616, now seen corresponding path program 1 times [2020-12-02 11:55:29,012 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:55:29,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254015545] [2020-12-02 11:55:29,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:55:29,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:55:29,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:55:29,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254015545] [2020-12-02 11:55:29,114 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:55:29,115 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-02 11:55:29,115 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785040935] [2020-12-02 11:55:29,116 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-02 11:55:29,117 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:55:29,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-02 11:55:29,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-02 11:55:29,118 INFO L87 Difference]: Start difference. First operand 132 states and 306 transitions. Second operand 3 states. [2020-12-02 11:55:29,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:55:29,128 INFO L93 Difference]: Finished difference Result 122 states and 278 transitions. [2020-12-02 11:55:29,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-02 11:55:29,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-12-02 11:55:29,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:55:29,130 INFO L225 Difference]: With dead ends: 122 [2020-12-02 11:55:29,131 INFO L226 Difference]: Without dead ends: 122 [2020-12-02 11:55:29,132 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-02 11:55:29,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-12-02 11:55:29,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2020-12-02 11:55:29,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-12-02 11:55:29,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 278 transitions. [2020-12-02 11:55:29,142 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 278 transitions. Word has length 7 [2020-12-02 11:55:29,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:55:29,142 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 278 transitions. [2020-12-02 11:55:29,143 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-02 11:55:29,143 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 278 transitions. [2020-12-02 11:55:29,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-02 11:55:29,144 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:55:29,144 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:55:29,144 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-02 11:55:29,145 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 11:55:29,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:55:29,146 INFO L82 PathProgramCache]: Analyzing trace with hash -898325663, now seen corresponding path program 1 times [2020-12-02 11:55:29,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:55:29,146 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786285940] [2020-12-02 11:55:29,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:55:29,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:55:29,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:55:29,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786285940] [2020-12-02 11:55:29,306 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:55:29,307 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-02 11:55:29,307 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694331457] [2020-12-02 11:55:29,307 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 11:55:29,308 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:55:29,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 11:55:29,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-02 11:55:29,309 INFO L87 Difference]: Start difference. First operand 122 states and 278 transitions. Second operand 4 states. [2020-12-02 11:55:29,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:55:29,359 INFO L93 Difference]: Finished difference Result 100 states and 191 transitions. [2020-12-02 11:55:29,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 11:55:29,360 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-12-02 11:55:29,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:55:29,363 INFO L225 Difference]: With dead ends: 100 [2020-12-02 11:55:29,364 INFO L226 Difference]: Without dead ends: 70 [2020-12-02 11:55:29,365 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-02 11:55:29,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-12-02 11:55:29,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-12-02 11:55:29,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-12-02 11:55:29,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 122 transitions. [2020-12-02 11:55:29,381 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 122 transitions. Word has length 9 [2020-12-02 11:55:29,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:55:29,381 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 122 transitions. [2020-12-02 11:55:29,382 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 11:55:29,382 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 122 transitions. [2020-12-02 11:55:29,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-02 11:55:29,384 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:55:29,384 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:55:29,384 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-02 11:55:29,384 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 11:55:29,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:55:29,386 INFO L82 PathProgramCache]: Analyzing trace with hash 950685943, now seen corresponding path program 1 times [2020-12-02 11:55:29,386 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:55:29,387 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330640979] [2020-12-02 11:55:29,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:55:29,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:55:29,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:55:29,628 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330640979] [2020-12-02 11:55:29,628 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:55:29,628 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-02 11:55:29,628 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242172471] [2020-12-02 11:55:29,629 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-02 11:55:29,629 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:55:29,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-02 11:55:29,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-02 11:55:29,631 INFO L87 Difference]: Start difference. First operand 70 states and 122 transitions. Second operand 5 states. [2020-12-02 11:55:29,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:55:29,700 INFO L93 Difference]: Finished difference Result 55 states and 90 transitions. [2020-12-02 11:55:29,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-02 11:55:29,701 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-12-02 11:55:29,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:55:29,702 INFO L225 Difference]: With dead ends: 55 [2020-12-02 11:55:29,703 INFO L226 Difference]: Without dead ends: 45 [2020-12-02 11:55:29,703 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-02 11:55:29,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-12-02 11:55:29,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-12-02 11:55:29,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-12-02 11:55:29,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 72 transitions. [2020-12-02 11:55:29,710 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 72 transitions. Word has length 12 [2020-12-02 11:55:29,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:55:29,710 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 72 transitions. [2020-12-02 11:55:29,710 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-02 11:55:29,711 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 72 transitions. [2020-12-02 11:55:29,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-02 11:55:29,713 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:55:29,713 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:55:29,713 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-02 11:55:29,714 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 11:55:29,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:55:29,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1800383414, now seen corresponding path program 1 times [2020-12-02 11:55:29,715 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:55:29,715 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126285847] [2020-12-02 11:55:29,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:55:29,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 11:55:30,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 11:55:30,025 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126285847] [2020-12-02 11:55:30,026 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 11:55:30,026 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-02 11:55:30,026 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498453967] [2020-12-02 11:55:30,027 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-02 11:55:30,027 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 11:55:30,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-02 11:55:30,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-02 11:55:30,030 INFO L87 Difference]: Start difference. First operand 45 states and 72 transitions. Second operand 5 states. [2020-12-02 11:55:30,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 11:55:30,163 INFO L93 Difference]: Finished difference Result 66 states and 100 transitions. [2020-12-02 11:55:30,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-02 11:55:30,164 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-12-02 11:55:30,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 11:55:30,165 INFO L225 Difference]: With dead ends: 66 [2020-12-02 11:55:30,165 INFO L226 Difference]: Without dead ends: 48 [2020-12-02 11:55:30,166 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-02 11:55:30,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-12-02 11:55:30,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 35. [2020-12-02 11:55:30,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-12-02 11:55:30,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 52 transitions. [2020-12-02 11:55:30,174 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 52 transitions. Word has length 16 [2020-12-02 11:55:30,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 11:55:30,175 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 52 transitions. [2020-12-02 11:55:30,175 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-02 11:55:30,175 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 52 transitions. [2020-12-02 11:55:30,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-02 11:55:30,177 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 11:55:30,177 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 11:55:30,177 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-02 11:55:30,178 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 11:55:30,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 11:55:30,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1986785970, now seen corresponding path program 2 times [2020-12-02 11:55:30,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 11:55:30,179 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69791549] [2020-12-02 11:55:30,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 11:55:30,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-02 11:55:30,301 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-02 11:55:30,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-02 11:55:30,388 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-02 11:55:30,445 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-02 11:55:30,445 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-02 11:55:30,445 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-02 11:55:30,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 11:55:30 BasicIcfg [2020-12-02 11:55:30,567 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-02 11:55:30,568 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-02 11:55:30,568 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-02 11:55:30,569 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-02 11:55:30,569 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:55:19" (3/4) ... [2020-12-02 11:55:30,572 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-02 11:55:30,670 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-12-02 11:55:30,671 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-02 11:55:30,676 INFO L168 Benchmark]: Toolchain (without parser) took 14137.42 ms. Allocated memory was 50.3 MB in the beginning and 257.9 MB in the end (delta: 207.6 MB). Free memory was 25.9 MB in the beginning and 148.2 MB in the end (delta: -122.4 MB). Peak memory consumption was 86.2 MB. Max. memory is 16.1 GB. [2020-12-02 11:55:30,677 INFO L168 Benchmark]: CDTParser took 0.38 ms. Allocated memory is still 41.9 MB. Free memory is still 21.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-02 11:55:30,678 INFO L168 Benchmark]: CACSL2BoogieTranslator took 822.81 ms. Allocated memory is still 50.3 MB. Free memory was 25.7 MB in the beginning and 25.0 MB in the end (delta: 740.4 kB). Peak memory consumption was 9.1 MB. Max. memory is 16.1 GB. [2020-12-02 11:55:30,678 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.99 ms. Allocated memory is still 50.3 MB. Free memory was 24.8 MB in the beginning and 22.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-02 11:55:30,679 INFO L168 Benchmark]: Boogie Preprocessor took 48.11 ms. Allocated memory is still 50.3 MB. Free memory was 22.6 MB in the beginning and 20.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-02 11:55:30,679 INFO L168 Benchmark]: RCFGBuilder took 2202.18 ms. Allocated memory was 50.3 MB in the beginning and 100.7 MB in the end (delta: 50.3 MB). Free memory was 20.3 MB in the beginning and 57.5 MB in the end (delta: -37.2 MB). Peak memory consumption was 22.7 MB. Max. memory is 16.1 GB. [2020-12-02 11:55:30,682 INFO L168 Benchmark]: TraceAbstraction took 10876.49 ms. Allocated memory was 100.7 MB in the beginning and 257.9 MB in the end (delta: 157.3 MB). Free memory was 57.5 MB in the beginning and 159.8 MB in the end (delta: -102.3 MB). Peak memory consumption was 54.7 MB. Max. memory is 16.1 GB. [2020-12-02 11:55:30,683 INFO L168 Benchmark]: Witness Printer took 103.12 ms. Allocated memory is still 257.9 MB. Free memory was 159.8 MB in the beginning and 148.2 MB in the end (delta: 11.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-12-02 11:55:30,691 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 41.9 MB. Free memory is still 21.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 822.81 ms. Allocated memory is still 50.3 MB. Free memory was 25.7 MB in the beginning and 25.0 MB in the end (delta: 740.4 kB). Peak memory consumption was 9.1 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 71.99 ms. Allocated memory is still 50.3 MB. Free memory was 24.8 MB in the beginning and 22.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 48.11 ms. Allocated memory is still 50.3 MB. Free memory was 22.6 MB in the beginning and 20.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2202.18 ms. Allocated memory was 50.3 MB in the beginning and 100.7 MB in the end (delta: 50.3 MB). Free memory was 20.3 MB in the beginning and 57.5 MB in the end (delta: -37.2 MB). Peak memory consumption was 22.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 10876.49 ms. Allocated memory was 100.7 MB in the beginning and 257.9 MB in the end (delta: 157.3 MB). Free memory was 57.5 MB in the beginning and 159.8 MB in the end (delta: -102.3 MB). Peak memory consumption was 54.7 MB. Max. memory is 16.1 GB. * Witness Printer took 103.12 ms. Allocated memory is still 257.9 MB. Free memory was 159.8 MB in the beginning and 148.2 MB in the end (delta: 11.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 712 VarBasedMoverChecksPositive, 45 VarBasedMoverChecksNegative, 4 SemBasedMoverChecksPositive, 41 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.1s, 64 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.5s, 90 PlacesBefore, 27 PlacesAfterwards, 85 TransitionsBefore, 20 TransitionsAfterwards, 1058 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 76 TotalNumberOfCompositions, 2777 MoverChecksTotal - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p0_EAX = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L720] 0 int y = 0; [L722] 0 int z = 0; [L723] 0 _Bool z$flush_delayed; [L724] 0 int z$mem_tmp; [L725] 0 _Bool z$r_buff0_thd0; [L726] 0 _Bool z$r_buff0_thd1; [L727] 0 _Bool z$r_buff0_thd2; [L728] 0 _Bool z$r_buff1_thd0; [L729] 0 _Bool z$r_buff1_thd1; [L730] 0 _Bool z$r_buff1_thd2; [L731] 0 _Bool z$read_delayed; [L732] 0 int *z$read_delayed_var; [L733] 0 int z$w_buff0; [L734] 0 _Bool z$w_buff0_used; [L735] 0 int z$w_buff1; [L736] 0 _Bool z$w_buff1_used; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L817] 0 pthread_t t901; [L818] FCALL, FORK 0 pthread_create(&t901, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 z$w_buff1 = z$w_buff0 [L743] 1 z$w_buff0 = 1 [L744] 1 z$w_buff1_used = z$w_buff0_used [L745] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L747] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L748] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L749] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] 0 pthread_t t902; [L820] FCALL, FORK 0 pthread_create(&t902, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 y = 1 [L776] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L780] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L781] 2 z$flush_delayed = weak$$choice2 [L782] 2 z$mem_tmp = z [L783] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L783] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L784] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L784] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0) [L784] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L784] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L785] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L785] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1) [L785] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L785] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L786] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L786] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used) [L786] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L786] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L787] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L787] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L787] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L787] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L788] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L788] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2) [L788] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L788] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L789] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L789] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L789] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L789] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] 2 __unbuffered_p1_EBX = z [L791] EXPR 2 z$flush_delayed ? z$mem_tmp : z [L791] 2 z = z$flush_delayed ? z$mem_tmp : z [L792] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L795] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L795] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L795] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L795] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L796] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L796] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L797] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L797] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L798] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L798] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L799] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L799] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 2 return 0; [L822] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L3] COND FALSE 0 !(!cond) [L826] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L826] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L826] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L826] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L827] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L827] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L828] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L828] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L829] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L830] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L833] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 84 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 10.5s, OverallIterations: 6, TraceHistogramMax: 1, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.5s, HoareTripleCheckerStatistics: 97 SDtfs, 73 SDslu, 139 SDs, 0 SdLazy, 78 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=194occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 13 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 63 NumberOfCodeBlocks, 63 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 42 ConstructedInterpolants, 0 QuantifiedInterpolants, 2541 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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...