./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix026_pso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_81c6758b-fcda-4fab-b2ac-affdf2032d55/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_81c6758b-fcda-4fab-b2ac-affdf2032d55/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_81c6758b-fcda-4fab-b2ac-affdf2032d55/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_81c6758b-fcda-4fab-b2ac-affdf2032d55/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix026_pso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_81c6758b-fcda-4fab-b2ac-affdf2032d55/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_81c6758b-fcda-4fab-b2ac-affdf2032d55/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 266fa41cf1a09a3df8b04429af91ca896d1b7b36 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-28 02:56:34,437 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-28 02:56:34,440 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-28 02:56:34,520 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-28 02:56:34,520 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-28 02:56:34,527 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-28 02:56:34,530 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-28 02:56:34,535 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-28 02:56:34,541 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-28 02:56:34,549 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-28 02:56:34,550 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-28 02:56:34,552 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-28 02:56:34,552 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-28 02:56:34,553 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-28 02:56:34,554 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-28 02:56:34,556 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-28 02:56:34,557 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-28 02:56:34,558 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-28 02:56:34,560 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-28 02:56:34,572 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-28 02:56:34,574 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-28 02:56:34,576 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-28 02:56:34,582 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-28 02:56:34,584 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-28 02:56:34,588 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-28 02:56:34,588 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-28 02:56:34,588 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-28 02:56:34,591 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-28 02:56:34,591 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-28 02:56:34,593 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-28 02:56:34,593 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-28 02:56:34,594 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-28 02:56:34,596 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-28 02:56:34,597 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-28 02:56:34,598 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-28 02:56:34,599 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-28 02:56:34,600 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-28 02:56:34,600 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-28 02:56:34,600 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-28 02:56:34,601 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-28 02:56:34,602 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-28 02:56:34,604 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_81c6758b-fcda-4fab-b2ac-affdf2032d55/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-28 02:56:34,646 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-28 02:56:34,647 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-28 02:56:34,649 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-28 02:56:34,649 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-28 02:56:34,649 INFO L138 SettingsManager]: * Use SBE=true [2020-11-28 02:56:34,649 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-28 02:56:34,649 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-28 02:56:34,650 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-28 02:56:34,650 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-28 02:56:34,650 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-28 02:56:34,651 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-28 02:56:34,651 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-28 02:56:34,652 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-28 02:56:34,652 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-28 02:56:34,652 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-28 02:56:34,652 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-28 02:56:34,652 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-28 02:56:34,653 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-28 02:56:34,653 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-28 02:56:34,653 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-28 02:56:34,653 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-28 02:56:34,653 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-28 02:56:34,654 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-28 02:56:34,654 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-28 02:56:34,654 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-28 02:56:34,654 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-28 02:56:34,654 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-28 02:56:34,655 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-28 02:56:34,655 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-28 02:56:34,655 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_81c6758b-fcda-4fab-b2ac-affdf2032d55/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_81c6758b-fcda-4fab-b2ac-affdf2032d55/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 266fa41cf1a09a3df8b04429af91ca896d1b7b36 [2020-11-28 02:56:34,933 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-28 02:56:34,955 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-28 02:56:34,970 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-28 02:56:34,972 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-28 02:56:34,972 INFO L275 PluginConnector]: CDTParser initialized [2020-11-28 02:56:34,973 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_81c6758b-fcda-4fab-b2ac-affdf2032d55/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix026_pso.oepc.i [2020-11-28 02:56:35,054 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_81c6758b-fcda-4fab-b2ac-affdf2032d55/bin/uautomizer/data/d0a101046/6f88f3fd5fa44ab9aa4d7dfc8a1c6ba8/FLAG5c0f5e794 [2020-11-28 02:56:35,684 INFO L306 CDTParser]: Found 1 translation units. [2020-11-28 02:56:35,685 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_81c6758b-fcda-4fab-b2ac-affdf2032d55/sv-benchmarks/c/pthread-wmm/mix026_pso.oepc.i [2020-11-28 02:56:35,699 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_81c6758b-fcda-4fab-b2ac-affdf2032d55/bin/uautomizer/data/d0a101046/6f88f3fd5fa44ab9aa4d7dfc8a1c6ba8/FLAG5c0f5e794 [2020-11-28 02:56:35,958 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_81c6758b-fcda-4fab-b2ac-affdf2032d55/bin/uautomizer/data/d0a101046/6f88f3fd5fa44ab9aa4d7dfc8a1c6ba8 [2020-11-28 02:56:35,961 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-28 02:56:35,962 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-28 02:56:35,964 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-28 02:56:35,964 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-28 02:56:35,967 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-28 02:56:35,968 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:56:35" (1/1) ... [2020-11-28 02:56:35,969 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@195085b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:35, skipping insertion in model container [2020-11-28 02:56:35,970 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:56:35" (1/1) ... [2020-11-28 02:56:35,976 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-28 02:56:36,031 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-28 02:56:36,441 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 02:56:36,450 INFO L203 MainTranslator]: Completed pre-run [2020-11-28 02:56:36,511 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 02:56:36,617 INFO L208 MainTranslator]: Completed translation [2020-11-28 02:56:36,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:36 WrapperNode [2020-11-28 02:56:36,619 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-28 02:56:36,620 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-28 02:56:36,621 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-28 02:56:36,621 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-28 02:56:36,629 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:36" (1/1) ... [2020-11-28 02:56:36,671 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:36" (1/1) ... [2020-11-28 02:56:36,720 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-28 02:56:36,722 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-28 02:56:36,722 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-28 02:56:36,723 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-28 02:56:36,731 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:36" (1/1) ... [2020-11-28 02:56:36,732 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:36" (1/1) ... [2020-11-28 02:56:36,736 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:36" (1/1) ... [2020-11-28 02:56:36,737 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:36" (1/1) ... [2020-11-28 02:56:36,766 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:36" (1/1) ... [2020-11-28 02:56:36,770 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:36" (1/1) ... [2020-11-28 02:56:36,774 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:36" (1/1) ... [2020-11-28 02:56:36,779 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-28 02:56:36,780 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-28 02:56:36,780 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-28 02:56:36,780 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-28 02:56:36,781 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_81c6758b-fcda-4fab-b2ac-affdf2032d55/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-28 02:56:36,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-28 02:56:36,859 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-28 02:56:36,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-28 02:56:36,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-28 02:56:36,861 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-28 02:56:36,862 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-28 02:56:36,862 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-28 02:56:36,862 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-28 02:56:36,862 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-28 02:56:36,863 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-28 02:56:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-11-28 02:56:36,864 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-11-28 02:56:36,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-28 02:56:36,864 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-28 02:56:36,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-28 02:56:36,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-28 02:56:36,866 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-28 02:56:39,565 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-28 02:56:39,565 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-28 02:56:39,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:56:39 BoogieIcfgContainer [2020-11-28 02:56:39,567 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-28 02:56:39,569 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-28 02:56:39,569 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-28 02:56:39,574 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-28 02:56:39,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:56:35" (1/3) ... [2020-11-28 02:56:39,575 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6483f13e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:56:39, skipping insertion in model container [2020-11-28 02:56:39,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:36" (2/3) ... [2020-11-28 02:56:39,575 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6483f13e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:56:39, skipping insertion in model container [2020-11-28 02:56:39,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:56:39" (3/3) ... [2020-11-28 02:56:39,577 INFO L111 eAbstractionObserver]: Analyzing ICFG mix026_pso.oepc.i [2020-11-28 02:56:39,588 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-28 02:56:39,588 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-28 02:56:39,593 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-28 02:56:39,594 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-28 02:56:39,647 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,648 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,648 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,648 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,649 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,649 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,649 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,649 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,650 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,650 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,650 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,650 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,650 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,650 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,651 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,651 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,652 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,652 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,652 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,652 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,652 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,653 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,653 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,654 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,655 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,655 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,655 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,656 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,656 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,656 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,656 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,657 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,657 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,657 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,658 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,685 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,686 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,686 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,687 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,687 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,687 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,687 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,687 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,688 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,688 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,688 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,688 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,692 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,692 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,693 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,693 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,693 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,693 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,694 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,694 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,694 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,694 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,694 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,695 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,695 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,695 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,695 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,695 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,696 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,696 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,696 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,696 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,697 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,697 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,697 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,697 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,698 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,698 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,698 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,698 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,698 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,699 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,699 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,700 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,700 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,700 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,701 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,701 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,701 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,701 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,702 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,702 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,702 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,702 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,703 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,704 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,708 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,709 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,709 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,709 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,710 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,710 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,711 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,711 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,712 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,714 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,716 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,716 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,723 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,724 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,724 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,724 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,724 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,725 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,725 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,727 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,727 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,728 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,728 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,728 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,728 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,729 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,729 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,729 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,729 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,729 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,730 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,730 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,730 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,731 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,731 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,731 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,731 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,731 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,732 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,732 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,732 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,732 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,733 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,733 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,733 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,733 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,734 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,734 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,734 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,734 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,735 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,735 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,739 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,740 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,740 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,740 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,740 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,741 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,741 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,741 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,741 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,742 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,742 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,742 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,742 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,742 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,746 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,746 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,746 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,746 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,746 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,747 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,747 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,747 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,747 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,747 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:39,749 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-28 02:56:39,761 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-11-28 02:56:39,796 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-28 02:56:39,796 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-28 02:56:39,796 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-28 02:56:39,797 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-28 02:56:39,797 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-28 02:56:39,797 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-28 02:56:39,797 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-28 02:56:39,797 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-28 02:56:39,813 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-28 02:56:39,815 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 122 transitions, 264 flow [2020-11-28 02:56:39,818 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 122 transitions, 264 flow [2020-11-28 02:56:39,820 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 132 places, 122 transitions, 264 flow [2020-11-28 02:56:39,874 INFO L129 PetriNetUnfolder]: 3/118 cut-off events. [2020-11-28 02:56:39,874 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-28 02:56:39,879 INFO L80 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 118 events. 3/118 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 97 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 81. Up to 2 conditions per place. [2020-11-28 02:56:39,884 INFO L116 LiptonReduction]: Number of co-enabled transitions 3014 [2020-11-28 02:56:40,291 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:40,292 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:40,294 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:40,294 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:40,298 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:40,299 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:40,309 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:40,310 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:40,347 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:40,347 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:40,348 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:40,349 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:40,352 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:40,355 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:40,363 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:40,363 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:40,500 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:40,500 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:40,502 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:40,502 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:40,505 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:40,506 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:40,509 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:40,509 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:40,538 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:40,539 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:40,539 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:40,540 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:40,543 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:40,543 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:40,546 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:40,549 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:40,595 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:40,595 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:40,596 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:40,597 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:40,600 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:40,600 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:40,606 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:40,606 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:40,629 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:40,629 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:40,630 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:40,631 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:40,633 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:40,634 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:40,636 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:40,637 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:40,763 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:40,764 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:40,779 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 02:56:40,780 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 02:56:40,782 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:56:40,783 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 02:56:40,784 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 02:56:40,785 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 02:56:40,787 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-28 02:56:40,787 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:40,790 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:56:40,790 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:40,793 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:56:40,793 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:40,856 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:56:40,856 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-28 02:56:40,859 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-28 02:56:40,860 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:40,891 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:40,892 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:40,893 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:40,893 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:40,895 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:40,896 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:40,898 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:40,898 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:40,934 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:40,935 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:40,935 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:40,936 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:40,938 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:40,938 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:40,940 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:40,940 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:41,355 WARN L193 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-11-28 02:56:41,474 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-11-28 02:56:41,495 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:41,495 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:41,496 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:41,497 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:41,499 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:41,499 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:41,501 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:41,501 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:41,525 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:41,526 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:41,526 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:41,527 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:41,528 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:41,529 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:41,531 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:41,531 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:41,848 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-11-28 02:56:42,018 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:42,018 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:42,019 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:42,019 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:42,021 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:42,022 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:42,024 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:42,024 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:42,047 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:42,047 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:42,048 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:42,048 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:42,050 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:42,051 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:42,053 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:42,053 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:42,115 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:42,115 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:42,116 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:42,116 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:42,118 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:42,119 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:42,121 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:42,122 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:42,139 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:42,139 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:42,140 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:42,140 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:42,142 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:42,142 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:42,144 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:42,145 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:42,228 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:56:42,228 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-28 02:56:42,231 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-28 02:56:42,231 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:42,274 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:42,275 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:42,282 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 02:56:42,282 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 02:56:42,283 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:56:42,284 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 02:56:42,288 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 02:56:42,289 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 02:56:42,295 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-28 02:56:42,300 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:42,303 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:56:42,303 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:42,305 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:56:42,306 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:42,522 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:42,522 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:42,523 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:42,523 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:42,525 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:42,525 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:42,526 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:42,527 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:42,540 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:42,540 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:42,541 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:42,541 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:42,543 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:42,543 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:42,545 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:42,545 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:42,796 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:42,796 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:42,797 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:42,798 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:42,800 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:42,801 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:42,802 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:42,803 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:42,818 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:42,818 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:42,819 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:42,819 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:42,821 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:42,821 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:42,823 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:42,823 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:42,867 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:42,867 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:42,868 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:42,868 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:42,870 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:42,870 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:42,872 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:42,872 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:42,886 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:42,886 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:42,887 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:42,887 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:42,889 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:42,890 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:42,891 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:42,892 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:43,032 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-28 02:56:43,138 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-28 02:56:43,157 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:43,158 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:43,158 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:43,159 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:43,161 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:43,161 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:43,163 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:43,164 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:43,176 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:43,177 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:43,177 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:43,178 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:43,179 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:43,180 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:43,181 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:43,181 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:43,252 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:43,253 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:43,267 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 02:56:43,268 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 02:56:43,269 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:56:43,269 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 02:56:43,271 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 02:56:43,271 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 02:56:43,273 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-28 02:56:43,273 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:43,274 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:56:43,275 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:43,277 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:56:43,277 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:43,326 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:56:43,326 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-28 02:56:43,328 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-28 02:56:43,328 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:43,358 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:43,358 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:43,358 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:43,359 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:43,360 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:43,360 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:43,362 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:43,362 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:43,382 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:43,382 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:43,383 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:43,383 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:43,384 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:43,385 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:43,387 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:43,388 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:43,498 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:56:43,499 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-28 02:56:43,500 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-28 02:56:43,501 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:43,559 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:43,559 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:43,561 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 02:56:43,561 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 02:56:43,562 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:56:43,562 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 02:56:43,563 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 02:56:43,564 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 02:56:43,566 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-28 02:56:43,566 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:43,567 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:56:43,568 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:43,569 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:56:43,570 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:43,830 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-28 02:56:43,830 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:43,854 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:43,854 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:43,855 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:43,855 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:43,857 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:43,857 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:43,858 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:43,859 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:43,871 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:43,872 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:43,872 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:43,873 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:43,874 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:43,874 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:43,875 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:43,876 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:43,937 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-28 02:56:43,938 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:43,981 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-28 02:56:43,982 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:43,998 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:43,998 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:43,999 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:43,999 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:44,000 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:44,001 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:44,002 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:44,002 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:44,015 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:44,015 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:44,016 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:44,016 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:44,018 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:44,018 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:44,020 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:44,020 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:44,082 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-28 02:56:44,082 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:44,277 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2020-11-28 02:56:44,354 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-28 02:56:44,354 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:44,355 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-11-28 02:56:44,356 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:44,356 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-11-28 02:56:44,357 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:44,414 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-28 02:56:44,415 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:44,430 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-28 02:56:44,431 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:44,515 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-28 02:56:44,515 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:44,516 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-11-28 02:56:44,517 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:44,518 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-11-28 02:56:44,518 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:44,996 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2020-11-28 02:56:45,109 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2020-11-28 02:56:45,789 WARN L193 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2020-11-28 02:56:45,992 WARN L193 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2020-11-28 02:56:46,004 INFO L131 LiptonReduction]: Checked pairs total: 8420 [2020-11-28 02:56:46,004 INFO L133 LiptonReduction]: Total number of compositions: 102 [2020-11-28 02:56:46,009 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 48 places, 36 transitions, 92 flow [2020-11-28 02:56:46,440 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 5774 states. [2020-11-28 02:56:46,442 INFO L276 IsEmpty]: Start isEmpty. Operand 5774 states. [2020-11-28 02:56:46,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-11-28 02:56:46,455 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:46,456 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-11-28 02:56:46,456 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:46,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:46,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1246900, now seen corresponding path program 1 times [2020-11-28 02:56:46,472 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:46,472 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038849145] [2020-11-28 02:56:46,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:46,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:56:46,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:56:46,761 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038849145] [2020-11-28 02:56:46,761 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:56:46,761 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-28 02:56:46,762 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342124146] [2020-11-28 02:56:46,767 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 02:56:46,767 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:56:46,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 02:56:46,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 02:56:46,786 INFO L87 Difference]: Start difference. First operand 5774 states. Second operand 3 states. [2020-11-28 02:56:47,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:56:47,076 INFO L93 Difference]: Finished difference Result 4812 states and 19300 transitions. [2020-11-28 02:56:47,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 02:56:47,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-11-28 02:56:47,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:56:47,167 INFO L225 Difference]: With dead ends: 4812 [2020-11-28 02:56:47,167 INFO L226 Difference]: Without dead ends: 4062 [2020-11-28 02:56:47,168 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 02:56:47,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4062 states. [2020-11-28 02:56:47,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4062 to 4062. [2020-11-28 02:56:47,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4062 states. [2020-11-28 02:56:47,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4062 states to 4062 states and 16125 transitions. [2020-11-28 02:56:47,469 INFO L78 Accepts]: Start accepts. Automaton has 4062 states and 16125 transitions. Word has length 3 [2020-11-28 02:56:47,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:56:47,470 INFO L481 AbstractCegarLoop]: Abstraction has 4062 states and 16125 transitions. [2020-11-28 02:56:47,470 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 02:56:47,470 INFO L276 IsEmpty]: Start isEmpty. Operand 4062 states and 16125 transitions. [2020-11-28 02:56:47,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-28 02:56:47,482 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:47,482 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:56:47,483 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-28 02:56:47,483 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:47,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:47,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1900079686, now seen corresponding path program 1 times [2020-11-28 02:56:47,487 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:47,488 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018769441] [2020-11-28 02:56:47,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:47,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:56:47,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:56:47,644 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018769441] [2020-11-28 02:56:47,644 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:56:47,644 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 02:56:47,644 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561231160] [2020-11-28 02:56:47,645 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 02:56:47,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:56:47,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 02:56:47,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 02:56:47,646 INFO L87 Difference]: Start difference. First operand 4062 states and 16125 transitions. Second operand 4 states. [2020-11-28 02:56:47,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:56:47,735 INFO L93 Difference]: Finished difference Result 4712 states and 18140 transitions. [2020-11-28 02:56:47,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 02:56:47,736 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-11-28 02:56:47,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:56:47,779 INFO L225 Difference]: With dead ends: 4712 [2020-11-28 02:56:47,779 INFO L226 Difference]: Without dead ends: 3962 [2020-11-28 02:56:47,788 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 02:56:47,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3962 states. [2020-11-28 02:56:48,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3962 to 3962. [2020-11-28 02:56:48,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3962 states. [2020-11-28 02:56:48,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3962 states to 3962 states and 15665 transitions. [2020-11-28 02:56:48,068 INFO L78 Accepts]: Start accepts. Automaton has 3962 states and 15665 transitions. Word has length 12 [2020-11-28 02:56:48,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:56:48,071 INFO L481 AbstractCegarLoop]: Abstraction has 3962 states and 15665 transitions. [2020-11-28 02:56:48,071 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 02:56:48,071 INFO L276 IsEmpty]: Start isEmpty. Operand 3962 states and 15665 transitions. [2020-11-28 02:56:48,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-28 02:56:48,075 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:48,075 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:56:48,076 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-28 02:56:48,076 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:48,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:48,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1181774904, now seen corresponding path program 1 times [2020-11-28 02:56:48,086 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:48,087 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858116208] [2020-11-28 02:56:48,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:48,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:56:48,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:56:48,180 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858116208] [2020-11-28 02:56:48,181 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:56:48,181 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 02:56:48,181 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965450245] [2020-11-28 02:56:48,181 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 02:56:48,181 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:56:48,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 02:56:48,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 02:56:48,182 INFO L87 Difference]: Start difference. First operand 3962 states and 15665 transitions. Second operand 4 states. [2020-11-28 02:56:48,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:56:48,288 INFO L93 Difference]: Finished difference Result 4262 states and 16370 transitions. [2020-11-28 02:56:48,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 02:56:48,288 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-11-28 02:56:48,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:56:48,326 INFO L225 Difference]: With dead ends: 4262 [2020-11-28 02:56:48,326 INFO L226 Difference]: Without dead ends: 3562 [2020-11-28 02:56:48,326 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 02:56:48,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3562 states. [2020-11-28 02:56:48,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3562 to 3562. [2020-11-28 02:56:48,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3562 states. [2020-11-28 02:56:48,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3562 states to 3562 states and 13925 transitions. [2020-11-28 02:56:48,610 INFO L78 Accepts]: Start accepts. Automaton has 3562 states and 13925 transitions. Word has length 13 [2020-11-28 02:56:48,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:56:48,610 INFO L481 AbstractCegarLoop]: Abstraction has 3562 states and 13925 transitions. [2020-11-28 02:56:48,610 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 02:56:48,611 INFO L276 IsEmpty]: Start isEmpty. Operand 3562 states and 13925 transitions. [2020-11-28 02:56:48,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-28 02:56:48,614 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:48,615 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:56:48,615 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-28 02:56:48,615 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:48,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:48,616 INFO L82 PathProgramCache]: Analyzing trace with hash -2019709826, now seen corresponding path program 1 times [2020-11-28 02:56:48,617 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:48,617 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930399526] [2020-11-28 02:56:48,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:48,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:56:48,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:56:48,784 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930399526] [2020-11-28 02:56:48,784 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:56:48,784 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 02:56:48,785 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578852660] [2020-11-28 02:56:48,785 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 02:56:48,785 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:56:48,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 02:56:48,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 02:56:48,786 INFO L87 Difference]: Start difference. First operand 3562 states and 13925 transitions. Second operand 4 states. [2020-11-28 02:56:48,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:56:48,881 INFO L93 Difference]: Finished difference Result 3288 states and 11550 transitions. [2020-11-28 02:56:48,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 02:56:48,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-11-28 02:56:48,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:56:48,930 INFO L225 Difference]: With dead ends: 3288 [2020-11-28 02:56:48,930 INFO L226 Difference]: Without dead ends: 2538 [2020-11-28 02:56:48,930 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 02:56:48,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2538 states. [2020-11-28 02:56:49,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2538 to 2538. [2020-11-28 02:56:49,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2538 states. [2020-11-28 02:56:49,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2538 states to 2538 states and 8805 transitions. [2020-11-28 02:56:49,040 INFO L78 Accepts]: Start accepts. Automaton has 2538 states and 8805 transitions. Word has length 14 [2020-11-28 02:56:49,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:56:49,041 INFO L481 AbstractCegarLoop]: Abstraction has 2538 states and 8805 transitions. [2020-11-28 02:56:49,041 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 02:56:49,041 INFO L276 IsEmpty]: Start isEmpty. Operand 2538 states and 8805 transitions. [2020-11-28 02:56:49,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-28 02:56:49,046 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:49,046 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:56:49,046 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-28 02:56:49,046 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:49,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:49,047 INFO L82 PathProgramCache]: Analyzing trace with hash -419994617, now seen corresponding path program 1 times [2020-11-28 02:56:49,047 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:49,047 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252294540] [2020-11-28 02:56:49,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:49,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:56:49,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:56:49,223 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252294540] [2020-11-28 02:56:49,224 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:56:49,224 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 02:56:49,224 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566924644] [2020-11-28 02:56:49,224 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 02:56:49,224 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:56:49,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 02:56:49,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-28 02:56:49,225 INFO L87 Difference]: Start difference. First operand 2538 states and 8805 transitions. Second operand 5 states. [2020-11-28 02:56:49,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:56:49,310 INFO L93 Difference]: Finished difference Result 1944 states and 6158 transitions. [2020-11-28 02:56:49,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 02:56:49,311 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-11-28 02:56:49,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:56:49,318 INFO L225 Difference]: With dead ends: 1944 [2020-11-28 02:56:49,318 INFO L226 Difference]: Without dead ends: 1514 [2020-11-28 02:56:49,318 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-28 02:56:49,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2020-11-28 02:56:49,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1514. [2020-11-28 02:56:49,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1514 states. [2020-11-28 02:56:49,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 4709 transitions. [2020-11-28 02:56:49,433 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 4709 transitions. Word has length 17 [2020-11-28 02:56:49,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:56:49,434 INFO L481 AbstractCegarLoop]: Abstraction has 1514 states and 4709 transitions. [2020-11-28 02:56:49,434 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 02:56:49,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 4709 transitions. [2020-11-28 02:56:49,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-28 02:56:49,438 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:49,438 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:56:49,438 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-28 02:56:49,439 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:49,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:49,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1667322662, now seen corresponding path program 1 times [2020-11-28 02:56:49,439 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:49,440 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113943044] [2020-11-28 02:56:49,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:49,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:56:49,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:56:49,680 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113943044] [2020-11-28 02:56:49,680 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:56:49,680 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 02:56:49,680 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152663195] [2020-11-28 02:56:49,681 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 02:56:49,681 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:56:49,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 02:56:49,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-28 02:56:49,681 INFO L87 Difference]: Start difference. First operand 1514 states and 4709 transitions. Second operand 6 states. [2020-11-28 02:56:49,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:56:49,971 INFO L93 Difference]: Finished difference Result 2784 states and 8451 transitions. [2020-11-28 02:56:49,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-28 02:56:49,972 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-11-28 02:56:49,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:56:49,979 INFO L225 Difference]: With dead ends: 2784 [2020-11-28 02:56:49,980 INFO L226 Difference]: Without dead ends: 2426 [2020-11-28 02:56:49,980 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-11-28 02:56:49,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2426 states. [2020-11-28 02:56:50,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2426 to 1898. [2020-11-28 02:56:50,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1898 states. [2020-11-28 02:56:50,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 5849 transitions. [2020-11-28 02:56:50,048 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 5849 transitions. Word has length 21 [2020-11-28 02:56:50,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:56:50,048 INFO L481 AbstractCegarLoop]: Abstraction has 1898 states and 5849 transitions. [2020-11-28 02:56:50,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 02:56:50,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 5849 transitions. [2020-11-28 02:56:50,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-28 02:56:50,053 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:50,053 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:56:50,054 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-28 02:56:50,054 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:50,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:50,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1903811006, now seen corresponding path program 2 times [2020-11-28 02:56:50,054 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:50,055 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827242279] [2020-11-28 02:56:50,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:50,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:56:50,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:56:50,191 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827242279] [2020-11-28 02:56:50,191 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:56:50,192 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 02:56:50,192 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860206459] [2020-11-28 02:56:50,192 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 02:56:50,192 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:56:50,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 02:56:50,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-28 02:56:50,193 INFO L87 Difference]: Start difference. First operand 1898 states and 5849 transitions. Second operand 6 states. [2020-11-28 02:56:50,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:56:50,381 INFO L93 Difference]: Finished difference Result 1631 states and 4984 transitions. [2020-11-28 02:56:50,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-28 02:56:50,382 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-11-28 02:56:50,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:56:50,387 INFO L225 Difference]: With dead ends: 1631 [2020-11-28 02:56:50,387 INFO L226 Difference]: Without dead ends: 1469 [2020-11-28 02:56:50,388 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-11-28 02:56:50,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2020-11-28 02:56:50,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 1469. [2020-11-28 02:56:50,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1469 states. [2020-11-28 02:56:50,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 4551 transitions. [2020-11-28 02:56:50,435 INFO L78 Accepts]: Start accepts. Automaton has 1469 states and 4551 transitions. Word has length 21 [2020-11-28 02:56:50,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:56:50,435 INFO L481 AbstractCegarLoop]: Abstraction has 1469 states and 4551 transitions. [2020-11-28 02:56:50,435 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 02:56:50,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 4551 transitions. [2020-11-28 02:56:50,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-28 02:56:50,441 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:50,441 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:56:50,442 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-28 02:56:50,442 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:50,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:50,442 INFO L82 PathProgramCache]: Analyzing trace with hash -646913360, now seen corresponding path program 1 times [2020-11-28 02:56:50,443 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:50,443 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136842692] [2020-11-28 02:56:50,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:50,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:56:50,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:56:50,966 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136842692] [2020-11-28 02:56:50,966 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:56:50,967 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-28 02:56:50,967 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422068683] [2020-11-28 02:56:50,967 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-28 02:56:50,968 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:56:50,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-28 02:56:50,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-11-28 02:56:50,970 INFO L87 Difference]: Start difference. First operand 1469 states and 4551 transitions. Second operand 8 states. [2020-11-28 02:56:51,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:56:51,461 INFO L93 Difference]: Finished difference Result 1812 states and 5423 transitions. [2020-11-28 02:56:51,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-28 02:56:51,463 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2020-11-28 02:56:51,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:56:51,468 INFO L225 Difference]: With dead ends: 1812 [2020-11-28 02:56:51,468 INFO L226 Difference]: Without dead ends: 1695 [2020-11-28 02:56:51,471 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-11-28 02:56:51,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1695 states. [2020-11-28 02:56:51,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1695 to 1333. [2020-11-28 02:56:51,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1333 states. [2020-11-28 02:56:51,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 4125 transitions. [2020-11-28 02:56:51,516 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 4125 transitions. Word has length 25 [2020-11-28 02:56:51,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:56:51,517 INFO L481 AbstractCegarLoop]: Abstraction has 1333 states and 4125 transitions. [2020-11-28 02:56:51,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-28 02:56:51,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 4125 transitions. [2020-11-28 02:56:51,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-28 02:56:51,521 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:51,522 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:56:51,522 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-28 02:56:51,522 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:51,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:51,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1195013334, now seen corresponding path program 1 times [2020-11-28 02:56:51,523 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:51,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223432801] [2020-11-28 02:56:51,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:51,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:56:51,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:56:51,917 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223432801] [2020-11-28 02:56:51,917 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:56:51,917 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-28 02:56:51,917 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941132706] [2020-11-28 02:56:51,918 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-28 02:56:51,918 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:56:51,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-28 02:56:51,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-11-28 02:56:51,919 INFO L87 Difference]: Start difference. First operand 1333 states and 4125 transitions. Second operand 8 states. [2020-11-28 02:56:52,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:56:52,294 INFO L93 Difference]: Finished difference Result 2001 states and 5905 transitions. [2020-11-28 02:56:52,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-28 02:56:52,294 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2020-11-28 02:56:52,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:56:52,301 INFO L225 Difference]: With dead ends: 2001 [2020-11-28 02:56:52,301 INFO L226 Difference]: Without dead ends: 1914 [2020-11-28 02:56:52,302 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-11-28 02:56:52,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1914 states. [2020-11-28 02:56:52,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1914 to 1555. [2020-11-28 02:56:52,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2020-11-28 02:56:52,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 4762 transitions. [2020-11-28 02:56:52,362 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 4762 transitions. Word has length 25 [2020-11-28 02:56:52,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:56:52,363 INFO L481 AbstractCegarLoop]: Abstraction has 1555 states and 4762 transitions. [2020-11-28 02:56:52,363 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-28 02:56:52,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 4762 transitions. [2020-11-28 02:56:52,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-28 02:56:52,368 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:52,369 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:56:52,369 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-28 02:56:52,369 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:52,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:52,370 INFO L82 PathProgramCache]: Analyzing trace with hash 102700184, now seen corresponding path program 2 times [2020-11-28 02:56:52,370 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:52,370 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171816407] [2020-11-28 02:56:52,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:52,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:56:52,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:56:52,522 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171816407] [2020-11-28 02:56:52,523 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:56:52,523 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-28 02:56:52,523 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339214669] [2020-11-28 02:56:52,523 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-28 02:56:52,523 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:56:52,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-28 02:56:52,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-28 02:56:52,524 INFO L87 Difference]: Start difference. First operand 1555 states and 4762 transitions. Second operand 7 states. [2020-11-28 02:56:52,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:56:52,625 INFO L93 Difference]: Finished difference Result 1506 states and 4659 transitions. [2020-11-28 02:56:52,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-28 02:56:52,626 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2020-11-28 02:56:52,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:56:52,631 INFO L225 Difference]: With dead ends: 1506 [2020-11-28 02:56:52,631 INFO L226 Difference]: Without dead ends: 1168 [2020-11-28 02:56:52,632 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-11-28 02:56:52,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-11-28 02:56:52,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 1128. [2020-11-28 02:56:52,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1128 states. [2020-11-28 02:56:52,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 3489 transitions. [2020-11-28 02:56:52,673 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 3489 transitions. Word has length 25 [2020-11-28 02:56:52,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:56:52,674 INFO L481 AbstractCegarLoop]: Abstraction has 1128 states and 3489 transitions. [2020-11-28 02:56:52,674 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-28 02:56:52,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 3489 transitions. [2020-11-28 02:56:52,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-11-28 02:56:52,681 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:52,681 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:56:52,681 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-28 02:56:52,681 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:52,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:52,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1472319768, now seen corresponding path program 1 times [2020-11-28 02:56:52,682 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:52,682 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231866896] [2020-11-28 02:56:52,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:52,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:56:52,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:56:52,952 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231866896] [2020-11-28 02:56:52,952 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:56:52,952 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-28 02:56:52,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998492584] [2020-11-28 02:56:52,953 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-28 02:56:52,953 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:56:52,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-28 02:56:52,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-11-28 02:56:52,954 INFO L87 Difference]: Start difference. First operand 1128 states and 3489 transitions. Second operand 9 states. [2020-11-28 02:56:53,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:56:53,314 INFO L93 Difference]: Finished difference Result 1540 states and 4667 transitions. [2020-11-28 02:56:53,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-28 02:56:53,314 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2020-11-28 02:56:53,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:56:53,319 INFO L225 Difference]: With dead ends: 1540 [2020-11-28 02:56:53,319 INFO L226 Difference]: Without dead ends: 1361 [2020-11-28 02:56:53,320 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2020-11-28 02:56:53,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2020-11-28 02:56:53,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 952. [2020-11-28 02:56:53,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 952 states. [2020-11-28 02:56:53,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 2943 transitions. [2020-11-28 02:56:53,359 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 2943 transitions. Word has length 29 [2020-11-28 02:56:53,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:56:53,359 INFO L481 AbstractCegarLoop]: Abstraction has 952 states and 2943 transitions. [2020-11-28 02:56:53,359 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-28 02:56:53,360 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 2943 transitions. [2020-11-28 02:56:53,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-11-28 02:56:53,363 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:53,363 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:56:53,363 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-28 02:56:53,364 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:53,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:53,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1830377960, now seen corresponding path program 2 times [2020-11-28 02:56:53,364 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:53,365 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854619309] [2020-11-28 02:56:53,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:53,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:56:53,445 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:56:53,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:56:53,526 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:56:53,587 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 02:56:53,587 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-28 02:56:53,587 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-28 02:56:53,635 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,636 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,636 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,636 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [751] [2020-11-28 02:56:53,641 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,642 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,642 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,642 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,642 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,642 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,643 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,643 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,643 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,643 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,644 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,644 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,645 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,645 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,645 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,645 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,646 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,646 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,646 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,646 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,646 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,646 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,646 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,646 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,647 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,648 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,648 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,648 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,648 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,648 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,648 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,649 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,649 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,649 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,649 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,649 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,650 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,650 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,650 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,650 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,650 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,650 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,651 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,651 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,651 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,651 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,652 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,652 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,652 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,652 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,652 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,653 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,653 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,653 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,653 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,653 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,654 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,654 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,654 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,654 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,655 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,655 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,655 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,655 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,656 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,656 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,656 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,656 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,657 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,657 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,657 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,658 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,658 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,658 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,658 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,658 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,658 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,659 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,659 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,659 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:56:53 BasicIcfg [2020-11-28 02:56:53,789 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-28 02:56:53,790 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-28 02:56:53,790 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-28 02:56:53,792 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-28 02:56:53,792 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:56:39" (3/4) ... [2020-11-28 02:56:53,794 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-28 02:56:53,827 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,827 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,828 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,828 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [751] [2020-11-28 02:56:53,828 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,829 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,829 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,829 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,829 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,829 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,829 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,829 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,829 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,830 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,830 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,830 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,831 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,831 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,831 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,831 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,831 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,831 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,832 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,832 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,832 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,832 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,832 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,832 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,833 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,833 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,833 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,834 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,834 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,834 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,834 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,834 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,834 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,835 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,835 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,835 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,835 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,835 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,835 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,835 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,836 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,836 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,836 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,836 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,836 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,837 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,837 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,837 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,837 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,837 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,837 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,837 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,838 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,838 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,838 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,838 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,838 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,839 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,839 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,839 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,839 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,839 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,839 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,839 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,840 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,840 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,840 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,840 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,841 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,841 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,841 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,841 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,841 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,841 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,841 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,842 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,842 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,842 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,842 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:53,842 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:53,962 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_81c6758b-fcda-4fab-b2ac-affdf2032d55/bin/uautomizer/witness.graphml [2020-11-28 02:56:53,962 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-28 02:56:53,963 INFO L168 Benchmark]: Toolchain (without parser) took 18000.93 ms. Allocated memory was 98.6 MB in the beginning and 742.4 MB in the end (delta: 643.8 MB). Free memory was 62.9 MB in the beginning and 592.3 MB in the end (delta: -529.4 MB). Peak memory consumption was 354.2 MB. Max. memory is 16.1 GB. [2020-11-28 02:56:53,964 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 98.6 MB. Free memory is still 80.6 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 02:56:53,964 INFO L168 Benchmark]: CACSL2BoogieTranslator took 655.27 ms. Allocated memory is still 98.6 MB. Free memory was 62.7 MB in the beginning and 50.3 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-11-28 02:56:53,965 INFO L168 Benchmark]: Boogie Procedure Inliner took 100.57 ms. Allocated memory is still 98.6 MB. Free memory was 50.3 MB in the beginning and 47.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 02:56:53,965 INFO L168 Benchmark]: Boogie Preprocessor took 56.91 ms. Allocated memory is still 98.6 MB. Free memory was 47.7 MB in the beginning and 45.3 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 02:56:53,966 INFO L168 Benchmark]: RCFGBuilder took 2787.86 ms. Allocated memory was 98.6 MB in the beginning and 119.5 MB in the end (delta: 21.0 MB). Free memory was 45.3 MB in the beginning and 44.5 MB in the end (delta: 795.9 kB). Peak memory consumption was 35.1 MB. Max. memory is 16.1 GB. [2020-11-28 02:56:53,966 INFO L168 Benchmark]: TraceAbstraction took 14220.37 ms. Allocated memory was 119.5 MB in the beginning and 742.4 MB in the end (delta: 622.9 MB). Free memory was 43.4 MB in the beginning and 373.6 MB in the end (delta: -330.2 MB). Peak memory consumption was 292.7 MB. Max. memory is 16.1 GB. [2020-11-28 02:56:53,967 INFO L168 Benchmark]: Witness Printer took 172.06 ms. Allocated memory is still 742.4 MB. Free memory was 373.6 MB in the beginning and 592.3 MB in the end (delta: -218.7 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2020-11-28 02:56:53,969 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.20 ms. Allocated memory is still 98.6 MB. Free memory is still 80.6 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 655.27 ms. Allocated memory is still 98.6 MB. Free memory was 62.7 MB in the beginning and 50.3 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 100.57 ms. Allocated memory is still 98.6 MB. Free memory was 50.3 MB in the beginning and 47.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 56.91 ms. Allocated memory is still 98.6 MB. Free memory was 47.7 MB in the beginning and 45.3 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2787.86 ms. Allocated memory was 98.6 MB in the beginning and 119.5 MB in the end (delta: 21.0 MB). Free memory was 45.3 MB in the beginning and 44.5 MB in the end (delta: 795.9 kB). Peak memory consumption was 35.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 14220.37 ms. Allocated memory was 119.5 MB in the beginning and 742.4 MB in the end (delta: 622.9 MB). Free memory was 43.4 MB in the beginning and 373.6 MB in the end (delta: -330.2 MB). Peak memory consumption was 292.7 MB. Max. memory is 16.1 GB. * Witness Printer took 172.06 ms. Allocated memory is still 742.4 MB. Free memory was 373.6 MB in the beginning and 592.3 MB in the end (delta: -218.7 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1991 VarBasedMoverChecksPositive, 74 VarBasedMoverChecksNegative, 17 SemBasedMoverChecksPositive, 57 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 247 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 6.1s, 132 PlacesBefore, 48 PlacesAfterwards, 122 TransitionsBefore, 36 TransitionsAfterwards, 3014 CoEnabledTransitionPairs, 6 FixpointIterations, 41 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 102 TotalNumberOfCompositions, 8420 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool a$flush_delayed; [L722] 0 int a$mem_tmp; [L723] 0 _Bool a$r_buff0_thd0; [L724] 0 _Bool a$r_buff0_thd1; [L725] 0 _Bool a$r_buff0_thd2; [L726] 0 _Bool a$r_buff0_thd3; [L727] 0 _Bool a$r_buff0_thd4; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$r_buff1_thd4; [L733] 0 _Bool a$read_delayed; [L734] 0 int *a$read_delayed_var; [L735] 0 int a$w_buff0; [L736] 0 _Bool a$w_buff0_used; [L737] 0 int a$w_buff1; [L738] 0 _Bool a$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L866] 0 pthread_t t689; [L867] FCALL, FORK 0 pthread_create(&t689, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L18] COND TRUE 1 !expression [L17] COND FALSE 1 !(0) [L17] 1 __assert_fail ("0", "mix026_pso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L868] 0 pthread_t t690; [L869] FCALL, FORK 0 pthread_create(&t690, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L782] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L788] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L788] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L788] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L788] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L789] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L789] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L790] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L790] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L791] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L792] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L792] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L870] 0 pthread_t t691; [L871] FCALL, FORK 0 pthread_create(&t691, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L802] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L805] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L808] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L808] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L808] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L808] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L809] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L809] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L810] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L810] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L811] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L811] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L812] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L812] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L872] 0 pthread_t t692; [L873] FCALL, FORK 0 pthread_create(&t692, ((void *)0), P3, ((void *)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L822] 4 z = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L825] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L828] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 4 a$flush_delayed = weak$$choice2 [L831] 4 a$mem_tmp = a [L832] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L832] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L833] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L833] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0) [L833] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L833] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L834] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L834] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L835] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L835] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L836] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L836] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L837] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L838] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L838] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L838] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L838] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 __unbuffered_p3_EBX = a [L840] EXPR 4 a$flush_delayed ? a$mem_tmp : a [L840] 4 a = a$flush_delayed ? a$mem_tmp : a [L841] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, y=1, z=2] [L768] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L768] EXPR 1 a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a [L768] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L768] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L769] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L771] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L772] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L844] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L844] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L844] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L844] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L845] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L845] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L846] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L846] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L847] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L847] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L848] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L848] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L851] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L853] 4 return 0; [L875] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L879] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L879] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L879] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L879] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L880] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L880] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L881] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L881] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L882] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L882] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L883] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L883] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L886] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix026_pso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, y=1, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 120 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 13.7s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.6s, HoareTripleCheckerStatistics: 553 SDtfs, 787 SDslu, 1478 SDs, 0 SdLazy, 598 SolverSat, 108 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5774occurred 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: 1.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 1698 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 234 NumberOfCodeBlocks, 234 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 194 ConstructedInterpolants, 0 QuantifiedInterpolants, 37487 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...