/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/thin002_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-11 15:12:31,447 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-11 15:12:31,449 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-11 15:12:31,472 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-11 15:12:31,473 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-11 15:12:31,474 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-11 15:12:31,475 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-11 15:12:31,477 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-11 15:12:31,478 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-11 15:12:31,479 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-11 15:12:31,480 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-11 15:12:31,481 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-11 15:12:31,481 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-11 15:12:31,482 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-11 15:12:31,483 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-11 15:12:31,484 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-11 15:12:31,489 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-11 15:12:31,490 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-11 15:12:31,493 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-11 15:12:31,495 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-11 15:12:31,500 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-11 15:12:31,501 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-11 15:12:31,505 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-11 15:12:31,506 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-11 15:12:31,508 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-11 15:12:31,508 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-11 15:12:31,508 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-11 15:12:31,513 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-11 15:12:31,514 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-11 15:12:31,516 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-11 15:12:31,517 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-11 15:12:31,517 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-11 15:12:31,518 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-11 15:12:31,520 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-11 15:12:31,521 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-11 15:12:31,521 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-11 15:12:31,522 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-11 15:12:31,522 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-11 15:12:31,522 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-11 15:12:31,523 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-11 15:12:31,525 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-11 15:12:31,526 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-11 15:12:31,579 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-11 15:12:31,580 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-11 15:12:31,581 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-11 15:12:31,581 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-11 15:12:31,581 INFO L138 SettingsManager]: * Use SBE=true [2020-10-11 15:12:31,582 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-11 15:12:31,582 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-11 15:12:31,582 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-11 15:12:31,582 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-11 15:12:31,582 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-11 15:12:31,582 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-11 15:12:31,583 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-11 15:12:31,588 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-11 15:12:31,588 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-11 15:12:31,588 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-11 15:12:31,589 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-11 15:12:31,589 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-11 15:12:31,589 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-11 15:12:31,589 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-11 15:12:31,589 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-11 15:12:31,590 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-11 15:12:31,590 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 15:12:31,590 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-11 15:12:31,590 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-11 15:12:31,590 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-11 15:12:31,591 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-11 15:12:31,591 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-11 15:12:31,593 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-11 15:12:31,593 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-11 15:12:31,593 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-11 15:12:31,919 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-11 15:12:31,933 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-11 15:12:31,936 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-11 15:12:31,938 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-11 15:12:31,938 INFO L275 PluginConnector]: CDTParser initialized [2020-10-11 15:12:31,939 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/thin002_power.oepc.i [2020-10-11 15:12:31,997 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d18c17d3/23fc7ee892f44d2e98c2a2f17601e6aa/FLAGe06fc5479 [2020-10-11 15:12:32,457 INFO L306 CDTParser]: Found 1 translation units. [2020-10-11 15:12:32,457 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/thin002_power.oepc.i [2020-10-11 15:12:32,478 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d18c17d3/23fc7ee892f44d2e98c2a2f17601e6aa/FLAGe06fc5479 [2020-10-11 15:12:32,749 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d18c17d3/23fc7ee892f44d2e98c2a2f17601e6aa [2020-10-11 15:12:32,757 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-11 15:12:32,759 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-11 15:12:32,760 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-11 15:12:32,760 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-11 15:12:32,763 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-11 15:12:32,765 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:12:32" (1/1) ... [2020-10-11 15:12:32,768 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6180554f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:32, skipping insertion in model container [2020-10-11 15:12:32,769 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:12:32" (1/1) ... [2020-10-11 15:12:32,776 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-11 15:12:32,841 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-11 15:12:33,485 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 15:12:33,510 INFO L203 MainTranslator]: Completed pre-run [2020-10-11 15:12:33,573 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 15:12:33,664 INFO L208 MainTranslator]: Completed translation [2020-10-11 15:12:33,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:33 WrapperNode [2020-10-11 15:12:33,665 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-11 15:12:33,666 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-11 15:12:33,666 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-11 15:12:33,666 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-11 15:12:33,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:33" (1/1) ... [2020-10-11 15:12:33,698 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:33" (1/1) ... [2020-10-11 15:12:33,730 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-11 15:12:33,731 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-11 15:12:33,731 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-11 15:12:33,731 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-11 15:12:33,747 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:33" (1/1) ... [2020-10-11 15:12:33,747 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:33" (1/1) ... [2020-10-11 15:12:33,753 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:33" (1/1) ... [2020-10-11 15:12:33,753 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:33" (1/1) ... [2020-10-11 15:12:33,770 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:33" (1/1) ... [2020-10-11 15:12:33,777 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:33" (1/1) ... [2020-10-11 15:12:33,781 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:33" (1/1) ... [2020-10-11 15:12:33,788 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-11 15:12:33,788 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-11 15:12:33,788 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-11 15:12:33,789 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-11 15:12:33,790 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 15:12:33,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-11 15:12:33,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-11 15:12:33,864 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-11 15:12:33,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-11 15:12:33,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-11 15:12:33,865 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-11 15:12:33,865 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-11 15:12:33,865 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-11 15:12:33,866 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-11 15:12:33,866 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-11 15:12:33,866 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-11 15:12:33,866 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-11 15:12:33,867 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-11 15:12:33,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-11 15:12:33,867 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-11 15:12:33,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-11 15:12:33,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-11 15:12:33,870 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-11 15:12:36,497 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-11 15:12:36,497 INFO L298 CfgBuilder]: Removed 8 assume(true) statements. [2020-10-11 15:12:36,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:12:36 BoogieIcfgContainer [2020-10-11 15:12:36,500 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-11 15:12:36,501 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-11 15:12:36,501 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-11 15:12:36,504 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-11 15:12:36,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:12:32" (1/3) ... [2020-10-11 15:12:36,505 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a1e9115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:12:36, skipping insertion in model container [2020-10-11 15:12:36,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:33" (2/3) ... [2020-10-11 15:12:36,506 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a1e9115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:12:36, skipping insertion in model container [2020-10-11 15:12:36,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:12:36" (3/3) ... [2020-10-11 15:12:36,508 INFO L111 eAbstractionObserver]: Analyzing ICFG thin002_power.oepc.i [2020-10-11 15:12:36,519 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-11 15:12:36,520 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-11 15:12:36,528 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-11 15:12:36,529 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-11 15:12:36,564 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,564 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,564 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,565 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,565 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,565 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,565 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,565 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,566 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,566 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,566 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,566 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,566 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,567 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,567 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,567 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,567 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,567 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,567 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,568 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,568 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,568 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,568 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,568 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,569 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,569 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,569 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,569 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,569 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,570 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,570 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,570 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,570 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,570 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,570 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,570 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,571 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,571 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,571 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,571 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,571 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,571 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,572 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,572 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,572 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,572 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,572 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,572 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,573 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,573 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,573 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,573 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,573 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,573 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,574 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,574 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,574 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,574 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,574 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,574 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,575 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,575 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,575 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,575 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,575 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,575 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,575 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,576 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,576 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,576 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,576 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,576 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,576 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,577 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,577 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,577 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,577 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,577 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,577 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,578 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,578 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,578 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,578 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,578 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,578 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,579 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,579 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,579 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,579 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,579 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,579 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,579 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,583 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,584 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,584 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,584 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,584 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,585 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,585 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,585 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,586 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,586 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,586 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,586 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,586 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,586 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,587 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,587 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,587 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,587 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,588 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,588 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,588 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,588 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,588 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,589 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,589 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,589 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,589 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,590 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,590 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,594 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,594 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,594 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,595 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,595 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,595 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,595 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,595 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,595 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,596 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,596 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,601 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,601 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,601 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,601 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,602 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,603 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,603 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,603 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,603 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,603 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,603 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,604 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,604 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,604 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,604 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,604 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,605 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,605 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,605 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,605 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,605 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,606 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,606 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,606 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,606 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,606 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,606 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,607 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,607 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,607 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,607 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,607 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,608 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,608 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,608 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,608 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,608 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,608 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,609 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,609 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,609 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,609 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,609 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,610 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,610 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,610 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,610 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,610 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,612 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,612 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,612 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,612 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,613 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,614 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,614 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,614 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:36,629 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-11 15:12:36,650 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 15:12:36,650 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-11 15:12:36,650 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 15:12:36,650 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 15:12:36,650 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 15:12:36,651 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 15:12:36,651 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 15:12:36,651 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 15:12:36,666 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-11 15:12:36,668 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 128 transitions, 276 flow [2020-10-11 15:12:36,671 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 128 transitions, 276 flow [2020-10-11 15:12:36,673 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 139 places, 128 transitions, 276 flow [2020-10-11 15:12:36,731 INFO L129 PetriNetUnfolder]: 2/124 cut-off events. [2020-10-11 15:12:36,732 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 15:12:36,737 INFO L80 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2020-10-11 15:12:36,742 INFO L117 LiptonReduction]: Number of co-enabled transitions 2156 [2020-10-11 15:12:36,838 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-11 15:12:36,839 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:36,864 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:36,866 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:36,867 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:36,869 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:36,874 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:36,876 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:12:36,886 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-11 15:12:36,886 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:36,933 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:36,934 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:36,936 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:36,937 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:36,939 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:36,941 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:12:36,946 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-11 15:12:36,947 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:36,982 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-11 15:12:36,982 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,044 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,047 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,048 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,049 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,051 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,052 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:12:37,057 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-11 15:12:37,057 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,076 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-11 15:12:37,076 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,113 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-11 15:12:37,114 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,130 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,132 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,134 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,135 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,136 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,137 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-11 15:12:37,138 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,141 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:12:37,245 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-11 15:12:37,246 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,262 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,263 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,263 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,264 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,265 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-11 15:12:37,265 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,267 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:12:37,270 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:12:37,309 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-11 15:12:37,310 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,316 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,318 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,319 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,320 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,321 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,322 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-11 15:12:37,322 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,324 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:12:37,384 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,385 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,386 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,387 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,388 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,389 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:12:37,392 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-11 15:12:37,392 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,397 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-11 15:12:37,397 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,447 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,448 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,449 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,450 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,451 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,452 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-11 15:12:37,453 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,454 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:12:37,533 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:12:37,534 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,542 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:12:37,542 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,543 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:12:37,543 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,544 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-11 15:12:37,544 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,546 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:12:37,546 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,547 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-11 15:12:37,547 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,549 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,550 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,551 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,552 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,553 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,554 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:12:37,557 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-11 15:12:37,557 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,561 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 3, 2, 3, 2, 5, 4, 5, 4, 1] term [2020-10-11 15:12:37,561 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 15:12:37,564 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 3, 2, 5, 4, 5, 4, 5, 4, 1] term [2020-10-11 15:12:37,564 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 15:12:37,565 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 5, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-10-11 15:12:37,566 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 15:12:37,567 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 5, 4, 5, 4, 3, 2, 5, 4, 5, 4, 1] term [2020-10-11 15:12:37,567 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 15:12:37,569 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 5, 4, 3, 2, 3, 2, 5, 4, 5, 4, 1] term [2020-10-11 15:12:37,569 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 15:12:37,572 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 7, 2, 6, 2, 6, 2, 7, 4, 5, 4, 1] term [2020-10-11 15:12:37,572 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:12:37,574 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 4, 6, 4, 8, 4, 8, 4, 5, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-10-11 15:12:37,574 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:12:37,577 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 2, 6, 2, 8, 4, 8, 4, 5, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-10-11 15:12:37,577 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:12:37,654 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,654 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,656 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,657 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,658 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,659 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-11 15:12:37,659 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,661 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:12:37,665 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 3, 2, 4, 2, 5, 4, 6, 4, 6, 4, 5, 4, 1] term [2020-10-11 15:12:37,666 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-11 15:12:37,669 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 12, 2, 11, 2, 10, 4, 8, 4, 5, 4, 1] term [2020-10-11 15:12:37,669 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:12:37,673 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-11 15:12:37,674 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,723 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,723 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,724 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,725 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,726 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-11 15:12:37,726 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,727 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:12:37,730 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:12:37,737 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-11 15:12:37,737 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,748 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 3, 1] term [2020-10-11 15:12:37,749 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,750 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-10-11 15:12:37,750 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,785 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 5, 4, 5, 4, 2, 1] term [2020-10-11 15:12:37,785 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:12:37,786 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 4, 5, 4, 2, 1] term [2020-10-11 15:12:37,787 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:12:37,787 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 5, 4, 2, 1] term [2020-10-11 15:12:37,788 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:12:37,788 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-10-11 15:12:37,789 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:12:37,789 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-11 15:12:37,790 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:12:37,791 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-11 15:12:37,791 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:12:37,792 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-11 15:12:37,793 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:12:37,793 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-11 15:12:37,794 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:12:37,794 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 12, 2, 11, 2, 10, 4, 8, 4, 3, 1] term [2020-10-11 15:12:37,795 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,796 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 5, 4, 5, 4, 3, 2, 2, 2, 2, 1] term [2020-10-11 15:12:37,796 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,797 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 5, 4, 3, 2, 2, 2, 2, 1] term [2020-10-11 15:12:37,797 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,798 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 2, 2, 2, 1] term [2020-10-11 15:12:37,798 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,799 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-11 15:12:37,799 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,800 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 2, 2, 1] term [2020-10-11 15:12:37,800 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,801 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-11 15:12:37,801 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,801 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-11 15:12:37,802 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,803 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 3, 2, 2, 2, 2, 1] term [2020-10-11 15:12:37,803 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,804 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 2, 2, 1] term [2020-10-11 15:12:37,804 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,805 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 2, 2, 1] term [2020-10-11 15:12:37,805 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,811 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,812 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,813 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,814 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,815 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,816 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-11 15:12:37,817 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:37,818 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:12:38,489 WARN L193 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 70 [2020-10-11 15:12:38,493 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-11 15:12:38,494 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:38,495 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-11 15:12:38,495 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:38,627 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-10-11 15:12:38,798 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:38,799 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:38,800 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:38,802 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:38,803 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:38,804 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-11 15:12:38,805 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:38,807 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:12:38,842 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:38,843 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:38,844 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:38,846 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:38,846 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-11 15:12:38,847 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:38,849 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:12:38,851 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:12:38,864 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-11 15:12:38,865 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:43,571 WARN L193 SmtUtils]: Spent 4.56 s on a formula simplification. DAG size of input: 406 DAG size of output: 364 [2020-10-11 15:12:43,586 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-11 15:12:43,587 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:43,613 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 5, 2, 4, 2, 4, 3, 3, 2, 1] term [2020-10-11 15:12:43,613 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:43,614 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 2, 2, 3, 3, 3, 2, 1] term [2020-10-11 15:12:43,614 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:43,614 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 3, 3, 2, 1] term [2020-10-11 15:12:43,615 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:43,615 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 3, 2, 1] term [2020-10-11 15:12:43,616 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:43,616 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-11 15:12:43,616 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:45,164 WARN L193 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 198 DAG size of output: 174 [2020-10-11 15:12:45,273 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:45,274 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:45,274 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:45,275 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:45,276 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:45,277 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:12:45,279 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-11 15:12:45,280 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:45,290 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-11 15:12:45,291 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:45,318 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-11 15:12:45,318 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:45,333 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:45,334 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:45,334 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:45,335 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:45,336 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:45,336 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-11 15:12:45,337 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:45,338 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:12:45,528 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:45,760 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-11 15:12:45,761 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:45,762 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-11 15:12:45,762 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:45,771 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-11 15:12:45,771 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:45,772 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-11 15:12:45,772 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:45,932 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:46,321 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-10-11 15:12:46,430 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-10-11 15:12:46,441 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 2, 3, 3, 2, 2, 2, 1] term [2020-10-11 15:12:46,441 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:12:46,442 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 3, 3, 2, 2, 2, 1] term [2020-10-11 15:12:46,443 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:12:46,444 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 2, 2, 2, 1] term [2020-10-11 15:12:46,444 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:12:46,445 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-11 15:12:46,445 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:12:46,445 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-11 15:12:46,446 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:12:46,446 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-11 15:12:46,446 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:12:46,447 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-11 15:12:46,447 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:12:46,448 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-11 15:12:46,448 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:12:46,460 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 2, 1] term [2020-10-11 15:12:46,461 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:46,462 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-10-11 15:12:46,463 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:46,706 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:46,707 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:46,785 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:46,786 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:46,799 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 2, 1] term [2020-10-11 15:12:46,799 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:46,800 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-10-11 15:12:46,800 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:46,812 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 2, 3, 3, 2, 2, 2, 1] term [2020-10-11 15:12:46,813 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:12:46,814 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 3, 3, 2, 2, 2, 1] term [2020-10-11 15:12:46,814 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:12:46,815 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 2, 2, 2, 1] term [2020-10-11 15:12:46,815 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:12:46,816 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-11 15:12:46,816 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:12:46,816 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-11 15:12:46,817 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:12:46,818 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-11 15:12:46,818 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:12:46,819 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-11 15:12:46,819 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:12:46,820 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-11 15:12:46,820 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:12:47,020 WARN L193 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2020-10-11 15:12:47,222 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-11 15:12:47,223 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:47,223 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-11 15:12:47,223 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:47,232 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-11 15:12:47,232 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:47,233 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-11 15:12:47,233 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:47,328 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:47,370 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:47,412 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:47,706 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:47,725 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:12:47,725 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:47,726 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-11 15:12:47,726 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:47,728 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:12:47,728 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 15:12:47,729 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 3, 2, 2, 1] term [2020-10-11 15:12:47,730 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 15:12:47,731 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 3, 2, 2, 1] term [2020-10-11 15:12:47,731 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 15:12:47,734 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 2, 6, 2, 3, 3, 3, 2, 2, 1] term [2020-10-11 15:12:47,734 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:12:47,735 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 2, 6, 2, 3, 2, 3, 2, 2, 1] term [2020-10-11 15:12:47,735 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:12:47,738 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 2, 6, 3, 3, 2, 3, 2, 2, 1] term [2020-10-11 15:12:47,738 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:12:47,739 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 2, 3, 2, 3, 2, 2, 1] term [2020-10-11 15:12:47,739 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:12:47,741 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 2, 6, 2, 3, 2, 3, 2, 2, 1] term [2020-10-11 15:12:47,741 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:12:47,742 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 2, 6, 2, 3, 2, 3, 2, 2, 1] term [2020-10-11 15:12:47,742 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:12:47,744 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 2, 6, 2, 3, 2, 3, 2, 2, 1] term [2020-10-11 15:12:47,744 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:12:47,745 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:47,745 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:47,747 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:47,748 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:47,749 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:47,750 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:47,751 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:47,752 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:47,752 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:47,753 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:47,754 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:47,783 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 2, 2, 3, 3, 3, 3, 3, 2, 1] term [2020-10-11 15:12:47,784 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 15:12:47,786 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 3, 2, 2, 2, 3, 3, 3, 3, 3, 2, 1] term [2020-10-11 15:12:47,786 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:12:47,823 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:47,906 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 2, 2, 3, 3, 3, 3, 3, 2, 1] term [2020-10-11 15:12:47,907 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 15:12:47,909 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 3, 2, 2, 2, 3, 3, 3, 3, 3, 2, 1] term [2020-10-11 15:12:47,909 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:12:47,927 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:12:47,928 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:47,928 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-11 15:12:47,929 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:47,930 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:47,932 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:12:47,932 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 15:12:47,933 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:12:47,933 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 15:12:47,934 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:12:47,935 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 15:12:47,937 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 2, 4, 2, 3, 2, 3, 3, 3, 2, 1] term [2020-10-11 15:12:47,937 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:12:47,938 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 2, 6, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:12:47,938 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:12:47,940 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:12:47,940 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:12:47,941 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 2, 6, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:12:47,942 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:12:47,943 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 2, 6, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:12:47,943 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:12:47,945 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 2, 6, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:12:47,945 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:12:47,946 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 2, 6, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:12:47,946 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:12:48,161 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2020-10-11 15:12:48,211 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:12:48,661 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-10-11 15:12:48,782 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-10-11 15:12:49,451 WARN L193 SmtUtils]: Spent 288.00 ms on a formula simplification that was a NOOP. DAG size: 146 [2020-10-11 15:12:49,751 WARN L193 SmtUtils]: Spent 297.00 ms on a formula simplification that was a NOOP. DAG size: 142 [2020-10-11 15:12:50,396 WARN L193 SmtUtils]: Spent 599.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 146 [2020-10-11 15:12:50,691 WARN L193 SmtUtils]: Spent 293.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2020-10-11 15:12:50,700 INFO L132 LiptonReduction]: Checked pairs total: 6198 [2020-10-11 15:12:50,700 INFO L134 LiptonReduction]: Total number of compositions: 110 [2020-10-11 15:12:50,706 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 42 places, 29 transitions, 78 flow [2020-10-11 15:12:50,801 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1770 states. [2020-10-11 15:12:50,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1770 states. [2020-10-11 15:12:50,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-11 15:12:50,816 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:12:50,817 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:12:50,817 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:12:50,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:12:50,823 INFO L82 PathProgramCache]: Analyzing trace with hash 329041338, now seen corresponding path program 1 times [2020-10-11 15:12:50,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:12:50,834 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109570213] [2020-10-11 15:12:50,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:12:51,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:12:51,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:12:51,199 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109570213] [2020-10-11 15:12:51,201 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:12:51,201 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-11 15:12:51,202 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428180074] [2020-10-11 15:12:51,207 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 15:12:51,208 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:12:51,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 15:12:51,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 15:12:51,226 INFO L87 Difference]: Start difference. First operand 1770 states. Second operand 3 states. [2020-10-11 15:12:51,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:12:51,313 INFO L93 Difference]: Finished difference Result 1690 states and 6328 transitions. [2020-10-11 15:12:51,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 15:12:51,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-11 15:12:51,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:12:51,355 INFO L225 Difference]: With dead ends: 1690 [2020-10-11 15:12:51,355 INFO L226 Difference]: Without dead ends: 1370 [2020-10-11 15:12:51,356 INFO L673 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-10-11 15:12:51,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2020-10-11 15:12:51,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1370. [2020-10-11 15:12:51,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1370 states. [2020-10-11 15:12:51,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1370 states and 5032 transitions. [2020-10-11 15:12:51,507 INFO L78 Accepts]: Start accepts. Automaton has 1370 states and 5032 transitions. Word has length 11 [2020-10-11 15:12:51,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:12:51,508 INFO L481 AbstractCegarLoop]: Abstraction has 1370 states and 5032 transitions. [2020-10-11 15:12:51,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 15:12:51,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 5032 transitions. [2020-10-11 15:12:51,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-11 15:12:51,512 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:12:51,512 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:12:51,512 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-11 15:12:51,513 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:12:51,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:12:51,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1900693266, now seen corresponding path program 1 times [2020-10-11 15:12:51,513 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:12:51,513 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203482231] [2020-10-11 15:12:51,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:12:51,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:12:51,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:12:51,587 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203482231] [2020-10-11 15:12:51,587 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:12:51,588 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 15:12:51,588 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572806950] [2020-10-11 15:12:51,589 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-11 15:12:51,590 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:12:51,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-11 15:12:51,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-11 15:12:51,590 INFO L87 Difference]: Start difference. First operand 1370 states and 5032 transitions. Second operand 4 states. [2020-10-11 15:12:51,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:12:51,644 INFO L93 Difference]: Finished difference Result 1670 states and 5910 transitions. [2020-10-11 15:12:51,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-11 15:12:51,645 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-11 15:12:51,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:12:51,653 INFO L225 Difference]: With dead ends: 1670 [2020-10-11 15:12:51,653 INFO L226 Difference]: Without dead ends: 830 [2020-10-11 15:12:51,655 INFO L673 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-10-11 15:12:51,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2020-10-11 15:12:51,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 830. [2020-10-11 15:12:51,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2020-10-11 15:12:51,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 2792 transitions. [2020-10-11 15:12:51,685 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 2792 transitions. Word has length 12 [2020-10-11 15:12:51,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:12:51,685 INFO L481 AbstractCegarLoop]: Abstraction has 830 states and 2792 transitions. [2020-10-11 15:12:51,685 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-11 15:12:51,686 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 2792 transitions. [2020-10-11 15:12:51,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-11 15:12:51,691 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:12:51,691 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:12:51,691 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-11 15:12:51,691 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:12:51,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:12:51,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1354422135, now seen corresponding path program 1 times [2020-10-11 15:12:51,692 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:12:51,692 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599392522] [2020-10-11 15:12:51,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:12:51,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:12:51,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:12:51,812 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599392522] [2020-10-11 15:12:51,812 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:12:51,812 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-11 15:12:51,813 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788443310] [2020-10-11 15:12:51,813 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 15:12:51,813 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:12:51,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 15:12:51,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 15:12:51,814 INFO L87 Difference]: Start difference. First operand 830 states and 2792 transitions. Second operand 3 states. [2020-10-11 15:12:51,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:12:51,827 INFO L93 Difference]: Finished difference Result 806 states and 2698 transitions. [2020-10-11 15:12:51,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 15:12:51,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-10-11 15:12:51,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:12:51,834 INFO L225 Difference]: With dead ends: 806 [2020-10-11 15:12:51,835 INFO L226 Difference]: Without dead ends: 806 [2020-10-11 15:12:51,835 INFO L673 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-10-11 15:12:51,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2020-10-11 15:12:51,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 806. [2020-10-11 15:12:51,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2020-10-11 15:12:51,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 2698 transitions. [2020-10-11 15:12:51,863 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 2698 transitions. Word has length 14 [2020-10-11 15:12:51,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:12:51,863 INFO L481 AbstractCegarLoop]: Abstraction has 806 states and 2698 transitions. [2020-10-11 15:12:51,863 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 15:12:51,864 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 2698 transitions. [2020-10-11 15:12:51,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-11 15:12:51,865 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:12:51,865 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:12:51,866 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-11 15:12:51,866 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:12:51,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:12:51,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1062043247, now seen corresponding path program 1 times [2020-10-11 15:12:51,866 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:12:51,866 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591247710] [2020-10-11 15:12:51,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:12:51,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:12:51,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:12:51,931 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591247710] [2020-10-11 15:12:51,931 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:12:51,931 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 15:12:51,932 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663228743] [2020-10-11 15:12:51,932 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-11 15:12:51,932 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:12:51,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-11 15:12:51,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-11 15:12:51,933 INFO L87 Difference]: Start difference. First operand 806 states and 2698 transitions. Second operand 4 states. [2020-10-11 15:12:51,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:12:51,968 INFO L93 Difference]: Finished difference Result 998 states and 3258 transitions. [2020-10-11 15:12:51,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-11 15:12:51,969 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-10-11 15:12:51,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:12:51,973 INFO L225 Difference]: With dead ends: 998 [2020-10-11 15:12:51,973 INFO L226 Difference]: Without dead ends: 518 [2020-10-11 15:12:51,974 INFO L673 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-10-11 15:12:51,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2020-10-11 15:12:51,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 518. [2020-10-11 15:12:51,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2020-10-11 15:12:51,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 1582 transitions. [2020-10-11 15:12:51,991 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 1582 transitions. Word has length 15 [2020-10-11 15:12:51,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:12:51,991 INFO L481 AbstractCegarLoop]: Abstraction has 518 states and 1582 transitions. [2020-10-11 15:12:51,991 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-11 15:12:51,991 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 1582 transitions. [2020-10-11 15:12:51,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-11 15:12:51,993 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:12:51,993 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:12:51,993 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-11 15:12:51,993 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:12:51,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:12:51,994 INFO L82 PathProgramCache]: Analyzing trace with hash -6460399, now seen corresponding path program 1 times [2020-10-11 15:12:51,994 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:12:51,994 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009524116] [2020-10-11 15:12:51,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:12:52,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:12:52,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:12:52,120 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009524116] [2020-10-11 15:12:52,120 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:12:52,120 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 15:12:52,120 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765710219] [2020-10-11 15:12:52,121 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-11 15:12:52,121 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:12:52,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-11 15:12:52,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-11 15:12:52,122 INFO L87 Difference]: Start difference. First operand 518 states and 1582 transitions. Second operand 4 states. [2020-10-11 15:12:52,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:12:52,156 INFO L93 Difference]: Finished difference Result 658 states and 1974 transitions. [2020-10-11 15:12:52,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-11 15:12:52,157 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-10-11 15:12:52,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:12:52,160 INFO L225 Difference]: With dead ends: 658 [2020-10-11 15:12:52,160 INFO L226 Difference]: Without dead ends: 268 [2020-10-11 15:12:52,161 INFO L673 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-10-11 15:12:52,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2020-10-11 15:12:52,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2020-10-11 15:12:52,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2020-10-11 15:12:52,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 736 transitions. [2020-10-11 15:12:52,170 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 736 transitions. Word has length 17 [2020-10-11 15:12:52,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:12:52,171 INFO L481 AbstractCegarLoop]: Abstraction has 268 states and 736 transitions. [2020-10-11 15:12:52,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-11 15:12:52,171 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 736 transitions. [2020-10-11 15:12:52,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-11 15:12:52,173 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:12:52,173 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:12:52,173 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-11 15:12:52,173 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:12:52,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:12:52,174 INFO L82 PathProgramCache]: Analyzing trace with hash 997923251, now seen corresponding path program 1 times [2020-10-11 15:12:52,174 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:12:52,175 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355117007] [2020-10-11 15:12:52,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:12:52,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:12:52,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:12:52,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355117007] [2020-10-11 15:12:52,447 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:12:52,448 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:12:52,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918039299] [2020-10-11 15:12:52,449 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 15:12:52,449 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:12:52,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 15:12:52,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:12:52,450 INFO L87 Difference]: Start difference. First operand 268 states and 736 transitions. Second operand 7 states. [2020-10-11 15:12:52,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:12:52,588 INFO L93 Difference]: Finished difference Result 418 states and 1140 transitions. [2020-10-11 15:12:52,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-11 15:12:52,589 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-10-11 15:12:52,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:12:52,593 INFO L225 Difference]: With dead ends: 418 [2020-10-11 15:12:52,593 INFO L226 Difference]: Without dead ends: 418 [2020-10-11 15:12:52,593 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-10-11 15:12:52,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2020-10-11 15:12:52,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2020-10-11 15:12:52,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2020-10-11 15:12:52,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 1140 transitions. [2020-10-11 15:12:52,608 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 1140 transitions. Word has length 18 [2020-10-11 15:12:52,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:12:52,608 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 1140 transitions. [2020-10-11 15:12:52,609 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 15:12:52,609 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 1140 transitions. [2020-10-11 15:12:52,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-11 15:12:52,610 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:12:52,610 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:12:52,610 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-11 15:12:52,610 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:12:52,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:12:52,610 INFO L82 PathProgramCache]: Analyzing trace with hash 226364593, now seen corresponding path program 2 times [2020-10-11 15:12:52,611 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:12:52,612 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629337778] [2020-10-11 15:12:52,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:12:52,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:12:53,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:12:53,021 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629337778] [2020-10-11 15:12:53,021 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:12:53,021 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:12:53,021 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454304254] [2020-10-11 15:12:53,022 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 15:12:53,022 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:12:53,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 15:12:53,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:12:53,023 INFO L87 Difference]: Start difference. First operand 418 states and 1140 transitions. Second operand 7 states. [2020-10-11 15:12:53,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:12:53,174 INFO L93 Difference]: Finished difference Result 410 states and 1112 transitions. [2020-10-11 15:12:53,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-11 15:12:53,175 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-10-11 15:12:53,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:12:53,177 INFO L225 Difference]: With dead ends: 410 [2020-10-11 15:12:53,178 INFO L226 Difference]: Without dead ends: 410 [2020-10-11 15:12:53,178 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-10-11 15:12:53,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2020-10-11 15:12:53,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 260. [2020-10-11 15:12:53,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2020-10-11 15:12:53,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 708 transitions. [2020-10-11 15:12:53,187 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 708 transitions. Word has length 18 [2020-10-11 15:12:53,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:12:53,188 INFO L481 AbstractCegarLoop]: Abstraction has 260 states and 708 transitions. [2020-10-11 15:12:53,188 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 15:12:53,188 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 708 transitions. [2020-10-11 15:12:53,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-11 15:12:53,189 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:12:53,189 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:12:53,189 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-11 15:12:53,189 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:12:53,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:12:53,189 INFO L82 PathProgramCache]: Analyzing trace with hash 870847541, now seen corresponding path program 1 times [2020-10-11 15:12:53,190 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:12:53,190 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128637548] [2020-10-11 15:12:53,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:12:53,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:12:53,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:12:53,285 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128637548] [2020-10-11 15:12:53,285 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:12:53,285 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 15:12:53,285 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635570453] [2020-10-11 15:12:53,286 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-11 15:12:53,286 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:12:53,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-11 15:12:53,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-11 15:12:53,287 INFO L87 Difference]: Start difference. First operand 260 states and 708 transitions. Second operand 4 states. [2020-10-11 15:12:53,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:12:53,330 INFO L93 Difference]: Finished difference Result 292 states and 748 transitions. [2020-10-11 15:12:53,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-11 15:12:53,331 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-10-11 15:12:53,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:12:53,333 INFO L225 Difference]: With dead ends: 292 [2020-10-11 15:12:53,333 INFO L226 Difference]: Without dead ends: 238 [2020-10-11 15:12:53,334 INFO L673 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-10-11 15:12:53,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2020-10-11 15:12:53,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2020-10-11 15:12:53,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2020-10-11 15:12:53,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 622 transitions. [2020-10-11 15:12:53,341 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 622 transitions. Word has length 19 [2020-10-11 15:12:53,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:12:53,341 INFO L481 AbstractCegarLoop]: Abstraction has 238 states and 622 transitions. [2020-10-11 15:12:53,341 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-11 15:12:53,341 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 622 transitions. [2020-10-11 15:12:53,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-11 15:12:53,342 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:12:53,342 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:12:53,342 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-11 15:12:53,342 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:12:53,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:12:53,343 INFO L82 PathProgramCache]: Analyzing trace with hash 614836759, now seen corresponding path program 1 times [2020-10-11 15:12:53,343 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:12:53,343 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302000411] [2020-10-11 15:12:53,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:12:53,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:12:53,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:12:53,436 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302000411] [2020-10-11 15:12:53,436 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:12:53,436 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-11 15:12:53,436 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778630268] [2020-10-11 15:12:53,437 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 15:12:53,437 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:12:53,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 15:12:53,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-11 15:12:53,437 INFO L87 Difference]: Start difference. First operand 238 states and 622 transitions. Second operand 5 states. [2020-10-11 15:12:53,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:12:53,490 INFO L93 Difference]: Finished difference Result 237 states and 565 transitions. [2020-10-11 15:12:53,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 15:12:53,491 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-10-11 15:12:53,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:12:53,492 INFO L225 Difference]: With dead ends: 237 [2020-10-11 15:12:53,492 INFO L226 Difference]: Without dead ends: 193 [2020-10-11 15:12:53,493 INFO L673 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-10-11 15:12:53,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2020-10-11 15:12:53,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2020-10-11 15:12:53,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2020-10-11 15:12:53,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 458 transitions. [2020-10-11 15:12:53,498 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 458 transitions. Word has length 20 [2020-10-11 15:12:53,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:12:53,499 INFO L481 AbstractCegarLoop]: Abstraction has 193 states and 458 transitions. [2020-10-11 15:12:53,499 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 15:12:53,499 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 458 transitions. [2020-10-11 15:12:53,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-11 15:12:53,500 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:12:53,500 INFO L421 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-10-11 15:12:53,500 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-11 15:12:53,500 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:12:53,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:12:53,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1946941222, now seen corresponding path program 1 times [2020-10-11 15:12:53,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:12:53,501 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557155254] [2020-10-11 15:12:53,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:12:53,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:12:53,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:12:53,597 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557155254] [2020-10-11 15:12:53,597 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:12:53,598 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:12:53,598 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028638774] [2020-10-11 15:12:53,598 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 15:12:53,598 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:12:53,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 15:12:53,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-11 15:12:53,599 INFO L87 Difference]: Start difference. First operand 193 states and 458 transitions. Second operand 6 states. [2020-10-11 15:12:53,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:12:53,664 INFO L93 Difference]: Finished difference Result 175 states and 389 transitions. [2020-10-11 15:12:53,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-11 15:12:53,665 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-10-11 15:12:53,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:12:53,666 INFO L225 Difference]: With dead ends: 175 [2020-10-11 15:12:53,666 INFO L226 Difference]: Without dead ends: 150 [2020-10-11 15:12:53,667 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:12:53,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2020-10-11 15:12:53,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2020-10-11 15:12:53,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-10-11 15:12:53,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 333 transitions. [2020-10-11 15:12:53,671 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 333 transitions. Word has length 21 [2020-10-11 15:12:53,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:12:53,672 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 333 transitions. [2020-10-11 15:12:53,672 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 15:12:53,672 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 333 transitions. [2020-10-11 15:12:53,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 15:12:53,673 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:12:53,673 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:12:53,673 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-11 15:12:53,673 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:12:53,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:12:53,674 INFO L82 PathProgramCache]: Analyzing trace with hash 225178955, now seen corresponding path program 1 times [2020-10-11 15:12:53,674 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:12:53,674 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520569850] [2020-10-11 15:12:53,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:12:53,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:12:53,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:12:53,852 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520569850] [2020-10-11 15:12:53,852 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:12:53,852 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 15:12:53,852 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514103677] [2020-10-11 15:12:53,853 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 15:12:53,853 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:12:53,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 15:12:53,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:12:53,853 INFO L87 Difference]: Start difference. First operand 150 states and 333 transitions. Second operand 7 states. [2020-10-11 15:12:53,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:12:53,931 INFO L93 Difference]: Finished difference Result 139 states and 309 transitions. [2020-10-11 15:12:53,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-11 15:12:53,932 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-10-11 15:12:53,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:12:53,933 INFO L225 Difference]: With dead ends: 139 [2020-10-11 15:12:53,933 INFO L226 Difference]: Without dead ends: 131 [2020-10-11 15:12:53,933 INFO L673 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-10-11 15:12:53,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-10-11 15:12:53,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2020-10-11 15:12:53,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2020-10-11 15:12:53,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 295 transitions. [2020-10-11 15:12:53,937 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 295 transitions. Word has length 22 [2020-10-11 15:12:53,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:12:53,937 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 295 transitions. [2020-10-11 15:12:53,938 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 15:12:53,938 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 295 transitions. [2020-10-11 15:12:53,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-11 15:12:53,938 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:12:53,939 INFO L421 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] [2020-10-11 15:12:53,939 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-11 15:12:53,939 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:12:53,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:12:53,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1575275838, now seen corresponding path program 1 times [2020-10-11 15:12:53,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:12:53,940 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949574724] [2020-10-11 15:12:53,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:12:53,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 15:12:53,987 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 15:12:54,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 15:12:54,053 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 15:12:54,124 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-11 15:12:54,124 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-11 15:12:54,124 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-11 15:12:54,125 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-11 15:12:54,149 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1223] [1223] L3-->L868: Formula: (let ((.cse8 (= (mod ~a$w_buff0_used~0_In-58549380 256) 0)) (.cse7 (= (mod ~a$r_buff0_thd0~0_In-58549380 256) 0)) (.cse9 (= (mod ~a$r_buff1_thd0~0_In-58549380 256) 0)) (.cse10 (= (mod ~a$w_buff1_used~0_In-58549380 256) 0))) (let ((.cse0 (or .cse9 .cse10)) (.cse1 (not .cse10)) (.cse2 (not .cse9)) (.cse4 (or .cse8 .cse7)) (.cse5 (not .cse8)) (.cse6 (not .cse7))) (and (= ~a$r_buff0_thd0~0_In-58549380 ~a$r_buff0_thd0~0_Out-58549380) (or (and .cse0 (= ~a$w_buff1_used~0_In-58549380 ~a$w_buff1_used~0_Out-58549380)) (and (= ~a$w_buff1_used~0_Out-58549380 0) .cse1 .cse2)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In-58549380| ULTIMATE.start_assume_abort_if_not_~cond_Out-58549380) (let ((.cse3 (select |#memory_int_In-58549380| |~#a~0.base_In-58549380|))) (or (and (or (and .cse0 (= |#memory_int_Out-58549380| (store |#memory_int_In-58549380| |~#a~0.base_In-58549380| (store .cse3 |~#a~0.offset_In-58549380| (select .cse3 |~#a~0.offset_In-58549380|))))) (and .cse1 (= |#memory_int_Out-58549380| (store |#memory_int_In-58549380| |~#a~0.base_In-58549380| (store .cse3 |~#a~0.offset_In-58549380| ~a$w_buff1~0_In-58549380))) .cse2)) .cse4) (and .cse5 (= |#memory_int_Out-58549380| (store |#memory_int_In-58549380| |~#a~0.base_In-58549380| (store .cse3 |~#a~0.offset_In-58549380| ~a$w_buff0~0_In-58549380))) .cse6))) (or (and .cse4 (= ~a$w_buff0_used~0_In-58549380 ~a$w_buff0_used~0_Out-58549380)) (and .cse5 (= ~a$w_buff0_used~0_Out-58549380 0) .cse6)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-58549380 0)) (= ~a$r_buff1_thd0~0_In-58549380 ~a$r_buff1_thd0~0_Out-58549380)))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-58549380|, ~a$w_buff1~0=~a$w_buff1~0_In-58549380, ~a$w_buff0~0=~a$w_buff0~0_In-58549380, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-58549380, #memory_int=|#memory_int_In-58549380|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-58549380, ~#a~0.base=|~#a~0.base_In-58549380|, ~#a~0.offset=|~#a~0.offset_In-58549380|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-58549380, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-58549380} OutVars{ULTIMATE.start_main_#t~mem62=|ULTIMATE.start_main_#t~mem62_Out-58549380|, ~a$w_buff0_used~0=~a$w_buff0_used~0_Out-58549380, ~#a~0.base=|~#a~0.base_In-58549380|, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out-58549380|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_Out-58549380, ULTIMATE.start_main_#t~ite66=|ULTIMATE.start_main_#t~ite66_Out-58549380|, ULTIMATE.start_main_#t~ite67=|ULTIMATE.start_main_#t~ite67_Out-58549380|, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out-58549380|, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out-58549380|, ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-58549380|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-58549380|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-58549380, ~a$w_buff1~0=~a$w_buff1~0_In-58549380, ~a$w_buff0~0=~a$w_buff0~0_In-58549380, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out-58549380, #memory_int=|#memory_int_Out-58549380|, ~#a~0.offset=|~#a~0.offset_In-58549380|, ~a$w_buff1_used~0=~a$w_buff1_used~0_Out-58549380} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem62, ~a$w_buff0_used~0, ULTIMATE.start_main_#t~ite68, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite65, ULTIMATE.start_main_#t~ite63, ULTIMATE.start_assume_abort_if_not_~cond, ~a$r_buff1_thd0~0, #memory_int, ~a$w_buff1_used~0] because there is no mapped edge [2020-10-11 15:12:54,158 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-10-11 15:12:54,158 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:12:54,158 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-10-11 15:12:54,159 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:12:54,159 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-10-11 15:12:54,159 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:12:54,159 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-10-11 15:12:54,159 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:12:54,159 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-10-11 15:12:54,160 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:12:54,160 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-10-11 15:12:54,160 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:12:54,160 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-10-11 15:12:54,160 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:12:54,161 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-10-11 15:12:54,161 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:12:54,161 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-10-11 15:12:54,161 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:12:54,161 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-10-11 15:12:54,161 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:12:54,162 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-10-11 15:12:54,162 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:12:54,162 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-10-11 15:12:54,162 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:12:54,164 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-10-11 15:12:54,164 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:12:54,164 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-10-11 15:12:54,165 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:12:54,165 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-10-11 15:12:54,165 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:12:54,165 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-10-11 15:12:54,165 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:12:54,165 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-10-11 15:12:54,165 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:12:54,166 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-10-11 15:12:54,166 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:12:54,166 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-10-11 15:12:54,167 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:12:54,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 03:12:54 BasicIcfg [2020-10-11 15:12:54,263 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-11 15:12:54,267 INFO L168 Benchmark]: Toolchain (without parser) took 21506.40 ms. Allocated memory was 248.5 MB in the beginning and 636.0 MB in the end (delta: 387.4 MB). Free memory was 201.4 MB in the beginning and 275.6 MB in the end (delta: -74.3 MB). Peak memory consumption was 313.2 MB. Max. memory is 14.2 GB. [2020-10-11 15:12:54,267 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 248.5 MB. Free memory is still 222.4 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-11 15:12:54,268 INFO L168 Benchmark]: CACSL2BoogieTranslator took 905.52 ms. Allocated memory was 248.5 MB in the beginning and 306.2 MB in the end (delta: 57.7 MB). Free memory was 201.4 MB in the beginning and 256.2 MB in the end (delta: -54.9 MB). Peak memory consumption was 30.6 MB. Max. memory is 14.2 GB. [2020-10-11 15:12:54,269 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.99 ms. Allocated memory is still 306.2 MB. Free memory was 256.2 MB in the beginning and 253.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-11 15:12:54,271 INFO L168 Benchmark]: Boogie Preprocessor took 57.06 ms. Allocated memory is still 306.2 MB. Free memory was 253.7 MB in the beginning and 251.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-11 15:12:54,273 INFO L168 Benchmark]: RCFGBuilder took 2711.48 ms. Allocated memory was 306.2 MB in the beginning and 368.6 MB in the end (delta: 62.4 MB). Free memory was 251.2 MB in the beginning and 252.9 MB in the end (delta: -1.7 MB). Peak memory consumption was 150.9 MB. Max. memory is 14.2 GB. [2020-10-11 15:12:54,274 INFO L168 Benchmark]: TraceAbstraction took 17762.22 ms. Allocated memory was 368.6 MB in the beginning and 636.0 MB in the end (delta: 267.4 MB). Free memory was 252.9 MB in the beginning and 275.6 MB in the end (delta: -22.7 MB). Peak memory consumption was 244.7 MB. Max. memory is 14.2 GB. [2020-10-11 15:12:54,281 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 248.5 MB. Free memory is still 222.4 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 905.52 ms. Allocated memory was 248.5 MB in the beginning and 306.2 MB in the end (delta: 57.7 MB). Free memory was 201.4 MB in the beginning and 256.2 MB in the end (delta: -54.9 MB). Peak memory consumption was 30.6 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 64.99 ms. Allocated memory is still 306.2 MB. Free memory was 256.2 MB in the beginning and 253.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 57.06 ms. Allocated memory is still 306.2 MB. Free memory was 253.7 MB in the beginning and 251.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2711.48 ms. Allocated memory was 306.2 MB in the beginning and 368.6 MB in the end (delta: 62.4 MB). Free memory was 251.2 MB in the beginning and 252.9 MB in the end (delta: -1.7 MB). Peak memory consumption was 150.9 MB. Max. memory is 14.2 GB. * TraceAbstraction took 17762.22 ms. Allocated memory was 368.6 MB in the beginning and 636.0 MB in the end (delta: 267.4 MB). Free memory was 252.9 MB in the beginning and 275.6 MB in the end (delta: -22.7 MB). Peak memory consumption was 244.7 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1401 VarBasedMoverChecksPositive, 85 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 66 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.3s, 155 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 14.0s, 139 PlacesBefore, 42 PlacesAfterwards, 128 TransitionsBefore, 29 TransitionsAfterwards, 2156 CoEnabledTransitionPairs, 8 FixpointIterations, 57 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 110 TotalNumberOfCompositions, 6198 MoverChecksTotal - CounterExampleResult [Line: 8]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L700] 0 int __unbuffered_cnt = 0; [L702] 0 int __unbuffered_p0_EAX = 0; [L703] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L704] 0 int __unbuffered_p0_EAX$mem_tmp; [L705] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L706] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L707] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L708] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L709] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L710] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L711] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L712] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L713] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L714] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L715] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L716] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L717] 0 int __unbuffered_p0_EAX$w_buff0; [L718] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L719] 0 int __unbuffered_p0_EAX$w_buff1; [L720] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L722] 0 int __unbuffered_p1_EAX = 0; [L724] 0 int __unbuffered_p2_EAX = 0; [L726] 0 int __unbuffered_p3_EAX = 0; [L728] 0 int a = 0; [L729] 0 _Bool a$flush_delayed; [L730] 0 int a$mem_tmp; [L731] 0 _Bool a$r_buff0_thd0; [L732] 0 _Bool a$r_buff0_thd1; [L733] 0 _Bool a$r_buff0_thd2; [L734] 0 _Bool a$r_buff0_thd3; [L735] 0 _Bool a$r_buff0_thd4; [L736] 0 _Bool a$r_buff1_thd0; [L737] 0 _Bool a$r_buff1_thd1; [L738] 0 _Bool a$r_buff1_thd2; [L739] 0 _Bool a$r_buff1_thd3; [L740] 0 _Bool a$r_buff1_thd4; [L741] 0 _Bool a$read_delayed; [L742] 0 int *a$read_delayed_var; [L743] 0 int a$w_buff0; [L744] 0 _Bool a$w_buff0_used; [L745] 0 int a$w_buff1; [L746] 0 _Bool a$w_buff1_used; [L747] 0 _Bool main$tmp_guard0; [L748] 0 _Bool main$tmp_guard1; [L750] 0 int x = 0; [L752] 0 int y = 0; [L754] 0 int z = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L850] 0 pthread_t t2705; [L851] FCALL, FORK 0 pthread_create(&t2705, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={6:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z=0] [L852] 0 pthread_t t2706; [L853] FCALL, FORK 0 pthread_create(&t2706, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={6:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z=0] [L854] 0 pthread_t t2707; [L855] FCALL, FORK 0 pthread_create(&t2707, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={6:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z=0] [L856] 0 pthread_t t2708; [L857] FCALL, FORK 0 pthread_create(&t2708, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={6:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z=0] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 a$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(a) [L764] 1 a$mem_tmp = a [L765] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L766] EXPR 1 !a$w_buff0_used ? a : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (weak$$choice0 ? a : (weak$$choice1 ? a$w_buff0 : a$w_buff1)) : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (weak$$choice0 ? a$w_buff1 : a$w_buff0) : (weak$$choice0 ? a$w_buff0 : a)))) [L766] EXPR 1 \read(a) [L766] EXPR 1 !a$w_buff0_used ? a : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (weak$$choice0 ? a : (weak$$choice1 ? a$w_buff0 : a$w_buff1)) : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (weak$$choice0 ? a$w_buff1 : a$w_buff0) : (weak$$choice0 ? a$w_buff0 : a)))) [L766] 1 a = !a$w_buff0_used ? a : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (weak$$choice0 ? a : (weak$$choice1 ? a$w_buff0 : a$w_buff1)) : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (weak$$choice0 ? a$w_buff1 : a$w_buff0) : (weak$$choice0 ? a$w_buff0 : a)))) [L767] EXPR 1 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? a$w_buff0 : a$w_buff0)))) [L767] 1 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? a$w_buff0 : a$w_buff0)))) [L768] EXPR 1 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff1 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? a$w_buff1 : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? a$w_buff1 : a$w_buff1)))) [L768] EXPR 1 !a$w_buff0_used ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff1 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? a$w_buff1 : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? a$w_buff1 : a$w_buff1))) [L768] EXPR 1 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff1 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? a$w_buff1 : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? a$w_buff1 : a$w_buff1)))) [L768] 1 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff1 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? a$w_buff1 : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? a$w_buff1 : a$w_buff1)))) [L769] EXPR 1 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L769] 1 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L770] EXPR 1 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? weak$$choice0 : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L770] 1 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? weak$$choice0 : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L771] EXPR 1 weak$$choice2 ? a$r_buff0_thd1 : (!a$w_buff0_used ? a$r_buff0_thd1 : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? a$r_buff0_thd1 : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L771] EXPR 1 !a$w_buff0_used ? a$r_buff0_thd1 : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? a$r_buff0_thd1 : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))) [L771] EXPR 1 weak$$choice2 ? a$r_buff0_thd1 : (!a$w_buff0_used ? a$r_buff0_thd1 : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? a$r_buff0_thd1 : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L771] 1 a$r_buff0_thd1 = weak$$choice2 ? a$r_buff0_thd1 : (!a$w_buff0_used ? a$r_buff0_thd1 : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? a$r_buff0_thd1 : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L772] EXPR 1 weak$$choice2 ? a$r_buff1_thd1 : (!a$w_buff0_used ? a$r_buff1_thd1 : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (weak$$choice0 ? a$r_buff1_thd1 : (_Bool)0) : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L772] EXPR 1 !a$w_buff0_used ? a$r_buff1_thd1 : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (weak$$choice0 ? a$r_buff1_thd1 : (_Bool)0) : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))) [L772] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (weak$$choice0 ? a$r_buff1_thd1 : (_Bool)0) : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] EXPR 1 !a$w_buff0_used ? a$r_buff1_thd1 : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (weak$$choice0 ? a$r_buff1_thd1 : (_Bool)0) : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))) [L772] EXPR 1 weak$$choice2 ? a$r_buff1_thd1 : (!a$w_buff0_used ? a$r_buff1_thd1 : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (weak$$choice0 ? a$r_buff1_thd1 : (_Bool)0) : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L772] 1 a$r_buff1_thd1 = weak$$choice2 ? a$r_buff1_thd1 : (!a$w_buff0_used ? a$r_buff1_thd1 : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (weak$$choice0 ? a$r_buff1_thd1 : (_Bool)0) : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L774] 1 __unbuffered_p0_EAX$read_delayed_var = &a [L775] EXPR 1 \read(a) [L775] 1 __unbuffered_p0_EAX = a [L776] EXPR 1 a$flush_delayed ? a$mem_tmp : a [L776] EXPR 1 \read(a) [L776] EXPR 1 a$flush_delayed ? a$mem_tmp : a [L776] 1 a = a$flush_delayed ? a$mem_tmp : a [L777] 1 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={6:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x=0, y=0, z=0] [L780] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={6:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x=1, y=0, z=0] [L792] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={6:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x=1, y=0, z=0] [L795] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={6:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x=1, y=1, z=0] [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 2 return 0; [L807] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=0, a={6:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x=1, y=1, z=0] [L810] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=0, a={6:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x=1, y=1, z=1] [L822] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a={6:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x=1, y=1, z=1] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L825] 4 a = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a={6:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x=1, y=1, z=1] [L785] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 1 return 0; [L828] 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) [L828] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L828] 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) [L828] 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) [L829] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L829] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L830] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L830] 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 [L831] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L831] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L832] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L832] 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 [L835] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L837] 4 return 0; [L859] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L870] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L871] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L871] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L872] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p3_EAX == 1) [L8] COND TRUE 0 !expression [L8] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a={6:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x=1, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 127 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 17.4s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 14.1s, HoareTripleCheckerStatistics: 260 SDtfs, 354 SDslu, 422 SDs, 0 SdLazy, 253 SolverSat, 65 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1770occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 150 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 211 NumberOfCodeBlocks, 211 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 176 ConstructedInterpolants, 0 QuantifiedInterpolants, 22357 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...